Interpretations of Recursion under Unbounded Nondeterminacy. - Wim H. Hesselink (Theor. Comput. Sci., 1988)

Deadlock and Fairness in Morphisms of Transition Systems. - Wim H. Hesselink (Theor. Comput. Sci., 1988)

A Mathematical Approach to Nondeterminism in Data Types. - Wim H. Hesselink (ACM Trans. Program. Lang. Syst., 1988)

Initialisation with a Final Value, an Exercise in Program Transformation. - Wim H. Hesselink (MPC, 1989)

Predicate-Transformer Semantics of General Recursion. - Wim H. Hesselink (Acta Informatica, 1989)

Command Algebras, Recursion and Program Transformation. - Wim H. Hesselink (Formal Aspects Comput., 1990)

Axioms and Models of Linear Logic. - Wim H. Hesselink (Formal Aspects Comput., 1990)

Smoothsort Revisited. - Coenraad Bron; Wim H. Hesselink (Inf. Process. Lett., 1991)

Repetitions, Known or Unknown? - Wim H. Hesselink (Inf. Process. Lett., 1991)

Temporal Preconditions of Recursive Procedures. - Wim H. Hesselink; Ronald Reinds (REX Workshop, 1992)

LR-Parsing Derived. - Wim H. Hesselink (Sci. Comput. Program., 1992)

Processes and Formalism for Unbounded Choice. - Wim H. Hesselink (Theor. Comput. Sci., 1992)

Proof Rules for Recursive Procedures. - Wim H. Hesselink (Formal Aspects Comput., 1993)

Compact Image Representation using Gabor Wavelets. - Wim H. Hesselink (EUROSIM, 1994)

Wait-Free Linearization with an Assertional Proof. - Wim H. Hesselink (Distributed Comput., 1994)

Nondeterminacy and Recursion via Stacks and Games. - Wim H. Hesselink (Theor. Comput. Sci., 1994)

Angelic Termination in Dijkstra's Calculus. - Wim H. Hesselink (MPC, 1995)

Wait-Free Linearization with a Mechanical Proof. - Wim H. Hesselink (Distributed Comput., 1995)

Safety and Progress of Recursive Procedures. - Wim H. Hesselink (Formal Aspects Comput., 1995)

Bounded Delay for a Free Address. - Wim H. Hesselink (Acta Informatica, 1996)

A Mechanical Proof of Segall's PIF Algorithm. - Wim H. Hesselink (Formal Aspects Comput., 1997)

Theories for Mechanical Proofs of Imperative Programs. - Wim H. Hesselink (Formal Aspects Comput., 1997)

The design of a linearization of a concurrent data object. - Wim H. Hesselink (PROCOMET, 1998)

Invariants for the Construction of a Handshake Register. - Wim H. Hesselink (Inf. Process. Lett., 1998)

Progress Under Bounded Fairness. - Wim H. Hesselink (Distributed Comput., 1999)

The Verified Incremental Design of a Distributed Spanning Tree Algorithm: Extended Abstract. - Wim H. Hesselink (Formal Aspects Comput., 1999)

Predicate Transformers for Recursive Procedures with Local Variables. - Wim H. Hesselink (Formal Aspects Comput., 1999)

A General Algorithm for Computing Distance Transforms in Linear Time. - Arnold Meijster; Jos B. T. M. Roerdink; Wim H. Hesselink (ISMM, 2000)

A generalization of Naundorf's fixpoint theorem. - Wim H. Hesselink (Theor. Comput. Sci., 2000)

Fixpoint semantics and simulation. - Wim H. Hesselink; Albert Thijs (Theor. Comput. Sci., 2000)

An algorithm for the asynchronous Write-All problem based on process collision. - Jan Friso Groote; Wim H. Hesselink; Sjouke Mauw; Rogier Vermeulen (Distributed Comput., 2001)

Wait-free concurrent memory management by Create and Read until Deletion (CaRuD). - Wim H. Hesselink; Jan Friso Groote (Distributed Comput., 2001)

