Submodule Construction as Equation Solving in CCS

[1]  Keith A. Bartlett,et al.  A note on reliable full-duplex transmission over half-duplex links , 1969, Commun. ACM.

[2]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[3]  Daniel Brand,et al.  Towards Analyzing and Synthesizing Protocols , 1980, IEEE Trans. Commun..

[4]  Zohar Manna,et al.  A Deductive Approach to Program Synthesis , 1979, TOPL.

[5]  Edmund M. Clarke,et al.  Using Branching Time Temporal Logic to Synthesize Synchronization Skeletons , 1982, Sci. Comput. Program..

[6]  Michael Thomas Sanderson,et al.  Proof techniques for CCS , 1983 .

[7]  Gregor von Bochmann,et al.  On the Construction of Submodule Specifications and Communication Protocols , 1983, TOPL.

[8]  Pierre Wolper,et al.  Synthesis of Communicating Processes from Temporal Logic Specifications , 1981, TOPL.

[9]  C. A. R. Hoare,et al.  A Theory of Communicating Sequential Processes , 1984, JACM.

[10]  Mohamed G. Gouda,et al.  Synthesis of Communicating Finite-State Machines with Guaranteed Progress , 1984, IEEE Trans. Commun..

[11]  Rocco De Nicola,et al.  Testing Equivalences for Processes , 1984, Theor. Comput. Sci..

[12]  Robin Milner,et al.  A Complete Inference System for a Class of Regular Behaviours , 1984, J. Comput. Syst. Sci..

[13]  Reinhard Gotzhein,et al.  Deriving protocol specifications from service specifications , 1986, SIGCOMM '86.

[14]  George Papageorgiou,et al.  The synthesis of communication protocols , 1986, PODC '86.

[15]  Deriving protocol specifications from service specifications , 1986, SIGCOMM.

[16]  Zohar Manna,et al.  Towards Deductive Synthesis of Dataflow Networks , 1986, LICS.