Wim H. Hesselink

According to our database1, Wim H. Hesselink
  • authored at least 84 papers between 1988 and 2017.
  • has a "Dijkstra number"2 of four.



In proceedings 
PhD thesis 



On csauthors.net:


Tournaments for mutual exclusion: verification and concurrent complexity.
Formal Asp. Comput., 2017

Correctness and concurrent complexity of the Black-White Bakery Algorithm.
Formal Asp. Comput., 2016

Dekker's mutual exclusion algorithm made RW-safe.
Concurrency and Computation: Practice and Experience, 2016

Mutual exclusion by four shared bits with not more than quadratic complexity.
Sci. Comput. Program., 2015

High-performance N-thread software solutions for mutual exclusion.
Concurrency and Computation: Practice and Experience, 2015

Mechanical verification of Lamport's Bakery algorithm.
Sci. Comput. Program., 2013

Complete assertional proof rules for progress under weak and strong fairness.
Sci. Comput. Program., 2013

Starvation-free mutual exclusion with semaphores.
Formal Asp. Comput., 2013

A distributed resource allocation algorithm for many processes.
Acta Inf., 2013

Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos.
Acta Inf., 2013

Finite and infinite implementation of transition systems.
Theor. Comput. Sci., 2012

Formalizing a hierarchical file system.
Formal Asp. Comput., 2012

A distributed resource allocation algorithm for many processes
CoRR, 2012

Queue based mutual exclusion with linearly bounded overtaking.
Sci. Comput. Program., 2011

Simulation refinement for concurrency verification.
Sci. Comput. Program., 2011

Partial mutual exclusion for infinitely many processes
CoRR, 2011

Nonatomic dual bakery algorithm with bounded tokens.
Acta Inf., 2011

Alternating states for dual nondeterminism in imperative programming.
Theor. Comput. Sci., 2010

Simple concurrent garbage collection almost without synchronization.
Formal Methods in System Design, 2010

Solutions of equations in languages.
Formal Asp. Comput., 2010

Formalizing a Hierarchical File System.
Electr. Notes Theor. Comput. Sci., 2009

A queue based mutual exclusion algorithm.
Acta Inf., 2009

Verification of a Lock-Free Implementation of Multiword LL/SC Object.
Proceedings of the Eighth IEEE International Conference on Dependable, 2009

A challenge for atomicity verification.
Sci. Comput. Program., 2008

Concurrent Computation of Attribute Filters on Shared Memory Parallel Machines.
IEEE Trans. Pattern Anal. Mach. Intell., 2008

Euclidean Skeletons of Digital Image and Volume Data in Linear Time by the Integer Medial Axis Transform.
IEEE Trans. Pattern Anal. Mach. Intell., 2008

Universal extensions to simulate specifications.
Inf. Comput., 2008

Simulation Refinement for Concurrency Verification.
Electr. Notes Theor. Comput. Sci., 2008

Lock-free parallel and concurrent garbage collection by mark&sweep.
Sci. Comput. Program., 2007

A linear-time algorithm for Euclidean feature transform sets.
Inf. Process. Lett., 2007

A general lock-free algorithm using compare-and-swap.
Inf. Comput., 2007

Kekulé Cells for Molecular Computation
CoRR, 2007

A criterion for atomicity revisited.
Acta Inf., 2007

Refinement verification of the lazy caching algorithm.
Acta Inf., 2006

Splitting forward simulations to copewith liveness.
Acta Inf., 2006

Eternity variables to prove simulation of specifications.
ACM Trans. Comput. Log., 2005

Lock-free dynamic hash tables with open addressing.
Distributed Computing, 2005

Lock-Free Parallel Garbage Collection.
Proceedings of the Parallel and Distributed Processing and Applications, 2005

Euclidean Skeletons of 3D Data Sets in Linear Time by the Integer Medial Axis Transform.
Proceedings of the Mathematical Morphology: 40 Years On, 2005

Experiments with strategies for agents in the social interaction game Mafia.
Proceedings of the BNAIC 2005, 2005

