| Publication | Date of Publication | Type |
|---|
| Development of correct programs | 2024-10-28 | Paper |
| Reflections on Edsger and his influence | 2024-10-28 | Paper |
| Equational logic as a tool | 2022-08-16 | Paper |
| K-M-P string matching revisited | 2016-06-09 | Paper |
| Formal justification of underspecification for S5 | 2016-05-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4671932 | 2005-04-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4364527 | 1999-09-20 | Paper |
| Adding the everywhere operator to propositional logic | 1999-02-04 | Paper |
| Teaching Math More Effectively, Through Calculational Proofs | 1997-11-09 | Paper |
| Equational propositional logic | 1997-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4885874 | 1996-10-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4846258 | 1995-08-23 | Paper |
| A constructive proof of Vizing's theorem | 1992-06-28 | Paper |
| An optimal parallel algorithm for generating combinations | 1989-01-01 | Paper |
| An algorithm for transitive reduction of an acyclic graph | 1989-01-01 | Paper |
| Generating a random cyclic permutation | 1988-01-01 | Paper |
| Developing a linear algorithm for cubing a cyclic permutation | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4721623 | 1987-01-01 | Paper |
| Horner's rule and the computation of linear recurrences | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3783501 | 1987-01-01 | Paper |
| General correctness: A unification of partial and total correctness | 1985-01-01 | Paper |
| Fault-tolerant broadcasts | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3719783 | 1984-01-01 | Paper |
| Finding repeated elements | 1982-01-01 | Paper |
| A note on a standard strategy for developing loop invariants and loops | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3217578 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3925859 | 1981-01-01 | Paper |
| A proof technique for communicating sequential processes | 1981-01-01 | Paper |
| Computing Fibonacci numbers (and similarly defined functions) in log time | 1980-01-01 | Paper |
| Assignment and Procedure Call Proof Rules | 1980-01-01 | Paper |
| Controlled density sorting | 1980-01-01 | Paper |
| The Schorr-Waite graph marking algorithm | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3907041 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4184273 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4184282 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4185780 | 1979-01-01 | Paper |
| Is Sometimes Ever Better Than Always? | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3657400 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3049806 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3854594 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3935444 | 1979-01-01 | Paper |
| A linear sieve algorithm for finding prime numbers | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4178461 | 1978-01-01 | Paper |
| The Multiple Assignment Statement | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4168052 | 1978-01-01 | Paper |
| Some ideas on data types in high-level languages | 1977-01-01 | Paper |
| An exercise in proving parallel programs correct | 1977-01-01 | Paper |
| Correction to "An Illustration of Current Ideas on the Derivation of Correctness Proofs and Correct Programs" | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4195920 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3870274 | 1977-01-01 | Paper |
| Verifying properties of parallel programs | 1976-01-01 | Paper |
| An axiomatic proof technique for parallel programs | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4134900 | 1976-01-01 | Paper |
| An Illustration of Current Ideas on the Derivation of Correctness Proofs and Correct Programs | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4102708 | 1976-01-01 | Paper |
| Describing an algorithm by Hopcroft | 1973-01-01 | Paper |
| Programming by induction | 1972-01-01 | Paper |
| On Classes of Program Schemata | 1972-01-01 | Paper |
| Program Schemes with Pushdown Stores | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4057550 | 1971-01-01 | Paper |
| Translator writing systems | 1968-01-01 | Paper |
| Use of transition matrices in compiling | 1968-01-01 | Paper |
| Characterizations of certain classes of norms | 1967-01-01 | Paper |
