| Publication | Date of Publication | Type |
|---|
| An homage to the beautiful mathematical EWDs | 2024-10-28 | Paper |
| scientific article; zbMATH DE number 7642012 (Why is no real title available?) | 2023-01-13 | Paper |
Finding Effective Abstractions
Theories of Programming | 2022-02-14 | Paper |
The Verified Software Initiative: A Manifesto
Theories of Programming | 2022-02-14 | Paper |
CV
Theories of Programming | 2022-02-14 | Paper |
The verified software initiative
ACM Computing Surveys | 2019-08-09 | Paper |
A denotational semantic theory of concurrent systems
Lecture Notes in Computer Science | 2015-09-14 | Paper |
Mapping among the nodes of infinite trees: a variation of Kőnig's infinity lemma
Information Processing Letters | 2015-04-02 | Paper |
Toward a theory of maximally concurrent programs (shortened version)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing | 2015-03-03 | Paper |
Concurrent maintenance of rings
Distributed Computing | 2013-06-20 | Paper |
A secure voting scheme based on rational self-interest
Formal Aspects of Computing | 2013-03-22 | Paper |
Maintaining the Ranch topology
Journal of Parallel and Distributed Computing | 2012-03-07 | Paper |
Quicksort: Combining Concurrency, Recursion, and Mutable Data Structures
Reflections on the Work of C.A.R. Hoare | 2010-10-26 | Paper |
A theory of hints in model checking.
Lecture Notes in Computer Science | 2010-03-30 | Paper |
The Orc Programming Language
Formal Techniques for Distributed Systems | 2009-06-26 | Paper |
Derivation of a parallel string matching algorithm
Information Processing Letters | 2009-03-23 | Paper |
Simulation Using Orchestration
Algebraic Methodology and Software Technology | 2009-01-27 | Paper |
A timed semantics of Orc
Theoretical Computer Science | 2008-08-06 | Paper |
A Language for Task Orchestration and Its Semantic Properties
CONCUR 2006 – Concurrency Theory | 2007-09-04 | Paper |
Active and Concurrent Topology Maintenance
Lecture Notes in Computer Science | 2005-08-17 | Paper |
| scientific article; zbMATH DE number 2090559 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2087601 (Why is no real title available?) | 2004-08-11 | Paper |
A walk over the shortest path: Dijkstra's algorithm viewed as fixed-point computation.
Information Processing Letters | 2002-07-25 | Paper |
A simple, object-based view of multiprogramming
Formal Methods in System Design | 2002-04-11 | Paper |
| scientific article; zbMATH DE number 1693543 (Why is no real title available?) | 2002-01-22 | Paper |
Designing a Calculational Proof of Cantor's Theorem
American Mathematical Monthly | 2002-01-13 | Paper |
| scientific article; zbMATH DE number 1639446 (Why is no real title available?) | 2001-08-30 | Paper |
Maximally concurrent programs
Formal Aspects of Computing | 2001-05-07 | Paper |
| scientific article; zbMATH DE number 1569127 (Why is no real title available?) | 2001-02-22 | Paper |
| scientific article; zbMATH DE number 1390332 (Why is no real title available?) | 2000-08-29 | Paper |
| scientific article; zbMATH DE number 194539 (Why is no real title available?) | 1993-06-05 | Paper |
A constructive proof of Vizing's theorem
Information Processing Letters | 1992-06-28 | Paper |
Phase synchronization
Information Processing Letters | 1992-06-26 | Paper |
Equational reasoning about nondeterministic processes
Formal Aspects of Computing | 1990-01-01 | Paper |
Specifying concurrent objects as communicating processes
Science of Computer Programming | 1990-01-01 | Paper |
A simple proof of a simple consensus algorithm
Information Processing Letters | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4047042 (Why is no real title available?) | 1987-01-01 | Paper |
Systolic algorithms as programs
Distributed Computing | 1986-01-01 | Paper |
How processes learn
Distributed Computing | 1986-01-01 | Paper |
An example of stepwise refinement of distributed programs: quiescence detection
ACM Transactions on Programming Languages and Systems | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3926228 (Why is no real title available?) | 1985-01-01 | Paper |
Finding repeated elements
Science of Computer Programming | 1982-01-01 | Paper |
Distributed computation on graphs
Communications of the ACM | 1982-01-01 | Paper |
Termination Detection of Diffusing Computations in Communicating Sequential Processes
ACM Transactions on Programming Languages and Systems | 1982-01-01 | Paper |
A Distributed Graph Algorithm: Knot Detection
ACM Transactions on Programming Languages and Systems | 1982-01-01 | Paper |
Proofs of Networks of Processes
IEEE Transactions on Software Engineering | 1981-01-01 | Paper |
An Exercise in Program Explanation
ACM Transactions on Programming Languages and Systems | 1981-01-01 | Paper |
Deadlock absence proofs for networks of communicating processes
Information Processing Letters | 1979-01-01 | Paper |
Distributed Simulation: A Case Study in Design and Verification of Distributed Programs
IEEE Transactions on Software Engineering | 1979-01-01 | Paper |
Distributed simulation of networks
Computer Networks (1976) | 1979-01-01 | Paper |
Space-time trade off in implementing certain set operations
Information Processing Letters | 1979-01-01 | Paper |
A linear sieve algorithm for finding prime numbers
Communications of the ACM | 1978-01-01 | Paper |
Some Aspects of the Verification of Loop Computations
IEEE Transactions on Software Engineering | 1978-01-01 | Paper |
An Approach to Formal Definitions and Proofs of Programming Principles
IEEE Transactions on Software Engineering | 1978-01-01 | Paper |
A Technique of Algorithm Construction on Sequences
IEEE Transactions on Software Engineering | 1978-01-01 | Paper |
A Linear Tree Partitioning Algorithm
SIAM Journal on Computing | 1977-01-01 | Paper |
Prospects and Limitations of Automatic Assertion Generation for Loop Programs
SIAM Journal on Computing | 1977-01-01 | Paper |
Optimal chain partitions of trees
Information Processing Letters | 1975-01-01 | Paper |
