default search action
Wim H. Hesselink
Person information
- affiliation: University of Groningen, Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j71]Wim H. Hesselink
, Peter A. Buhr
First-Come-First-Served as a Separate Principle. ACM Trans. Parallel Comput. 11(4): 16:1-16:20 (2024) - 2023
- [j70]Wim H. Hesselink
MCSH, a Lock with the Standard Interface. ACM Trans. Parallel Comput. 10(2): 11:1-11:23 (2023) - 2022
- [j69]Wim H. Hesselink
Trylock, a case for temporal logic and eternity variables. Sci. Comput. Program. 216: 102767 (2022) - 2021
- [j68]Wim H. Hesselink
UNITY and Büchi automata. Formal Aspects Comput. 33(2): 185-205 (2021)
2010 – 2019
- 2019
- [j67]Alex Aravind, Wim H. Hesselink
Group Mutual Exclusion by Fetch-and-increment. ACM Trans. Parallel Comput. 5(4): 14:1-14:29 (2019) - 2018
- [j66]Wim H. Hesselink
Fast mutual exclusion by the Triangle algorithm. Concurr. Comput. Pract. Exp. 30(4) (2018) - [j65]Peter A. Buhr
High-contention mutual exclusion by elevator algorithms. Concurr. Comput. Pract. Exp. 30(18) (2018) - 2017
- [j64]Wim H. Hesselink
Tournaments for mutual exclusion: verification and concurrent complexity. Formal Aspects Comput. 29(5): 833-852 (2017) - 2016
- [j63]Peter A. Buhr, David Dice, Wim H. Hesselink
Dekker's mutual exclusion algorithm made RW-safe. Concurr. Comput. Pract. Exp. 28(1): 144-165 (2016) - [j62]Wim H. Hesselink
Correctness and concurrent complexity of the Black-White Bakery Algorithm. Formal Aspects Comput. 28(2): 325-341 (2016) - 2015
- [j61]Peter A. Buhr, David Dice, Wim H. Hesselink
High-performance N-thread software solutions for mutual exclusion. Concurr. Comput. Pract. Exp. 27(3): 651-701 (2015) - [j60]Wim H. Hesselink
Mutual exclusion by four shared bits with not more than quadratic complexity. Sci. Comput. Program. 102: 57-75 (2015) - 2013
- [j59]Wim H. Hesselink
Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos. Acta Informatica 50(3): 199-228 (2013) - [j58]Wim H. Hesselink
A distributed resource allocation algorithm for many processes. Acta Informatica 50(5-6): 297-329 (2013) - [j57]Wim H. Hesselink
Starvation-free mutual exclusion with semaphores. Formal Aspects Comput. 25(6): 947-969 (2013) - [j56]Wim H. Hesselink
Complete assertional proof rules for progress under weak and strong fairness. Sci. Comput. Program. 78(9): 1521-1537 (2013) - [j55]Wim H. Hesselink
Mechanical verification of Lamport's Bakery algorithm. Sci. Comput. Program. 78(9): 1622-1638 (2013) - 2012
- [j54]Wim H. Hesselink
Formalizing a hierarchical file system. Formal Aspects Comput. 24(1): 27-44 (2012) - [j53]Wim H. Hesselink
Finite and infinite implementation of transition systems. Theor. Comput. Sci. 458: 131-135 (2012) - [i5]Wim H. Hesselink:
A distributed resource allocation algorithm for many processes. CoRR abs/1204.6170 (2012) - 2011
- [j52]Alex A. Aravind, Wim H. Hesselink
Nonatomic dual bakery algorithm with bounded tokens. Acta Informatica 48(2): 67-96 (2011) - [j51]Wim H. Hesselink
Queue based mutual exclusion with linearly bounded overtaking. Sci. Comput. Program. 76(7): 542-554 (2011) - [j50]Wim H. Hesselink
Simulation refinement for concurrency verification. Sci. Comput. Program. 76(9): 739-755 (2011) - [i4]Wim H. Hesselink:
Partial mutual exclusion for infinitely many processes. CoRR abs/1111.5775 (2011) - 2010
- [j49]Wim H. Hesselink
Solutions of equations in languages. Formal Aspects Comput. 22(5): 537-545 (2010) - [j48]Wim H. Hesselink
Simple concurrent garbage collection almost without synchronization. Formal Methods Syst. Des. 36(2): 148-166 (2010) - [j47]Wim H. Hesselink
Alternating states for dual nondeterminism in imperative programming. Theor. Comput. Sci. 411(22-24): 2317-2330 (2010)
2000 – 2009
- 2009
- [j46]Alex A. Aravind, Wim H. Hesselink
A queue based mutual exclusion algorithm. Acta Informatica 46(1): 73-86 (2009) - [c15]Hui Gao, Yan Fu, Wim H. Hesselink:
Verification of a Lock-Free Implementation of Multiword LL/SC Object. DASC 2009: 31-36 - [c14]Wim H. Hesselink, Muhammad Ikram Ullah Lali:
Formalizing a Hierarchical File System. REFINE@FMWeek 2009: 67-85 - 2008
- [j45]Wim H. Hesselink
Universal extensions to simulate specifications. Inf. Comput. 206(1): 108-128 (2008) - [j44]Michael H. F. Wilkinson
Concurrent Computation of Attribute Filters on Shared Memory Parallel Machines. IEEE Trans. Pattern Anal. Mach. Intell. 30(10): 1800-1813 (2008) - [j43]Wim H. Hesselink
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): 2204-2217 (2008) - [j42]Wim H. Hesselink
A challenge for atomicity verification. Sci. Comput. Program. 71(1): 57-72 (2008) - [c13]Wim H. Hesselink:
Simulation Refinement for Concurrency Verification. Refine@FM 2008: 3-23 - 2007
- [j41]Wim H. Hesselink
A criterion for atomicity revisited. Acta Informatica 44(2): 123-151 (2007) - [j40]Hui Gao, Wim H. Hesselink
A general lock-free algorithm using compare-and-swap. Inf. Comput. 205(2): 225-241 (2007) - [j39]Wim H. Hesselink
A linear-time algorithm for Euclidean feature transform sets. Inf. Process. Lett. 102(5): 181-186 (2007) - [j38]Hui Gao, Jan Friso Groote
Lock-free parallel and concurrent garbage collection by mark&sweep. Sci. Comput. Program. 64(3): 341-374 (2007) - [i3]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 abs/0704.2282 (2007) - 2006
- [j37]Wim H. Hesselink
Splitting forward simulations to copewith liveness. Acta Informatica 42(8-9): 583-602 (2006) - [j36]Wim H. Hesselink
Refinement verification of the lazy caching algorithm. Acta Informatica 43(3): 195-222 (2006) - 2005
- [j35]Hui Gao, Jan Friso Groote
Lock-free dynamic hash tables with open addressing. Distributed Comput. 18(1): 21-42 (2005) - [j34]Wim H. Hesselink:
Eternity variables to prove simulation of specifications. ACM Trans. Comput. Log. 6(1): 175-201 (2005) - [c12]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: 89-95 - [c11]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: 259-268 - [c10]Hui Gao, Jan Friso Groote
Lock-Free Parallel Garbage Collection. ISPA 2005: 263-274 - 2004
- [j33]Wim H. Hesselink
An assertional proof for a construction of an atomic variable. Formal Aspects Comput. 16(4): 387-393 (2004) - [j32]Hendrik Wietze de Haan, Wim H. Hesselink, Gerard R. Renardel de Lavalette:
Knowledge-Based Asynchronous Programming. Fundam. Informaticae 63(2-3): 259-281 (2004) - [j31]Wim H. Hesselink
Using eternity variables to specify and prove a serializable database interface. Sci. Comput. Program. 51(1-2): 47-85 (2004) - [c9]Hui Gao, Wim H. Hesselink:
A Formal Reduction for Lock-Free Parallel Algorithms. CAV 2004: 44-56 - [c8]Hui Gao, Jan Friso Groote
Almost Wait-Free Resizable Hashtable. IPDPS 2004 - 2003
- [j30]Wim H. Hesselink
Preference rankings in the face of uncertainty. Acta Informatica 39(3): 211-231 (2003) - [j29]Wim H. Hesselink
Salembier's Min-tree algorithm turned into breadth first search. Inf. Process. Lett. 88(5): 225-229 (2003) - [i2]Hui Gao, Jan Friso Groote, Wim H. Hesselink:
Efficient almost wait-free parallel accessible dynamic hashtables. CoRR cs.DC/0303011 (2003) - 2002
- [j28]Wim H. Hesselink:
An assertional criterion for atomicity. Acta Informatica 38(5): 343-366 (2002) - [c7]Wim H. Hesselink:
Eternity Variables to Simulate Specifications. MPC 2002: 117-130 - [i1]Wim H. Hesselink:
Eternity variables to prove simulation of specifications. CoRR cs.DC/0207095 (2002) - 2001
- [j27]Wim H. Hesselink, Jan Friso Groote
Wait-free concurrent memory management by Create and Read until Deletion (CaRuD). Distributed Comput. 14(1): 31-39 (2001) - [j26]Jan Friso Groote
An algorithm for the asynchronous Write-All problem based on process collision. Distributed Comput. 14(2): 75-81 (2001) - [j25]Wim H. Hesselink, Arnold Meijster, Coenraad Bron:
Concurrent determination of connected components. Sci. Comput. Program. 41(2): 173-194 (2001) - 2000
- [j24]Wim H. Hesselink, Albert Thijs:
Fixpoint semantics and simulation. Theor. Comput. Sci. 238(1-2): 275-311 (2000) - [j23]Wim H. Hesselink:
A generalization of Naundorf's fixpoint theorem. Theor. Comput. Sci. 247(1-2): 291-296 (2000) - [c6]Arnold Meijster, Jos B. T. M. Roerdink, Wim H. Hesselink:
A General Algorithm for Computing Distance Transforms in Linear Time. ISMM 2000: 331-340
1990 – 1999
- 1999
- [j22]Wim H. Hesselink:
Progress Under Bounded Fairness. Distributed Comput. 12(4): 197-207 (1999) - [j21]Wim H. Hesselink:
The Verified Incremental Design of a Distributed Spanning Tree Algorithm: Extended Abstract. Formal Aspects Comput. 11(1): 45-55 (1999) - [j20]Wim H. Hesselink:
Predicate Transformers for Recursive Procedures with Local Variables. Formal Aspects Comput. 11(6): 616-636 (1999) - 1998
- [j19]Wim H. Hesselink:
Invariants for the Construction of a Handshake Register. Inf. Process. Lett. 68(4): 173-177 (1998) - [c5]Wim H. Hesselink:
The design of a linearization of a concurrent data object. PROCOMET 1998: 205-224 - 1997
- [j18]Wim H. Hesselink:
A Mechanical Proof of Segall's PIF Algorithm. Formal Aspects Comput. 9(2): 208-226 (1997) - [j17]Wim H. Hesselink:
Theories for Mechanical Proofs of Imperative Programs. Formal Aspects Comput. 9(5-6): 448-468 (1997) - 1996
- [j16]Wim H. Hesselink:
Bounded Delay for a Free Address. Acta Informatica 33(3): 233-254 (1996) - 1995
- [j15]Wim H. Hesselink:
Wait-Free Linearization with a Mechanical Proof. Distributed Comput. 9(1): 21-36 (1995) - [j14]Wim H. Hesselink:
Safety and Progress of Recursive Procedures. Formal Aspects Comput. 7(4): 389-411 (1995) - [c4]Wim H. Hesselink:
Angelic Termination in Dijkstra's Calculus. MPC 1995: 322-334 - 1994
- [j13]Wim H. Hesselink:
Wait-Free Linearization with an Assertional Proof. Distributed Comput. 8(2): 65-80 (1994) - [j12]Wim H. Hesselink:
Nondeterminacy and Recursion via Stacks and Games. Theor. Comput. Sci. 124(2): 273-295 (1994) - [c3]Wim H. Hesselink:
Compact Image Representation using Gabor Wavelets. EUROSIM 1994: 863-870 - 1993
- [j11]Wim H. Hesselink:
Proof Rules for Recursive Procedures. Formal Aspects Comput. 5(6): 554-570 (1993) - 1992
- [j10]Wim H. Hesselink:
LR-Parsing Derived. Sci. Comput. Program. 19(2): 171-196 (1992) - [j9]Wim H. Hesselink:
Processes and Formalism for Unbounded Choice. Theor. Comput. Sci. 99(1): 105-119 (1992) - [c2]Wim H. Hesselink, Ronald Reinds:
Temporal Preconditions of Recursive Procedures. REX Workshop 1992: 236-260 - 1991
- [j8]Coenraad Bron, Wim H. Hesselink:
Smoothsort Revisited. Inf. Process. Lett. 39(5): 269-276 (1991) - [j7]Wim H. Hesselink:
Repetitions, Known or Unknown? Inf. Process. Lett. 40(1): 51-57 (1991) - 1990
- [j6]Wim H. Hesselink:
Command Algebras, Recursion and Program Transformation. Formal Aspects Comput. 2(1): 60-104 (1990) - [j5]Wim H. Hesselink:
Axioms and Models of Linear Logic. Formal Aspects Comput. 2(2): 139-166 (1990)
1980 – 1989
- 1989
- [j4]Wim H. Hesselink:
Predicate-Transformer Semantics of General Recursion. Acta Informatica 26(4): 309-332 (1989) - [c1]Wim H. Hesselink:
Initialisation with a Final Value, an Exercise in Program Transformation. MPC 1989: 273-280 - 1988
- [j3]Wim H. Hesselink:
Interpretations of Recursion under Unbounded Nondeterminacy. Theor. Comput. Sci. 59: 211-234 (1988) - [j2]Wim H. Hesselink:
Deadlock and Fairness in Morphisms of Transition Systems. Theor. Comput. Sci. 59: 235-257 (1988) - [j1]Wim H. Hesselink:
A Mathematical Approach to Nondeterminism in Data Types. ACM Trans. Program. Lang. Syst. 10(1): 87-117 (1988)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-23 19:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: