| Publication | Date of Publication | Type |
|---|
UNITY and Büchi automata
Formal Aspects of Computing | 2021-05-19 | Paper |
| Progress under bounded fairness | 2020-12-03 | Paper |
An algorithm for the asynchronous \textit{Write-All} problem based on process collision
Distributed Computing | 2020-12-03 | Paper |
Wait-free concurrent memory management by create and read until deletion (CaRuD)
Distributed Computing | 2020-12-03 | Paper |
Wait-free linearization with an assertional proof
Distributed Computing | 2020-11-30 | Paper |
Wait-free linearization with a mechanical proof
Distributed Computing | 2020-11-30 | Paper |
Conditionally complete sponges: new results on generalized lattices
Indagationes Mathematicae. New Series | 2019-07-17 | Paper |
The nullcone of the Lie algebra of \(G_2\)
Indagationes Mathematicae. New Series | 2019-06-18 | Paper |
The quartet spaces of G. 't Hooft
Indagationes Mathematicae. New Series | 2018-03-16 | Paper |
Tournaments for mutual exclusion: verification and concurrent complexity
Formal Aspects of Computing | 2017-11-29 | Paper |
Eternity variables to prove simulation of specifications
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Correctness and concurrent complexity of the black-white bakery algorithm
Formal Aspects of Computing | 2016-08-04 | Paper |
Formalizing a hierarchical file system
Electronic Notes in Theoretical Computer Science | 2016-08-01 | Paper |
Invariants for the construction of a handshake register
Information Processing Letters | 2016-06-09 | Paper |
Starvation-free mutual exclusion with semaphores
Formal Aspects of Computing | 2014-11-10 | Paper |
Simulation Refinement for Concurrency Verification
Electronic Notes in Theoretical Computer Science | 2014-03-26 | Paper |
A distributed resource allocation algorithm for many processes
Acta Informatica | 2013-11-11 | Paper |
Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos
Acta Informatica | 2013-06-28 | Paper |
Lock-free dynamic hash tables with open addressing
Distributed Computing | 2013-06-07 | Paper |
Graph theory for alternating hydrocarbons with attached ports
Indagationes Mathematicae. New Series | 2013-01-03 | Paper |
Finite and infinite implementation of transition systems
Theoretical Computer Science | 2012-11-08 | Paper |
Formalizing a hierarchical file system
Formal Aspects of Computing | 2012-07-03 | Paper |
Nonatomic dual bakery algorithm with bounded tokens
Acta Informatica | 2012-03-23 | Paper |
Simulation refinement for concurrency verification
Science of Computer Programming | 2011-06-06 | Paper |
Queue based mutual exclusion with linearly bounded overtaking
Science of Computer Programming | 2011-05-04 | Paper |
Solutions of equations in languages
Formal Aspects of Computing | 2010-11-22 | Paper |
Simple concurrent garbage collection almost without synchronization
Formal Methods in System Design | 2010-09-16 | Paper |
Alternating states for dual nondeterminism in imperative programming
Theoretical Computer Science | 2010-05-27 | Paper |
A linear-time algorithm for Euclidean feature transform sets
Information Processing Letters | 2010-01-29 | Paper |
Salembier's min-tree algorithm turned into breadth first search
Information Processing Letters | 2009-07-09 | Paper |
A queue based mutual exclusion algorithm
Acta Informatica | 2009-03-26 | Paper |
A challenge for atomicity verification
Science of Computer Programming | 2008-04-16 | Paper |
Universal extensions to simulate specifications
Information and Computation | 2008-03-11 | Paper |
A criterion for atomicity revisited
Acta Informatica | 2007-06-07 | Paper |
A general lock-free algorithm using compare-and-swap
Information and Computation | 2007-02-20 | Paper |
Lock-free parallel and concurrent garbage collection by mark\&sweep
Science of Computer Programming | 2007-01-11 | Paper |
Refinement verification of the lazy caching algorithm
Acta Informatica | 2006-10-18 | Paper |
Splitting forward simulations to cope with liveness
Acta Informatica | 2006-05-26 | Paper |
Computer Aided Verification
Lecture Notes in Computer Science | 2005-08-25 | Paper |
| scientific article; zbMATH DE number 2182499 (Why is no real title available?) | 2005-06-23 | Paper |
An assertional proof for a construction of an atomic variable
Formal Aspects of Computing | 2005-02-24 | Paper |
Using eternity variables to specify and prove a serializable database interface
Science of Computer Programming | 2004-10-04 | Paper |
| scientific article; zbMATH DE number 2090023 (Why is no real title available?) | 2004-08-12 | Paper |
Preference rankings in the face of uncertainty
Acta Informatica | 2004-03-11 | Paper |
An assertional criterion for atomicity
Acta Informatica | 2002-08-14 | Paper |
Concurrent determination of connected components
Science of Computer Programming | 2002-07-22 | Paper |
| A general algorithm for computing distance transforms in linear time | 2002-03-21 | Paper |
A generalization of Naundorf's fixpoint theorem
Theoretical Computer Science | 2000-10-26 | Paper |
Predicate transformers for recursive procedures with local variables
Formal Aspects of Computing | 2000-08-27 | Paper |
Fixpoint semantics and simulation
Theoretical Computer Science | 2000-08-21 | Paper |
The verified incremental design of a distributed spanning tree algorithm: Extended abstract
Formal Aspects of Computing | 2000-01-02 | Paper |
Theories for mechanical proofs of imperative programs
Formal Aspects of Computing | 1998-10-06 | Paper |
A mechanical proof of Segall's PIF algorithm
Formal Aspects of Computing | 1997-11-10 | Paper |
Safety and progress of recursive procedures
Formal Aspects of Computing | 1996-02-01 | Paper |
Bounded delay for a free address
Acta Informatica | 1995-11-19 | Paper |
Proof rules for recursive procedures
Formal Aspects of Computing | 1994-06-29 | Paper |
Nondeterminacy and recursion via stacks and games
Theoretical Computer Science | 1994-04-05 | Paper |
| Programs, Recursion and Unbounded Choice | 1993-01-23 | Paper |
LR-parsing derived
Science of Computer Programming | 1992-12-16 | Paper |
Processes and formalisms for unbounded choice
Theoretical Computer Science | 1992-09-27 | Paper |
Smoothsort revisited
Information Processing Letters | 1992-06-28 | Paper |
Repetitions, known or unknown?
Information Processing Letters | 1992-06-28 | Paper |
A mathematical approach to nondeterminism in data types
ACM Transactions on Programming Languages and Systems | 1992-06-25 | Paper |
A mathematical approach to nondeterminism in data types
ACM Transactions on Programming Languages and Systems | 1992-06-25 | Paper |
Command algebras, recursion and program transformation
Formal Aspects of Computing | 1990-01-01 | Paper |
Axioms and models of linear logic
Formal Aspects of Computing | 1990-01-01 | Paper |
Predicate-transformer semantics of general recursion
Acta Informatica | 1989-01-01 | Paper |
Interpretations of recursion under unbounded nondeterminacy
Theoretical Computer Science | 1988-01-01 | Paper |
Deadlock and fairness in morphisms of transition systems
Theoretical Computer Science | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 3989601 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3989601 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3968806 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3927121 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3927121 (Why is no real title available?) | 1985-01-01 | Paper |
Schemes of linear configurations in projective plane.
Journal für die reine und angewandte Mathematik (Crelles Journal) | 1984-01-01 | Paper |
Schemes of linear configurations in projective plane.
Journal für die reine und angewandte Mathematik (Crelles Journal) | 1984-01-01 | Paper |
Special and pure gradings of Lie algebras
Mathematische Zeitschrift | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3732221 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3758496 (Why is no real title available?) | 1981-01-01 | Paper |
Characters of the nullcone
Mathematische Annalen | 1980-01-01 | Paper |
Desingularizations of varieties of nullforms
Inventiones Mathematicae | 1979-01-01 | Paper |
Nilpotency in classical groups over a field of characteristic 2
Mathematische Zeitschrift | 1979-01-01 | Paper |
The normality of closures of orbits in a Lie algebra
Commentarii Mathematici Helvetici | 1979-01-01 | Paper |
Uniform instability in reductive groups.
Journal für die reine und angewandte Mathematik (Crelles Journal) | 1978-01-01 | Paper |
Uniform instability in reductive groups.
Journal für die reine und angewandte Mathematik (Crelles Journal) | 1978-01-01 | Paper |
Polarizations in the classical groups
Mathematische Zeitschrift | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3587248 (Why is no real title available?) | 1977-01-01 | Paper |
Depth and Normal Flatness, two Examples
Mathematische Nachrichten | 1977-01-01 | Paper |
| Singularities in the Nilpotent Scheme of a Classical Group | 1976-01-01 | Paper |
Cohomology and the resolution of the nilpotent variety
Mathematische Annalen | 1976-01-01 | Paper |
