| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q5869926 | 2023-01-13 | Paper |
| Finding Effective Abstractions | 2022-02-14 | Paper |
| The Verified Software Initiative: A Manifesto | 2022-02-14 | Paper |
| CV | 2022-02-14 | Paper |
| The verified software initiative | 2019-08-09 | Paper |
| A Denotational Semantic Theory of Concurrent Systems | 2015-09-14 | Paper |
| Mapping among the nodes of infinite trees: a variation of Kőnig's infinity lemma | 2015-04-02 | Paper |
| Toward a theory of maximally concurrent programs (shortened version) | 2015-03-03 | Paper |
| Concurrent maintenance of rings | 2013-06-20 | Paper |
| A secure voting scheme based on rational self-interest | 2013-03-22 | Paper |
| Maintaining the Ranch topology | 2012-03-07 | Paper |
| Quicksort: Combining Concurrency, Recursion, and Mutable Data Structures | 2010-10-26 | Paper |
| Formal Methods at the Crossroads. From Panacea to Foundational Support | 2010-03-30 | Paper |
| The Orc Programming Language | 2009-06-26 | Paper |
| Derivation of a parallel string matching algorithm | 2009-03-23 | Paper |
| Simulation Using Orchestration | 2009-01-27 | Paper |
| A timed semantics of Orc | 2008-08-06 | Paper |
| A Language for Task Orchestration and Its Semantic Properties | 2007-09-04 | Paper |
| Active and Concurrent Topology Maintenance | 2005-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4812995 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4738439 | 2004-08-11 | Paper |
| A walk over the shortest path: Dijkstra's algorithm viewed as fixed-point computation. | 2002-07-25 | Paper |
| A simple, object-based view of multiprogramming | 2002-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2764143 | 2002-01-22 | Paper |
| Designing a Calculational Proof of Cantor's Theorem | 2002-01-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2738289 | 2001-08-30 | Paper |
| Maximally concurrent programs | 2001-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4762655 | 2001-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4934621 | 2000-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4692502 | 1993-06-05 | Paper |
| A constructive proof of Vizing's theorem | 1992-06-28 | Paper |
| Phase synchronization | 1992-06-26 | Paper |
| Equational reasoning about nondeterministic processes | 1990-01-01 | Paper |
| Specifying concurrent objects as communicating processes | 1990-01-01 | Paper |
| A simple proof of a simple consensus algorithm | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3783500 | 1987-01-01 | Paper |
| How processes learn | 1986-01-01 | Paper |
| Systolic algorithms as programs | 1986-01-01 | Paper |
| An example of stepwise refinement of distributed programs: quiescence detection | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3700821 | 1985-01-01 | Paper |
| Finding repeated elements | 1982-01-01 | Paper |
| Termination Detection of Diffusing Computations in Communicating Sequential Processes | 1982-01-01 | Paper |
| A Distributed Graph Algorithm: Knot Detection | 1982-01-01 | Paper |
| Distributed computation on graphs | 1982-01-01 | Paper |
| An Exercise in Program Explanation | 1981-01-01 | Paper |
| Proofs of Networks of Processes | 1981-01-01 | Paper |
| Deadlock absence proofs for networks of communicating processes | 1979-01-01 | Paper |
| Space-time trade off in implementing certain set operations | 1979-01-01 | Paper |
| Distributed Simulation: A Case Study in Design and Verification of Distributed Programs | 1979-01-01 | Paper |
| Distributed simulation of networks | 1979-01-01 | Paper |
| A Technique of Algorithm Construction on Sequences | 1978-01-01 | Paper |
| An Approach to Formal Definitions and Proofs of Programming Principles | 1978-01-01 | Paper |
| A linear sieve algorithm for finding prime numbers | 1978-01-01 | Paper |
| Some Aspects of the Verification of Loop Computations | 1978-01-01 | Paper |
| A Linear Tree Partitioning Algorithm | 1977-01-01 | Paper |
| Prospects and Limitations of Automatic Assertion Generation for Loop Programs | 1977-01-01 | Paper |
| Optimal chain partitions of trees | 1975-01-01 | Paper |
