| Parallel discrete event simulation: the making of a field | 1 | 0.35 | 2017 |
| Bilateral Proofs of Safety and Progress Properties of Concurrent Programs. | 0 | 0.34 | 2017 |
| Mapping among the nodes of infinite trees: A variation of Kőnig's infinity lemma. | 0 | 0.34 | 2015 |
| A Denotational Semantic Theory of Concurrent Systems. | 0 | 0.34 | 2015 |
| A personal perspective on concurrency | 0 | 0.34 | 2014 |
| A secure voting scheme based on rational self-interest | 0 | 0.34 | 2012 |
| Virtual Time and Timeout in Client-Server Networks - (Extended Abstract). | 0 | 0.34 | 2011 |
| Maintaining the Ranch topology | 2 | 0.40 | 2010 |
| Preface to special issue on software verification | 2 | 0.40 | 2009 |
| The verified software initiative: A manifesto | 35 | 1.64 | 2009 |
| The Orc Programming Language | 46 | 1.36 | 2009 |
| Simulation, Orchestration and Logical Clocks | 0 | 0.34 | 2008 |
| A timed semantics of Orc | 28 | 1.20 | 2008 |
| Simulation Using Orchestration | 2 | 0.37 | 2008 |
| Computation Orchestration | 18 | 0.75 | 2007 |
| FM 2006: Formal Methods, 14th International Symposium on Formal Methods, Hamilton, Canada, August 21-27, 2006, Proceedings | 44 | 6.35 | 2006 |
| Concurrent Maintenance of Rings | 8 | 0.69 | 2006 |
| Workflow patterns in orc | 40 | 2.01 | 2006 |
| A language for task orchestration and its semantic properties | 52 | 2.11 | 2006 |
| Verified Software: Theories, Tools, Experiments Vision of a Grand Challenge Project | 26 | 1.14 | 2005 |
| A Programming Model for the Orchestration of Web Services | 21 | 1.29 | 2004 |
| Brief announcement: concurrent maintenance of rings | 7 | 0.54 | 2004 |
| Derivation of a parallel string matching algorithm | 6 | 0.46 | 2003 |
| Computing with Distributed Resources | 0 | 0.34 | 2003 |
| The Case against a Grand Unification Theory | 0 | 0.34 | 2002 |
| A Simple, Object-Based View of Multiprogramming | 4 | 0.48 | 2002 |
| In memoriam: Edsger W. Dijkstra 1930--2002 | 12 | 0.77 | 2002 |
| A Theory of Hints in Model Checking | 1 | 0.38 | 2002 |
| Designing a Calculational Proof of Cantor's Theorem. | 0 | 0.34 | 2001 |
| A walk over the shortest path: Dijkstra's algorithm viewed as fixed-point computation | 5 | 0.61 | 2001 |
| A Programming Model for Wide-Area Computing | 0 | 0.34 | 2001 |
| Maximally Concurrent Programs | 2 | 0.45 | 2000 |
| Toward a theory of maximally concurrent programs (shortened version) | 4 | 0.48 | 2000 |
| An Object Model for Multiprogramming | 2 | 0.38 | 1998 |
| Seuss: What the Doctor Ordered | 0 | 0.34 | 1997 |
| Strategic directions in concurrency research | 21 | 3.04 | 1996 |
| Proof of a Real-Time Mutual-Exclusion Algorithm | 1 | 1.03 | 1996 |
| A discipline of multiprogramming | 23 | 0.97 | 1996 |
| Powerlist: a structure for parallel recursion | 60 | 9.72 | 1994 |
| A Discipline of Multiprogramming | 10 | 0.62 | 1994 |
| Corrigenda: Phase Synchronization | 0 | 0.34 | 1992 |
| Phase synchronization | 21 | 2.36 | 1991 |
| Loosely-coupled processes. | 8 | 0.74 | 1991 |
| A Perspective on Parallel Program Design | 0 | 0.34 | 1991 |
| Specifying concurrent objects as communicating processes | 7 | 0.74 | 1990 |
| Equational reasoning about nondeterministic processes | 12 | 1.46 | 1990 |
| A simple proof of a simple concensus algorithm | 2 | 0.37 | 1989 |
| Specifications of Concurrently Accessed Data | 3 | 1.13 | 1989 |
| Another view on “fairness” | 0 | 0.34 | 1988 |
| A Message-Based Approach to Discrete-Event Simulation | 31 | 13.47 | 1987 |