Concurrent determination of connected components. - Wim H. Hesselink; Arnold Meijster; Coenraad Bron (Sci. Comput. Program., 2001)

Eternity Variables to Simulate Specifications. - Wim H. Hesselink (MPC, 2002)

An assertional criterion for atomicity. - Wim H. Hesselink (Acta Informatica, 2002)

Preference rankings in the face of uncertainty. - Wim H. Hesselink (Acta Informatica, 2003)

Efficient almost wait-free parallel accessible dynamic hashtables - Hui Gao; Jan Friso Groote; Wim H. Hesselink (CoRR, 2003)

Salembier's Min-tree algorithm turned into breadth first search. - Wim H. Hesselink (Inf. Process. Lett., 2003)

A Formal Reduction for Lock-Free Parallel Algorithms. - Hui Gao; Wim H. Hesselink (CAV, 2004)

Almost Wait-Free Resizable Hashtable. - Hui Gao; Jan Friso Groote; Wim H. Hesselink (IPDPS, 2004)

An assertional proof for a construction of an atomic variable. - Wim H. Hesselink (Formal Aspects Comput., 2004)

Knowledge-Based Asynchronous Programming. - Hendrik Wietze de Haan; Wim H. Hesselink; Gerard R. Renardel de Lavalette (Fundam. Informaticae, 2004)

Using eternity variables to specify and prove a serializable database interface. - Wim H. Hesselink (Sci. Comput. Program., 2004)

Experiments with strategies for agents in the social interaction game Mafia. - Hendrik Wietze de Haan; Wim H. Hesselink; Gerben G. Meyer; Gerard R. Renardel de Lavalette (BNAIC, 2005)

Euclidean Skeletons of 3D Data Sets in Linear Time by the Integer Medial Axis Transform. - Wim H. Hesselink; Menno Visser; Jos B. T. M. Roerdink (ISMM, 2005)

Lock-Free Parallel Garbage Collection. - Hui Gao; Jan Friso Groote; Wim H. Hesselink (ISPA, 2005)

Lock-free dynamic hash tables with open addressing. - Hui Gao; Jan Friso Groote; Wim H. Hesselink (Distributed Comput., 2005)

Eternity variables to prove simulation of specifications. - Wim H. Hesselink (ACM Trans. Comput. Log., 2005)

Splitting forward simulations to copewith liveness. - Wim H. Hesselink (Acta Informatica, 2006)

Refinement verification of the lazy caching algorithm. - Wim H. Hesselink (Acta Informatica, 2006)

A criterion for atomicity revisited. - Wim H. Hesselink (Acta Informatica, 2007)

Kekulé Cells for Molecular Computation - Wim H. Hesselink; J. C. Hummelen; H. T. Jonkman; H. G. Reker; Gerard R. Renardel de Lavalette; M. H. van der Veen (CoRR, 2007)

A general lock-free algorithm using compare-and-swap. - Hui Gao; Wim H. Hesselink (Inf. Comput., 2007)

A linear-time algorithm for Euclidean feature transform sets. - Wim H. Hesselink (Inf. Process. Lett., 2007)

Lock-free parallel and concurrent garbage collection by mark&sweep. - Hui Gao; Jan Friso Groote; Wim H. Hesselink (Sci. Comput. Program., 2007)

Universal extensions to simulate specifications. - Wim H. Hesselink (Inf. Comput., 2008)

Euclidean Skeletons of Digital Image and Volume Data in Linear Time by the Integer Medial Axis Transform. - Wim H. Hesselink; Jos B. T. M. Roerdink (IEEE Trans. Pattern Anal. Mach. Intell., 2008)

Concurrent Computation of Attribute Filters on Shared Memory Parallel Machines. - Michael H. F. Wilkinson; Hui Gao; Wim H. Hesselink; Jan-Eppo Jonker; Arnold Meijster (IEEE Trans. Pattern Anal. Mach. Intell., 2008)