Using eternity variables to specify and prove a serializable database interface.
Sci. Comput. Program., 2004

Knowledge-Based Asynchronous Programming.
Fundam. Inform., 2004

An assertional proof for a construction of an atomic variable.
Formal Asp. Comput., 2004

Almost Wait-Free Resizable Hashtable.
Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

A Formal Reduction for Lock-Free Parallel Algorithms.
Proceedings of the Computer Aided Verification, 16th International Conference, 2004

Salembier's Min-tree algorithm turned into breadth first search.
Inf. Process. Lett., 2003

Efficient almost wait-free parallel accessible dynamic hashtables
CoRR, 2003

Preference rankings in the face of uncertainty.
Acta Inf., 2003

Eternity variables to prove simulation of specifications
CoRR, 2002

An assertional criterion for atomicity.
Acta Inf., 2002

Eternity Variables to Simulate Specifications.
Proceedings of the Mathematics of Program Construction, 6th International Conference, 2002

Concurrent determination of connected components.
Sci. Comput. Program., 2001

Wait-free concurrent memory management by Create and Read until Deletion (CaRuD).
Distributed Computing, 2001

An algorithm for the asynchronous Write-All problem based on process collision.
Distributed Computing, 2001

Fixpoint semantics and simulation.
Theor. Comput. Sci., 2000

A generalization of Naundorf's fixpoint theorem.
Theor. Comput. Sci., 2000

A General Algorithm for Computing Distance Transforms in Linear Time.
Proceedings of the 5th International Symposium on Mathematical Morphology and its Applications to Image and Signal Processing, 2000

Predicate Transformers for Recursive Procedures with Local Variables.
Formal Asp. Comput., 1999

The Verified Incremental Design of a Distributed Spanning Tree Algorithm: Extended Abstract.
Formal Asp. Comput., 1999

Progress Under Bounded Fairness.
Distributed Computing, 1999

Invariants for the Construction of a Handshake Register.
Inf. Process. Lett., 1998

The design of a linearization of a concurrent data object.
Proceedings of the Programming Concepts and Methods, 1998

Theories for Mechanical Proofs of Imperative Programs.
Formal Asp. Comput., 1997

A Mechanical Proof of Segall's PIF Algorithm.
Formal Asp. Comput., 1997

Bounded Delay for a Free Address.
Acta Inf., 1996

Safety and Progress of Recursive Procedures.
Formal Asp. Comput., 1995

Wait-Free Linearization with a Mechanical Proof.
Distributed Computing, 1995

Angelic Termination in Dijkstra's Calculus.
Proceedings of the Mathematics of Program Construction, 1995

Nondeterminacy and Recursion via Stacks and Games.
Theor. Comput. Sci., 1994

Wait-Free Linearization with an Assertional Proof.
Distributed Computing, 1994

Compact Image Representation using Gabor Wavelets.
Proceedings of the Massively Parallel Processing Applications and Develompent, 1994

Proof Rules for Recursive Procedures.
Formal Asp. Comput., 1993

Processes and Formalism for Unbounded Choice.
Theor. Comput. Sci., 1992

LR-Parsing Derived.
Sci. Comput. Program., 1992

Temporal Preconditions of Recursive Procedures.
Proceedings of the Sematics: Foundations and Applications, 1992

Repetitions, Known or Unknown?
Inf. Process. Lett., 1991

Smoothsort Revisited.
Inf. Process. Lett., 1991

Axioms and Models of Linear Logic.
Formal Asp. Comput., 1990

Command Algebras, Recursion and Program Transformation.
Formal Asp. Comput., 1990

Predicate-Transformer Semantics of General Recursion.
Acta Inf., 1989

Initialisation with a Final Value, an Exercise in Program Transformation.
Proceedings of the Mathematics of Program Construction, 1989

A Mathematical Approach to Nondeterminism in Data Types.
ACM Trans. Program. Lang. Syst., 1988

Deadlock and Fairness in Morphisms of Transition Systems.
Theor. Comput. Sci., 1988

Interpretations of Recursion under Unbounded Nondeterminacy.
Theor. Comput. Sci., 1988