Wim H. Hesselink

Publication Activity (10 Years)

Years Active: 1988-2023
Publications (10 Years): 11

Top Topics

Temporal Planning

Mutual Exclusion

Optimal Solution

Computational Cost

Top Venues

Formal Aspects Comput.

Sci. Comput. Program.

Concurr. Comput. Pract. Exp.

ACM Trans. Parallel Comput.

Publications

Wim H. Hesselink, Peter A. Buhr
MCSH, a Lock with the Standard Interface. ACM Trans. Parallel Comput. 10 (2) (2023)
Wim H. Hesselink
Trylock, a case for temporal logic and eternity variables. Sci. Comput. Program. 216 (2022)
Wim H. Hesselink
UNITY and Büchi automata. Formal Aspects Comput. 33 (2) (2021)
Alex Aravind, Wim H. Hesselink
Group Mutual Exclusion by Fetch-and-increment. ACM Trans. Parallel Comput. 5 (4) (2019)
Peter A. Buhr, David Dice, Wim H. Hesselink
High-contention mutual exclusion by elevator algorithms. Concurr. Comput. Pract. Exp. 30 (18) (2018)
Wim H. Hesselink, Peter A. Buhr, David Dice
Fast mutual exclusion by the Triangle algorithm. Concurr. Comput. Pract. Exp. 30 (4) (2018)
Wim H. Hesselink
Tournaments for mutual exclusion: verification and concurrent complexity. Formal Aspects Comput. 29 (5) (2017)
Peter A. Buhr, David Dice, Wim H. Hesselink
Dekker's mutual exclusion algorithm made RW-safe. Concurr. Comput. Pract. Exp. 28 (1) (2016)
Wim H. Hesselink
Correctness and concurrent complexity of the Black-White Bakery Algorithm. Formal Aspects Comput. 28 (2) (2016)
Peter A. Buhr, David Dice, Wim H. Hesselink
-thread software solutions for mutual exclusion. Concurr. Comput. Pract. Exp. 27 (3) (2015)
Wim H. Hesselink
Mutual exclusion by four shared bits with not more than quadratic complexity. Sci. Comput. Program. 102 (2015)
Wim H. Hesselink, Mark IJbema
Starvation-free mutual exclusion with semaphores. Formal Aspects Comput. 25 (6) (2013)
Wim H. Hesselink
A distributed resource allocation algorithm for many processes. Acta Informatica 50 (5-6) (2013)
Wim H. Hesselink
Complete assertional proof rules for progress under weak and strong fairness. Sci. Comput. Program. 78 (9) (2013)
Wim H. Hesselink
Mechanical verification of Lamport's Bakery algorithm. Sci. Comput. Program. 78 (9) (2013)
Wim H. Hesselink
Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos. Acta Informatica 50 (3) (2013)
Wim H. Hesselink
A distributed resource allocation algorithm for many processes CoRR (2012)
Wim H. Hesselink, Muhammad Ikram Lali
Formalizing a hierarchical file system. Formal Aspects Comput. 24 (1) (2012)
Wim H. Hesselink, Gerard R. Renardel de Lavalette
Finite and infinite implementation of transition systems. Theor. Comput. Sci. 458 (2012)
Alex A. Aravind, Wim H. Hesselink
Nonatomic dual bakery algorithm with bounded tokens. Acta Informatica 48 (2) (2011)
Wim H. Hesselink
Simulation refinement for concurrency verification. Sci. Comput. Program. 76 (9) (2011)
Wim H. Hesselink, Alex A. Aravind
Queue based mutual exclusion with linearly bounded overtaking. Sci. Comput. Program. 76 (7) (2011)
Wim H. Hesselink
Partial mutual exclusion for infinitely many processes CoRR (2011)
Wim H. Hesselink, Muhammad Ikram Lali
Simple concurrent garbage collection almost without synchronization. Formal Methods Syst. Des. 36 (2) (2010)
Wim H. Hesselink
Solutions of equations in languages. Formal Aspects Comput. 22 (5) (2010)
Wim H. Hesselink
Alternating states for dual nondeterminism in imperative programming. Theor. Comput. Sci. 411 (22-24) (2010)
Wim H. Hesselink, Muhammad Ikram Lali
Formalizing a Hierarchical File System. Electron. Notes Theor. Comput. Sci. 259 (2009)
Hui Gao, Yan Fu, Wim H. Hesselink
Verification of a Lock-Free Implementation of Multiword LL/SC Object. DASC (2009)
Alex A. Aravind, Wim H. Hesselink
A queue based mutual exclusion algorithm. Acta Informatica 46 (1) (2009)
Wim H. Hesselink, Jos B. T. M. Roerdink
Euclidean Skeletons of Digital Image and Volume Data in Linear Time by the Integer Medial Axis Transform. IEEE Trans. Pattern Anal. Mach. Intell. 30 (12) (2008)
Wim H. Hesselink
A challenge for atomicity verification. Sci. Comput. Program. 71 (1) (2008)
Wim H. Hesselink
Simulation Refinement for Concurrency Verification. Electron. Notes Theor. Comput. Sci. 214 (2008)
Wim H. Hesselink
Universal extensions to simulate specifications. Inf. Comput. 206 (1) (2008)
Michael H. F. Wilkinson, Hui Gao, Wim H. Hesselink, Jan-Eppo Jonker, Arnold Meijster
Concurrent Computation of Attribute Filters on Shared Memory Parallel Machines. IEEE Trans. Pattern Anal. Mach. Intell. 30 (10) (2008)
Hui Gao, Jan Friso Groote, Wim H. Hesselink
Lock-free parallel and concurrent garbage collection by mark&sweep. Sci. Comput. Program. 64 (3) (2007)
Wim H. Hesselink, J. C. Hummelen, H. T. Jonkman, H. G. Reker, Gerard R. Renardel de Lavalette, M. H. van der Veen
Kekulé Cells for Molecular Computation CoRR (2007)
Hui Gao, Wim H. Hesselink
A general lock-free algorithm using compare-and-swap. Inf. Comput. 205 (2) (2007)
Wim H. Hesselink
A linear-time algorithm for Euclidean feature transform sets. Inf. Process. Lett. 102 (5) (2007)
Wim H. Hesselink
A criterion for atomicity revisited. Acta Informatica 44 (2) (2007)
Wim H. Hesselink
Refinement verification of the lazy caching algorithm. Acta Informatica 43 (3) (2006)
Wim H. Hesselink
Splitting forward simulations to copewith liveness. Acta Informatica 42 (8-9) (2006)
Hui Gao, Jan Friso Groote, Wim H. Hesselink
Lock-free dynamic hash tables with open addressing. Distributed Comput. 18 (1) (2005)
Hui Gao, Jan Friso Groote, Wim H. Hesselink
Lock-Free Parallel Garbage Collection. ISPA (2005)
Wim H. Hesselink
Eternity variables to prove simulation of specifications. ACM Trans. Comput. Log. 6 (1) (2005)
Wim H. Hesselink, Menno Visser, Jos B. T. M. Roerdink
Euclidean Skeletons of 3D Data Sets in Linear Time by the Integer Medial Axis Transform. ISMM (2005)
Hendrik Wietze de Haan, Wim H. Hesselink, Gerben G. Meyer, Gerard R. Renardel de Lavalette
Experiments with strategies for agents in the social interaction game Mafia. BNAIC (2005)
Hui Gao, Jan Friso Groote, Wim H. Hesselink
Almost Wait-Free Resizable Hashtable. IPDPS (2004)
Hui Gao, Wim H. Hesselink
A Formal Reduction for Lock-Free Parallel Algorithms. CAV (2004)
Wim H. Hesselink
An assertional proof for a construction of an atomic variable. Formal Aspects Comput. 16 (4) (2004)
Wim H. Hesselink
Using eternity variables to specify and prove a serializable database interface. Sci. Comput. Program. 51 (1-2) (2004)
Hendrik Wietze de Haan, Wim H. Hesselink, Gerard R. Renardel de Lavalette
Knowledge-Based Asynchronous Programming. Fundam. Informaticae 63 (2-3) (2004)
Wim H. Hesselink
Salembier's Min-tree algorithm turned into breadth first search. Inf. Process. Lett. 88 (5) (2003)
Hui Gao, Jan Friso Groote, Wim H. Hesselink
Efficient almost wait-free parallel accessible dynamic hashtables CoRR (2003)
Wim H. Hesselink
Preference rankings in the face of uncertainty. Acta Informatica 39 (3) (2003)
Wim H. Hesselink
Eternity variables to prove simulation of specifications CoRR (2002)
Wim H. Hesselink
Eternity Variables to Simulate Specifications. MPC (2002)
Wim H. Hesselink
An assertional criterion for atomicity. Acta Informatica 38 (5) (2002)
Jan Friso Groote, Wim H. Hesselink, Sjouke Mauw, Rogier Vermeulen
An algorithm for the asynchronous Write-All problem based on process collision. Distributed Comput. 14 (2) (2001)
Wim H. Hesselink, Jan Friso Groote
Wait-free concurrent memory management by Create and Read until Deletion (CaRuD). Distributed Comput. 14 (1) (2001)
Wim H. Hesselink, Arnold Meijster, Coenraad Bron
Concurrent determination of connected components. Sci. Comput. Program. 41 (2) (2001)
Wim H. Hesselink
A generalization of Naundorf's fixpoint theorem. Theor. Comput. Sci. 247 (1-2) (2000)
Arnold Meijster, Jos B. T. M. Roerdink, Wim H. Hesselink
A General Algorithm for Computing Distance Transforms in Linear Time. ISMM (2000)
Wim H. Hesselink, Albert Thijs
Fixpoint semantics and simulation. Theor. Comput. Sci. 238 (1-2) (2000)
Wim H. Hesselink
Predicate Transformers for Recursive Procedures with Local Variables. Formal Aspects Comput. 11 (6) (1999)
Wim H. Hesselink
Progress Under Bounded Fairness. Distributed Comput. 12 (4) (1999)
Wim H. Hesselink
The Verified Incremental Design of a Distributed Spanning Tree Algorithm: Extended Abstract. Formal Aspects Comput. 11 (1) (1999)
Wim H. Hesselink
Invariants for the Construction of a Handshake Register. Inf. Process. Lett. 68 (4) (1998)
Wim H. Hesselink
The design of a linearization of a concurrent data object. PROCOMET (1998)
Wim H. Hesselink
Theories for Mechanical Proofs of Imperative Programs. Formal Aspects Comput. 9 (5-6) (1997)
Wim H. Hesselink
A Mechanical Proof of Segall's PIF Algorithm. Formal Aspects Comput. 9 (2) (1997)
Wim H. Hesselink
Bounded Delay for a Free Address. Acta Informatica 33 (3) (1996)
Wim H. Hesselink
Angelic Termination in Dijkstra's Calculus. MPC (1995)
Wim H. Hesselink
Wait-Free Linearization with a Mechanical Proof. Distributed Comput. 9 (1) (1995)
Wim H. Hesselink
Safety and Progress of Recursive Procedures. Formal Aspects Comput. 7 (4) (1995)
Wim H. Hesselink
Nondeterminacy and Recursion via Stacks and Games. Theor. Comput. Sci. 124 (2) (1994)
Wim H. Hesselink
Wait-Free Linearization with an Assertional Proof. Distributed Comput. 8 (2) (1994)
Wim H. Hesselink
Compact Image Representation using Gabor Wavelets. EUROSIM (1994)
Wim H. Hesselink
Proof Rules for Recursive Procedures. Formal Aspects Comput. 5 (6) (1993)
Wim H. Hesselink
LR-Parsing Derived. Sci. Comput. Program. 19 (2) (1992)
Wim H. Hesselink
Processes and Formalism for Unbounded Choice. Theor. Comput. Sci. 99 (1) (1992)
Wim H. Hesselink, Ronald Reinds
Temporal Preconditions of Recursive Procedures. REX Workshop (1992)
Coenraad Bron, Wim H. Hesselink
Smoothsort Revisited. Inf. Process. Lett. 39 (5) (1991)
Wim H. Hesselink
Repetitions, Known or Unknown? Inf. Process. Lett. 40 (1) (1991)
Wim H. Hesselink
Axioms and Models of Linear Logic. Formal Aspects Comput. 2 (2) (1990)
Wim H. Hesselink
Command Algebras, Recursion and Program Transformation. Formal Aspects Comput. 2 (1) (1990)
Wim H. Hesselink
Predicate-Transformer Semantics of General Recursion. Acta Informatica 26 (4) (1989)
Wim H. Hesselink
Initialisation with a Final Value, an Exercise in Program Transformation. MPC (1989)
Wim H. Hesselink
A Mathematical Approach to Nondeterminism in Data Types. ACM Trans. Program. Lang. Syst. 10 (1) (1988)
Wim H. Hesselink
Deadlock and Fairness in Morphisms of Transition Systems. Theor. Comput. Sci. 59 (1988)
Wim H. Hesselink
Interpretations of Recursion under Unbounded Nondeterminacy. Theor. Comput. Sci. 59 (1988)