| A Deductive Proof System for Multithreaded Java with Exceptions | 4 | 0.38 | 2008 |
| Formal Methods for Components and Objects, 5th International Symposium, FMCO 2006, Amsterdam, The Netherlands, November 7-10, 2006, Revised Lectures | 10 | 0.72 | 2007 |
| Formal Methods for Components and Objects, 4th International Symposium, FMCO 2005, Amsterdam, The Netherlands, November 1-4, 2005, Revised Lectures | 18 | 1.25 | 2006 |
| Formal Methods for Components and Objects, Third International Symposium, FMCO 2004, Leiden, The Netherlands, November 2 - 5, 2004, Revised Lectures | 13 | 0.95 | 2005 |
| Formal Methods for Components and Objects, Second International Symposium, FMCO 2003, Leiden, The Netherlands, November 4-7, 2003, Revised Lectures | 38 | 2.97 | 2004 |
| A Compositional Operational Semantics for JavaMT | 0 | 0.34 | 2003 |
| Verification for Java's Reentrant Multithreading Concept | 30 | 1.43 | 2002 |
| Basic Principles of a textbook on the compositional and noncompositional verification of concurrent programs | 0 | 0.34 | 2000 |
| The Semantic Foundations of a Compositional Proof Method for Synchronously Communicating Processes | 1 | 0.34 | 1999 |
| Formal Justification of the Rely-Guarantee Paradigm for Shared-Variable Concurrency: A Semantic Approach | 6 | 0.74 | 1999 |
| Programming Concepts and Methods, IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods (PROCOMET '98) 8-12 June 1998, Shelter Island, New York, USA | 28 | 10.27 | 1998 |
| Compositionality: The Significant Difference, International Symposium, COMPOS'97, Bad Malente, Germany, September 8-12, 1997. Revised Lectures | 13 | 1.50 | 1998 |
| A Dense-Time Temporal Logic with Nice Compositionality Properties | 2 | 0.37 | 1997 |
| Hoare-Style Compositional Proof Systems for Reactive Shared Variable Concurency | 6 | 0.44 | 1997 |
| A Compositional Proof System for Shared Variable Concurrency | 4 | 0.43 | 1997 |
| Compositional Proof Methods for Concurrency: A Semantic Approach | 3 | 0.42 | 1997 |
| The Need for Compositional Proof Systems: A Survey | 28 | 1.26 | 1997 |
| Compositionality in Real-Time Shared Variable Concurrency | 2 | 0.38 | 1996 |
| Modular Completeness: Integrating the Reuse of Specified Software in Top-down Program Development | 5 | 0.43 | 1996 |
| Simulation of Specification Statements in Hoare Logic | 2 | 0.42 | 1996 |
| Synthesizing Different Development Paradigms: Combining Top-Down with Bottom-Up Reasoning About Distributed Systems | 3 | 0.38 | 1995 |
| A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium, Noordwijkerhout, The Netherlands, June 1-4, 1993, Proceedings | 15 | 2.95 | 1994 |
| Formal Semantics for Ward & Mellor's Transformation Schemas and the Specification of Faul Tolerant Systems | 5 | 0.50 | 1994 |
| A Principle for Sequential Reasoning about Distributed Algorithms. | 17 | 1.09 | 1994 |
| Formal Techniques in Real-Time and Fault-Tolerant Systems, Third International Symposium Organized Jointly with the Working Group Provably Correct Systems - ProCoS, Lübeck, Germany, September 19-23, Proceedings | 49 | 10.41 | 1994 |
| Generalizing Abadi & Lamport's Method to Solve a Problem Posed by A. Pnueli | 3 | 0.42 | 1993 |
| Using Relative Refinement for Fault Tolerance | 5 | 0.45 | 1993 |
| Stepwise Refinement of Distributed Systems, Models, Formalisms, Correctness, REX Workshop, Mook, The Netherlands, May 29 - June 2, 1989, Proceedings | 28 | 8.40 | 1990 |
| The upsilon-Calculus as an Assertion-Language for Fairness Arguments | 1 | 0.35 | 1989 |
| Predicates are predicate transformers: a unified compositional theory for concurrency | 5 | 0.69 | 1989 |
| Designing Distributed Algorithms by Means of Formal Sequentially Phased Reasoning (Extended Abstract) | 15 | 1.20 | 1989 |
| Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop, Noordwijkerhout, The Netherlands, May 30 - June 3, 1988, Proceedings | 21 | 9.44 | 1989 |
| Design and verification in real-time distributed computing: an introduction to compositional methods | 11 | 2.96 | 1989 |
| Modeling Statecharts Behaviour in a Fully Abstract Way | 36 | 13.54 | 1988 |
| Compositionality and Modularity in Process Specification and Design: A Trace-State Based Approach | 4 | 0.60 | 1987 |
| A Correctness Proof of a Distributed Minimum-Weight Spanning Tree Algorithm (extended abstract) | 10 | 1.22 | 1987 |
| Process Constructors and Interpretations - Response | 1 | 0.34 | 1986 |
| Compositionality and Concurrent Networks: Soundness and Completeness of a Proofsystem | 36 | 6.65 | 1985 |
| Compositional Semantics for Real-time Distributed Computing | 50 | 16.11 | 1985 |
| A proof rule for fair termination of guarded commands | 41 | 8.81 | 1985 |
| A proof system for concurrent ADA programs | 22 | 7.17 | 1984 |
| Real-time programming and asynchronous message passing | 60 | 34.47 | 1983 |
| A Proof System for Partial Correctness of Dynamic Networks of Processes (Extended Abstract) | 6 | 0.58 | 1983 |
| Procedures and concurrency: A study in proof | 10 | 4.46 | 1982 |
| A Proof System for Brinch Hansen's Distributed Processes | 5 | 4.49 | 1981 |
| A Formalism for Reasoning about Fair Termination | 1 | 0.34 | 1981 |
| A Proof System for Communicating Sequential Processes | 184 | 91.98 | 1980 |
| The Evolution of List-Copying Algorithms | 12 | 3.45 | 1979 |
| Semantics of nondeterminism, concurrency, and communication | 32 | 25.11 | 1979 |
| Semantics of Nondeterminism, Concurrency and Communication (Extended Abstract) | 1 | 0.34 | 1978 |
