Full Text

• Apt (1981) Ten years of Hoare logic part I. ACM Transactions on Programming Languages and Systems 3:431-483.
• Apt (1984) Ten years of Hoare logic part II nondeterminism. Theoretical Computer Science 28:83-109.
• Ashcroft, Manna (1970) Formalization of properties of parallel programs. Machine Intelligence , B. Meltzer, D. Michie, Edinburgh University Press, Edinburgh, Scotland; 6:17-41.
• Back, Kurki-Suonio (1988) Distributed cooperation with action systems. ACM Trans. Programming Languages Systems 10:513-554.
• Back, Sere (1990) Stepwise refinement of parallel algorithms. Sci. Comput. Programming 13:133-180.
• Chandy, Misra Parallel Program Design: A Foundation, Addison–Wesley, Reading, MA; 1988.
• Chang, Keisler Model Theory, North–Holland, Amsterdam; 1973.
• Clarke (1980) Synthesis of resource invariants for concurrent programs. ACM Transactions on Programming Languages and Systems 2:338-358.
• de Bakker, Zucker (1982) Processes and the denotational semantics of concurrency. Inform. Control 54:70-120.
• Dijkstra A Discipline of Programming, Prentice–Hall, Englewood Cliffs, NJ; 1976.
• Dijkstra Formal Developments of Programs and Proofs, Addison–Wesley, Reading, MA; 1990.
• Floyd (1967) Assigning meanings to programs. Proc. Symp. Appl. Math. 19:19-32.
• Gribomont (1985) Synthesis of parallel programs invariants. Lecture Notes in Computer Science , Springer, Berlin; 186:325-338.
• Gribomont (1990) A Programming Logic for Formal Concurrent Systems. Lecture Notes in Computer Science , Springer, Berlin; 458:298-313.
• Gribomont (1990) Stepwise refinement and concurrency: the finite-state case. Sci. Comput. Programming 14:185-228.
• Gribomont Concurrency without toil: the proofs, University of Liége, Belgium, Internal Report; 1993.
• Hoare (1969) An axiomatic basis for computer programming. Communications of the ACM 12:576-583.
• Hoare Communicating Sequential Processes, Prentice–Hall, Englewood Cliffs, NJ; 1985.
• Keller (1976) Formal verification of parallel programs. Comm. ACM 19:371-384.
• Lamport (1974) A new solution of Dijkstra's concurrent programming problem. Comm. ACM 17:453-455.
• Lamport (1983) An assertional correctness proof of a distributed algorithm. Science of Computer Programming 2:175-206.
• Lamport (1988) Control predicates are better than dummy variables for reasoning about program control. ACM Trans. Programming Languages Systems 10:267-281.
• Lamport (1990) win and sin: predicate transformers for concurrency. ACM Trans. Programming Languages Systems 12:396-428.
• Manna, Pnueli (1983) How to cook a temporal proof system for your pet language. Proceedings 10th ACM Symposium on Principles of Programming Languages , Austin, TX; 141-154.
• Owicki, Gries (1976) An axiomatic proof technique for parallel programs. Acta Inform. 6:319-340.
• Ricart, Agrawala (1981) An optimal algorithm for mutual exclusion. Comm. ACM 24:9-17.
• Ricart, Agrawala (1981) An optimal algorithm for mutual exclusion. Comm. ACM , Corrigendum:; 24:578.
• Schlichting, Schneider (1984) Using message passing for distributed programming proof rules and disciplines. ACM Transactions on Programming Languages and Systems 6:402-431.
• Sifakis (1982) A unified approach for studying the properties of transition systems. Theoret. Comput. Sci. 18:227-259.
• Smyth (1978) Power domains. J. Comput. Systems Sci. 16:23-36.
• van Lamsweerde, Sintzoff (1979) Formal derivation of strongly correct concurrent programs. Acta Inform. 12:1-31.