Wim H. Hesselink

Colby A. Parsons

ACM Trans. Parallel Comput., December, 2024

2023

MCSH, a Lock with the Standard Interface.

[BibT_eX]

[DOI]

ACM Trans. Parallel Comput., June, 2023

2022

Trylock, a case for temporal logic and eternity variables.

[BibT_eX]

[DOI]

Sci. Comput. Program., 2022

2021

UNITY and Büchi automata.

[BibT_eX]

[DOI]

Formal Aspects Comput., 2021

2019

Group Mutual Exclusion by Fetch-and-increment.

[BibT_eX]

[DOI]

Alex Aravind

ACM Trans. Parallel Comput., 2019

2018

Fast mutual exclusion by the Triangle algorithm.

[BibT_eX]

[DOI]

Concurr. Comput. Pract. Exp., 2018

High-contention mutual exclusion by elevator algorithms.

[BibT_eX]

[DOI]

Concurr. Comput. Pract. Exp., 2018

2017

Tournaments for mutual exclusion: verification and concurrent complexity.

[BibT_eX]

[DOI]

Formal Aspects Comput., 2017

2016

Correctness and concurrent complexity of the Black-White Bakery Algorithm.

[BibT_eX]

[DOI]

Formal Aspects Comput., 2016

Dekker's mutual exclusion algorithm made RW-safe.

[BibT_eX]

[DOI]

Concurr. Comput. Pract. Exp., 2016

2015

Mutual exclusion by four shared bits with not more than quadratic complexity.

[BibT_eX]

[DOI]

Sci. Comput. Program., 2015

High-performance <i>N</i>-thread software solutions for mutual exclusion.

[BibT_eX]

[DOI]

Concurr. Comput. Pract. Exp., 2015

2013

Mechanical verification of Lamport's Bakery algorithm.

[BibT_eX]

[DOI]

Sci. Comput. Program., 2013

Complete assertional proof rules for progress under weak and strong fairness.

[BibT_eX]

[DOI]

Sci. Comput. Program., 2013

Starvation-free mutual exclusion with semaphores.

[BibT_eX]

[DOI]

Mark IJbema

Formal Aspects Comput., 2013

A distributed resource allocation algorithm for many processes.

[BibT_eX]

[DOI]

Acta Informatica, 2013

Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos.

[BibT_eX]

[DOI]

Acta Informatica, 2013

2012

Finite and infinite implementation of transition systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Formalizing a hierarchical file system.

[BibT_eX]

[DOI]

Muhammad Ikram Ullah Lali

Formal Aspects Comput., 2012

2011

Queue based mutual exclusion with linearly bounded overtaking.

[BibT_eX]

[DOI]

Alex A. Aravind

Sci. Comput. Program., 2011

Simulation refinement for concurrency verification.

[BibT_eX]

[DOI]

Sci. Comput. Program., 2011

Partial mutual exclusion for infinitely many processes

[BibT_eX]

[DOI]

CoRR, 2011

Nonatomic dual bakery algorithm with bounded tokens.

[BibT_eX]

[DOI]

Alex A. Aravind

Acta Informatica, 2011

2010

Alternating states for dual nondeterminism in imperative programming.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Simple concurrent garbage collection almost without synchronization.

[BibT_eX]

[DOI]

Muhammad Ikram Ullah Lali

Formal Methods Syst. Des., 2010

Solutions of equations in languages.

[BibT_eX]

[DOI]

Formal Aspects Comput., 2010

2009

A queue based mutual exclusion algorithm.

[BibT_eX]

[DOI]

Alex A. Aravind

Acta Informatica, 2009

Verification of a Lock-Free Implementation of Multiword LL/SC Object.

[BibT_eX]

[DOI]

Yan Fu

Proceedings of the Eighth IEEE International Conference on Dependable, 2009

2008

A challenge for atomicity verification.

[BibT_eX]

[DOI]

Sci. Comput. Program., 2008

Concurrent Computation of Attribute Filters on Shared Memory Parallel Machines.

[BibT_eX]

[DOI]

Michael H. F. Wilkinson

IEEE Trans. Pattern Anal. Mach. Intell., 2008

Euclidean Skeletons of Digital Image and Volume Data in Linear Time by the Integer Medial Axis Transform.

[BibT_eX]

[DOI]

Jos B. T. M. Roerdink

IEEE Trans. Pattern Anal. Mach. Intell., 2008

Universal extensions to simulate specifications.

[BibT_eX]

[DOI]

Inf. Comput., 2008

2007

Lock-free parallel and concurrent garbage collection by mark&sweep.

[BibT_eX]

[DOI]

Sci. Comput. Program., 2007

A linear-time algorithm for Euclidean feature transform sets.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2007

A general lock-free algorithm using compare-and-swap.

[BibT_eX]

[DOI]

Inf. Comput., 2007

Kekulé Cells for Molecular Computation

[BibT_eX]

[DOI]

M. H. van der Veen

CoRR, 2007

A criterion for atomicity revisited.

[BibT_eX]

[DOI]

Acta Informatica, 2007

2006

Refinement verification of the lazy caching algorithm.

[BibT_eX]

[DOI]

Acta Informatica, 2006

Splitting forward simulations to copewith liveness.

[BibT_eX]

[DOI]

Acta Informatica, 2006

2005

Eternity variables to prove simulation of specifications.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2005

Lock-free dynamic hash tables with open addressing.

[BibT_eX]

[DOI]

Distributed Comput., 2005

Lock-Free Parallel Garbage Collection.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Menno Visser