A challenge for atomicity verification. - Wim H. Hesselink (Sci. Comput. Program., 2008)

Verification of a Lock-Free Implementation of Multiword LL/SC Object. - Hui Gao; Yan Fu; Wim H. Hesselink (DASC, 2009)

A queue based mutual exclusion algorithm. - Alex A. Aravind; Wim H. Hesselink (Acta Informatica, 2009)

Solutions of equations in languages. - Wim H. Hesselink (Formal Aspects Comput., 2010)

Simple concurrent garbage collection almost without synchronization. - Wim H. Hesselink; Muhammad Ikram Ullah Lali (Formal Methods Syst. Des., 2010)

Alternating states for dual nondeterminism in imperative programming. - Wim H. Hesselink (Theor. Comput. Sci., 2010)

Nonatomic dual bakery algorithm with bounded tokens. - Alex A. Aravind; Wim H. Hesselink (Acta Informatica, 2011)

Partial mutual exclusion for infinitely many processes - Wim H. Hesselink (CoRR, 2011)

Simulation refinement for concurrency verification. - Wim H. Hesselink (Sci. Comput. Program., 2011)

Queue based mutual exclusion with linearly bounded overtaking. - Wim H. Hesselink; Alex A. Aravind (Sci. Comput. Program., 2011)

Formalizing a hierarchical file system. - Wim H. Hesselink; Muhammad Ikram Ullah Lali (Formal Aspects Comput., 2012)

Finite and infinite implementation of transition systems. - Wim H. Hesselink; Gerard R. Renardel de Lavalette (Theor. Comput. Sci., 2012)

Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos. - Wim H. Hesselink (Acta Informatica, 2013)

A distributed resource allocation algorithm for many processes. - Wim H. Hesselink (Acta Informatica, 2013)

Starvation-free mutual exclusion with semaphores. - Wim H. Hesselink; Mark IJbema (Formal Aspects Comput., 2013)

Complete assertional proof rules for progress under weak and strong fairness. - Wim H. Hesselink (Sci. Comput. Program., 2013)

Mechanical verification of Lamport's Bakery algorithm. - Wim H. Hesselink (Sci. Comput. Program., 2013)

High-performance N-thread software solutions for mutual exclusion. - Peter A. Buhr; David Dice; Wim H. Hesselink (Concurr. Comput. Pract. Exp., 2015)

Mutual exclusion by four shared bits with not more than quadratic complexity. - Wim H. Hesselink (Sci. Comput. Program., 2015)

Dekker's mutual exclusion algorithm made RW-safe. - Peter A. Buhr; David Dice; Wim H. Hesselink (Concurr. Comput. Pract. Exp., 2016)

Correctness and concurrent complexity of the Black-White Bakery Algorithm. - Wim H. Hesselink (Formal Aspects Comput., 2016)

Tournaments for mutual exclusion: verification and concurrent complexity. - Wim H. Hesselink (Formal Aspects Comput., 2017)

High-contention mutual exclusion by elevator algorithms. - Peter A. Buhr; David Dice; Wim H. Hesselink (Concurr. Comput. Pract. Exp., 2018)

Fast mutual exclusion by the Triangle algorithm. - Wim H. Hesselink; Peter A. Buhr; David Dice (Concurr. Comput. Pract. Exp., 2018)

Group Mutual Exclusion by Fetch-and-increment. - Alex Aravind; Wim H. Hesselink (ACM Trans. Parallel Comput., 2019)

UNITY and Büchi automata. - Wim H. Hesselink (Formal Aspects Comput., 2021)

Trylock, a case for temporal logic and eternity variables. - Wim H. Hesselink (Sci. Comput. Program., 2022)

MCSH, a Lock with the Standard Interface. - Wim H. Hesselink; Peter A. Buhr (ACM Trans. Parallel Comput., 2023)

First-Come-First-Served as a Separate Principle. - Wim H. Hesselink; Peter A. Buhr; Colby A. Parsons (ACM Trans. Parallel Comput., 2024)