W. H. Hesselink

From MaRDI portal
Person:216155

Available identifiers

zbMath Open hesselink.wim-hMaRDI QIDQ216155

List of research outcomes





PublicationDate of PublicationType
UNITY and Büchi automata2021-05-19Paper
An algorithm for the asynchronous Write-All problem based on process collision2020-12-03Paper
https://portal.mardi4nfdi.de/entity/Q51378892020-12-03Paper
Wait-free concurrent memory management by Create and Read until Deletion (CaRuD)2020-12-03Paper
Wait-free linearization with an assertional proof2020-11-30Paper
Wait-free linearization with a mechanical proof2020-11-30Paper
Conditionally complete sponges: new results on generalized lattices2019-07-17Paper
The nullcone of the Lie algebra of \(G_2\)2019-06-18Paper
The quartet spaces of G. 't Hooft2018-03-16Paper
Tournaments for mutual exclusion: verification and concurrent complexity2017-11-29Paper
Eternity variables to prove simulation of specifications2017-07-12Paper
Correctness and concurrent complexity of the black-white bakery algorithm2016-08-04Paper
Formalizing a Hierarchical File System2016-08-01Paper
Invariants for the construction of a handshake register2016-06-09Paper
Starvation-free mutual exclusion with semaphores2014-11-10Paper
Simulation Refinement for Concurrency Verification2014-03-26Paper
A distributed resource allocation algorithm for many processes2013-11-11Paper
Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos2013-06-28Paper
Lock-free dynamic hash tables with open addressing2013-06-07Paper
Graph theory for alternating hydrocarbons with attached ports2013-01-03Paper
Finite and infinite implementation of transition systems2012-11-08Paper
Formalizing a hierarchical file system2012-07-03Paper
Nonatomic dual bakery algorithm with bounded tokens2012-03-23Paper
Simulation refinement for concurrency verification2011-06-06Paper
Queue based mutual exclusion with linearly bounded overtaking2011-05-04Paper
Solutions of equations in languages2010-11-22Paper
Simple concurrent garbage collection almost without synchronization2010-09-16Paper
Alternating states for dual nondeterminism in imperative programming2010-05-27Paper
A linear-time algorithm for Euclidean feature transform sets2010-01-29Paper
Salembier's min-tree algorithm turned into breadth first search2009-07-09Paper
A queue based mutual exclusion algorithm2009-03-26Paper
A challenge for atomicity verification2008-04-16Paper
Universal extensions to simulate specifications2008-03-11Paper
A criterion for atomicity revisited2007-06-07Paper
A general lock-free algorithm using compare-and-swap2007-02-20Paper
Lock-free parallel and concurrent garbage collection by mark\&sweep2007-01-11Paper
Refinement verification of the lazy caching algorithm2006-10-18Paper
Splitting forward simulations to cope with liveness2006-05-26Paper
Computer Aided Verification2005-08-25Paper
https://portal.mardi4nfdi.de/entity/Q46813762005-06-23Paper
An assertional proof for a construction of an atomic variable2005-02-24Paper
Using eternity variables to specify and prove a serializable database interface2004-10-04Paper
https://portal.mardi4nfdi.de/entity/Q48086902004-08-12Paper
Preference rankings in the face of uncertainty2004-03-11Paper
An assertional criterion for atomicity2002-08-14Paper
Concurrent determination of connected components2002-07-22Paper
A general algorithm for computing distance transforms in linear time2002-03-21Paper
A generalization of Naundorf's fixpoint theorem2000-10-26Paper
Predicate transformers for recursive procedures with local variables2000-08-27Paper
Fixpoint semantics and simulation2000-08-21Paper
The verified incremental design of a distributed spanning tree algorithm: Extended abstract2000-01-02Paper
Theories for mechanical proofs of imperative programs1998-10-06Paper
A mechanical proof of Segall's PIF algorithm1997-11-10Paper
Safety and progress of recursive procedures1996-02-01Paper
Bounded delay for a free address1995-11-19Paper
Proof rules for recursive procedures1994-06-29Paper
Nondeterminacy and recursion via stacks and games1994-04-05Paper
Programs, Recursion and Unbounded Choice1993-01-23Paper
LR-parsing derived1992-12-16Paper
Processes and formalisms for unbounded choice1992-09-27Paper
Smoothsort revisited1992-06-28Paper
Repetitions, known or unknown?1992-06-28Paper
A mathematical approach to nondeterminism in data types1992-06-25Paper
Command algebras, recursion and program transformation1990-01-01Paper
Axioms and models of linear logic1990-01-01Paper
Predicate-transformer semantics of general recursion1989-01-01Paper
Interpretations of recursion under unbounded nondeterminacy1988-01-01Paper
Deadlock and fairness in morphisms of transition systems1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37525491987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37358811986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37015681985-01-01Paper
Schemes of linear configurations in projective plane.1984-01-01Paper
Special and pure gradings of Lie algebras1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39198191981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39415321981-01-01Paper
Characters of the nullcone1980-01-01Paper
Desingularizations of varieties of nullforms1979-01-01Paper
Nilpotency in classical groups over a field of characteristic 21979-01-01Paper
The normality of closures of orbits in a Lie algebra1979-01-01Paper
Uniform instability in reductive groups.1978-01-01Paper
Polarizations in the classical groups1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41569271977-01-01Paper
Depth and Normal Flatness, two Examples1977-01-01Paper
Cohomology and the resolution of the nilpotent variety1976-01-01Paper
Singularities in the Nilpotent Scheme of a Classical Group1976-01-01Paper

Research outcomes over time

This page was built for person: W. H. Hesselink