A model and temporal proof system for networks of processes

Completeness and incompleteness of trace-based network proof systems

POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages

Modular verification of asynchronous networks

PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing

Constrained expressions: toward broad applicability of analysis methods for distributed software systems

ACM Transactions on Programming Languages and Systems (TOPLAS)

Process semantics: universal axioms compositional rules, and applications

PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing

Predicates are predicate transformers: a unified compositional theory for concurrency

Proceedings of the eighth annual ACM Symposium on Principles of distributed computing

A fully abstract trace model for dataflow networks

POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Verifying General Safety Properties of Ada Tasking Programs

IEEE Transactions on Software Engineering

Using symbolic execution for verification of Ada tasking programs

ACM Transactions on Programming Languages and Systems (TOPLAS)

Trace-based network proof systems: expressiveness and completeness

ACM Transactions on Programming Languages and Systems (TOPLAS)

Compositional specification and verification of distributed systems

ACM Transactions on Programming Languages and Systems (TOPLAS)

Reasoning about meta level activities in open distributed systems

Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing

A generalized object model

OOPWORK '86 Proceedings of the 1986 SIGPLAN workshop on Object-oriented programming

Inheritance and Subtyping in a Parallel Object-Oriented Language

ECOOP '87 Proceedings of the European Conference on Object-Oriented Programming

The Need for Compositional Proof Systems: A Survey

COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference

A fully abstract trace model for dataflow and asynchronous networks

Distributed Computing

A refinement calculus for communicating processes with state

IW-FM'97 Proceedings of the 1st Irish conference on Formal Methods

Communication traces in the verification of distributed programs

2FACS'97 Proceedings of the 2nd BCS-FACS conference on Northern Formal Methods

Compositional Proofs For Networks Of Processes

Fundamenta Informaticae