Jos B. T. M. Roerdink

Proceedings of the Mathematical Morphology: 40 Years On, 2005

Experiments with strategies for agents in the social interaction game Mafia.

[BibT_eX]

Hendrik Wietze de Haan

Gerben G. Meyer

Proceedings of the BNAIC 2005, 2005

2004

Using eternity variables to specify and prove a serializable database interface.

[BibT_eX]

[DOI]

Sci. Comput. Program., 2004

Knowledge-Based Asynchronous Programming.

[BibT_eX]

[DOI]

Hendrik Wietze de Haan

Fundam. Informaticae, 2004

An assertional proof for a construction of an atomic variable.

[BibT_eX]

[DOI]

Formal Aspects Comput., 2004

Almost Wait-Free Resizable Hashtable.

[BibT_eX]

[DOI]

Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

A Formal Reduction for Lock-Free Parallel Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 16th International Conference, 2004

2003

Salembier's Min-tree algorithm turned into breadth first search.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

Efficient almost wait-free parallel accessible dynamic hashtables

[BibT_eX]

[DOI]

CoRR, 2003

Preference rankings in the face of uncertainty.

[BibT_eX]

[DOI]

Acta Informatica, 2003

2002

An assertional criterion for atomicity.

[BibT_eX]

[DOI]

Acta Informatica, 2002

Eternity Variables to Simulate Specifications.

[BibT_eX]

[DOI]

Proceedings of the Mathematics of Program Construction, 6th International Conference, 2002

2001

Concurrent determination of connected components.

[BibT_eX]

[DOI]

Arnold Meijster

Coenraad Bron

Sci. Comput. Program., 2001

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

[BibT_eX]

[DOI]

Distributed Comput., 2001

An algorithm for the asynchronous Write-All problem based on process collision.

[BibT_eX]

[DOI]

Distributed Comput., 2001

2000

Fixpoint semantics and simulation.

[BibT_eX]

[DOI]

Albert Thijs

Theor. Comput. Sci., 2000

A generalization of Naundorf's fixpoint theorem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

A General Algorithm for Computing Distance Transforms in Linear Time.

[BibT_eX]

[DOI]

Arnold Meijster

Jos B. T. M. Roerdink

Proceedings of the 5th International Symposium on Mathematical Morphology and its Applications to Image and Signal Processing, 2000

1999

Predicate Transformers for Recursive Procedures with Local Variables.

[BibT_eX]

[DOI]

Formal Aspects Comput., 1999

The Verified Incremental Design of a Distributed Spanning Tree Algorithm: Extended Abstract.

[BibT_eX]

[DOI]

Formal Aspects Comput., 1999

Progress Under Bounded Fairness.

[BibT_eX]

[DOI]

Distributed Comput., 1999

1998

Invariants for the Construction of a Handshake Register.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1998

The design of a linearization of a concurrent data object.

[BibT_eX]

Proceedings of the Programming Concepts and Methods, 1998

1997

Theories for Mechanical Proofs of Imperative Programs.

[BibT_eX]

[DOI]

Formal Aspects Comput., 1997

A Mechanical Proof of Segall's PIF Algorithm.

[BibT_eX]

[DOI]

Formal Aspects Comput., 1997

1996

Bounded Delay for a Free Address.

[BibT_eX]

[DOI]

Acta Informatica, 1996

1995

Safety and Progress of Recursive Procedures.

[BibT_eX]

[DOI]

Formal Aspects Comput., 1995

Wait-Free Linearization with a Mechanical Proof.

[BibT_eX]

[DOI]

Distributed Comput., 1995

Angelic Termination in Dijkstra's Calculus.

[BibT_eX]

[DOI]

Proceedings of the Mathematics of Program Construction, 1995

1994

Nondeterminacy and Recursion via Stacks and Games.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

Wait-Free Linearization with an Assertional Proof.

[BibT_eX]

[DOI]

Distributed Comput., 1994

Compact Image Representation using Gabor Wavelets.

[BibT_eX]

Proceedings of the Massively Parallel Processing Applications and Develompent, 1994

1993

Proof Rules for Recursive Procedures.

[BibT_eX]

[DOI]

Formal Aspects Comput., 1993

1992

Processes and Formalism for Unbounded Choice.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1992

LR-Parsing Derived.

[BibT_eX]

[DOI]

Sci. Comput. Program., 1992

Temporal Preconditions of Recursive Procedures.

[BibT_eX]

[DOI]

Ronald Reinds

Proceedings of the Sematics: Foundations and Applications, 1992

1991

Repetitions, Known or Unknown?

[BibT_eX]

[DOI]

Inf. Process. Lett., 1991

Smoothsort Revisited.

[BibT_eX]

[DOI]

Coenraad Bron

Inf. Process. Lett., 1991

1990

Axioms and Models of Linear Logic.

[BibT_eX]

[DOI]

Formal Aspects Comput., 1990

Command Algebras, Recursion and Program Transformation.

[BibT_eX]

[DOI]

Formal Aspects Comput., 1990

1989

Predicate-Transformer Semantics of General Recursion.

[BibT_eX]

[DOI]

Acta Informatica, 1989

Initialisation with a Final Value, an Exercise in Program Transformation.

[BibT_eX]

[DOI]

Proceedings of the Mathematics of Program Construction, 1989

1988

A Mathematical Approach to Nondeterminism in Data Types.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 1988

Deadlock and Fairness in Morphisms of Transition Systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1988

Interpretations of Recursion under Unbounded Nondeterminacy.

[BibT_eX]

[DOI]