The following pages link to Wim H. Hesselink (Q216155):
Displayed 50 items.
- Invariants for the construction of a handshake register (Q293438) (← links)
- A distributed resource allocation algorithm for many processes (Q378202) (← links)
- Formalizing a hierarchical file system (Q432156) (← links)
- Starvation-free mutual exclusion with semaphores (Q469360) (← links)
- Queue based mutual exclusion with linearly bounded overtaking (Q532419) (← links)
- Simulation refinement for concurrency verification (Q541209) (← links)
- Solutions of equations in languages (Q607397) (← links)
- Correctness and concurrent complexity of the black-white bakery algorithm (Q736464) (← links)
- Nonatomic dual bakery algorithm with bounded tokens (Q766163) (← links)
- A linear-time algorithm for Euclidean feature transform sets (Q846000) (← links)
- Lock-free parallel and concurrent garbage collection by mark\&sweep (Q858913) (← links)
- A general lock-free algorithm using compare-and-swap (Q865625) (← links)
- A criterion for atomicity revisited (Q884994) (← links)
- Command algebras, recursion and program transformation (Q911748) (← links)
- Axioms and models of linear logic (Q915719) (← links)
- Alternating states for dual nondeterminism in imperative programming (Q974118) (← links)
- A queue based mutual exclusion algorithm (Q1006897) (← links)
- Salembier's min-tree algorithm turned into breadth first search (Q1029019) (← links)
- Predicate-transformer semantics of general recursion (Q1101439) (← links)
- Deadlock and fairness in morphisms of transition systems (Q1105379) (← links)
- Interpretations of recursion under unbounded nondeterminacy (Q1115173) (← links)
- The verified incremental design of a distributed spanning tree algorithm: Extended abstract (Q1125687) (← links)
- Characters of the nullcone (Q1146241) (← links)
- Special and pure gradings of Lie algebras (Q1150029) (← links)
- Smoothsort revisited (Q1183408) (← links)
- Repetitions, known or unknown? (Q1183432) (← links)
- Processes and formalisms for unbounded choice (Q1193892) (← links)
- LR-parsing derived (Q1196299) (← links)
- Cohomology and the resolution of the nilpotent variety (Q1222211) (← links)
- Polarizations in the classical groups (Q1240803) (← links)
- Nilpotency in classical groups over a field of characteristic 2 (Q1250291) (← links)
- The normality of closures of orbits in a Lie algebra (Q1252911) (← links)
- Desingularizations of varieties of nullforms (Q1255063) (← links)
- Theories for mechanical proofs of imperative programs (Q1267030) (← links)
- Nondeterminacy and recursion via stacks and games (Q1318704) (← links)
- Proof rules for recursive procedures (Q1329196) (← links)
- A mechanical proof of Segall's PIF algorithm (Q1362774) (← links)
- Preference rankings in the face of uncertainty (Q1424347) (← links)
- Item:Q216155 (redirect page) (← links)
- Fixpoint semantics and simulation (Q1575253) (← links)
- Predicate transformers for recursive procedures with local variables (Q1578396) (← links)
- A generalization of Naundorf's fixpoint theorem (Q1583261) (← links)
- An assertional criterion for atomicity (Q1608943) (← links)
- Tournaments for mutual exclusion: verification and concurrent complexity (Q1682286) (← links)
- The quartet spaces of G. 't Hooft (Q1705754) (← links)
- Finite and infinite implementation of transition systems (Q1758157) (← links)
- An assertional proof for a construction of an atomic variable (Q1764428) (← links)
- Using eternity variables to specify and prove a serializable database interface (Q1881266) (← links)
- Bounded delay for a free address (Q1901690) (← links)
- Safety and progress of recursive procedures (Q1903075) (← links)