Wim H. Hesselink

91 papers A* 1A 1B 3C 4Journal 76Unranked 6

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