Scientific Publications

Google scholar profile

Book and booklet

• W. H. Hesselink: Programs, Recursion and Unbounded Choice. Cambridge Tracts in Theoretical Computer Science 27. Cambridge University Press 1992. ISBN 0521 404363.
• W. H. Hesselink: Specificatie van Berekening (Inaugural address, in Dutch). University of Groningen, 4 April 1995.

Links to other publications

• Computing Science Publications 1988 - 2002
• Mathematical Publications 1975 - 1987
• Some Unpublished Manuscripts

Publications from 2003

Many of the papers below, if not directly on the web, are available electronically on request by e-mail to me.

• W. H. Hesselink, P. A. Buhr, and C. A. Parsons: First-come-first-served as a separate principle. Transactions on Parallel Computing 11 (4), 16 (2024)
• W. H. Hesselink, P. A. Buhr: MCSH, a lock with the standard interface. Transactions on Parallel Computing 10 (2), 11 (2023)
• W. H. Hesselink: Trylock, a case for temporal logic and eternity variables. Science of Computer Programming 216 (2022) 102767
• W.H. Hesselink: UNITY and Buechi automata. Formal Aspects of Computing 33 (2021) 185-205
• W.H. Hesselink: The nullcone of the Lie algebra of G2. Indagationes Mathematicae 30 (2019) 623-648
• A.A. Aravind, W.H. Hesselink: Group mutual exclusion by fetch-and-increment. ACM Transactions on Parallel Computing 5 (4), 14 (2019)
• J. J. van de Gronde and W.H. Hesselink: Conditionally complete sponges: new results on generalized lattices. Indagationes Mathematicae 30 (2019) 265-287
• P.A. Buhr, D. Dice, and W.H. Hesselink: High-contention mutual exclusion by elevator algorithms. Concurrency and Computation: Practice and Experience 30 (18) 2018.
• W.H. Hesselink: The quartet spaces of G. 't Hooft. Indagationes Mathematicae 29 (2), 628-632 (2018)
• W.H. Hesselink, P.A. Buhr, and D. Dice: Fast mutual exclusion by the Triangle algorithm. Concurrency and Computation: Practice and Experience 30 (4) 2018.
• W.H. Hesselink: Tournaments for mutual exclusion: verification and concurrent complexity. Formal Aspects of Computing 29 (2017), 833-852
• W.H. Hesselink: Correctness and concurrent complexity of the Black-White Bakery Algorithm. Formal Aspects of Computing 28 (2016), 325-341.
• P.A. Buhr, D. Dice, and W.H. Hesselink: Dekker's mutual exclusion algorithm made RW-safe. Concurrency and Computation: Practice and Experience 28 (2016), 144-165.
• W.H. Hesselink: Mutual exclusion by four shared bits with not more than quadratic complexity. Science of Computer Programming 102 (2015) 57-75.
• P.A. Buhr, D. Dice, and W.H. Hesselink: High-performance N-thread software solutions for mutual exclusion. Concurrency and Computation: Practice and Experience 27 (2015), 651-701.
• W.H. Hesselink: A distributed resource allocation algorithm for many processes. Acta Informatica 50 (2013) 297-329. DOI: 10.1007/s00236-013-0181-7. The final publication is available at link.springer.com.
• W.H. Hesselink: Mechanical verification of Lamport's Bakery algorithm. Science of Computer Programming 78 (2013) 1622-1638. DOI: 10.1016/j.scico.2013.03.003.
• W.H. Hesselink: Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos. Acta Informatica 50 (3) (2013) 199-228. The final publication is available at link.springer.com.
• W.H. Hesselink: Complete assertional proof rules for progress under weak and strong fairness. Science of Computer Programming 78 (2013) 1521-1537.
• W.H. Hesselink: Graph theory for alternating hydrocarbons with attached ports. Indagationes Mathematicae 24 (2013) 115-141.
• W.H. Hesselink, M. IJbema: Starvation-free mutual exclusion with semaphores. Formal Aspects of Computing 25, issue 6 (2013) 947-969. DOI: 10.1007/s00165-011-0219-y.
• W.H. Hesselink, G.R. Renardel de Lavalette: Finite and infinite implementation of transition systems. Theoretical Computer Science 458 (2012) 131-135.
• W.H. Hesselink, M.I. Lali: Formalizing a hierarchical file system. Formal Aspects of Computing 24 (2012) 27-44. DOI: 10.1007/s00165-010-0171-2.
• W.H. Hesselink: Maximal segments of bounded variation and bounded descent. In: Liber Amicorum Jan van Leeuwen, Utrecht, 20 December 2011, p. 21-26.
• A.A. Aravind, W.H. Hesselink: Nonatomic dual Bakery algorithm with bounded tokens. Acta Informatica 48 (2011) 67-96.
• W.H. Hesselink, A.A. Aravind: Queue based mutual exclusion with linearly bounded overtaking. Science of Computer Programming 76 (2011) 542-554.
• W. H. Hesselink: Simulation refinement for concurrency verification. Science of Computer Programming 76 (2011) 739-755. DOI: 10.1016/j.scico.2009.09.006.
• W.H. Hesselink: Alternating states for dual nondeterminism in imperative programming. Theoretical Computer Science 411 (2010) 2317-2330 (preprint).
• W.H. Hesselink: Solutions of equations in languages. Formal Aspects of Computing 22 (2010) 537-545. DOI: 10.1007/s00165-009-0123-x.
• W.H. Hesselink and M.I. Lali: Simple concurrent garbage collection almost without synchronization. Formal Methods in System Design 36 (2010) 148-166.
• W.H. Hesselink, M.I. Lali: Formalizing a hierarchical file system. Electronic Notes in Theoretical Computer Science 259 (2009) 67-85, Proceedings of the 14th BCS-FACS Refinement Workshop (REFINE 2009). DOI: 10.1016/j.entcs.2009.12.018.
• Hui Gao, Yan Fu, Wim H. Hesselink: Practical lock-free implementation of LL/SC using only pointer-size CAS. Proceedings ICISE, pp.320-323, 2009 First International Conference on Information Science and Engineering, 2009.
• Hui Gao, Yan Fu, Wim H. Hesselink: Verification of a lock-free implementation of multiword LL/SC object Proceedings DASC, pp.31-36, 2009 Eighth IEEE International Conference on Dependable, Autonomic and Secure Computing, 2009.
• A.A. Aravind, W.H. Hesselink: A queue based mutual exclusion algorithm. Acta Informatica 46 (2009) 73-86.
• W. H. Hesselink: Simulation refinement for concurrency verification. Electronic Notes in Theoretical Computer Science 214 (2008) 3-23. Proceedings of the 13th BAC-FACS Refinement Workshop (REFINE 2008).
• W. H. Hesselink: A challenge for atomicity verification. Science of Computer Programming 71 (2008) 57-72.
• M. H. F. Wilkinson, H. Gao, W. H. Hesselink, J.-E. Jonker, A. Meijster: Concurrent computation of attribute filters on shared memory parallel machines. IEEE Trans. Pattern Anal. Machine Intell. 30 (2008) 1800-1813. PDF preprint(364 kB) available.
• W. H. Hesselink, J. B. T. M. Roerdink: Euclidean skeletons of digital image and volume data in linear time by integer medial axis transform. IEEE Trans. Pattern Anal. Machine Intell. 30 (2008) 2204-2217. Some code is available.
• W. H. Hesselink: Universal extensions to simulate specifications. Information and Computation 206 (2008) 108-128.
• H. W. de Haan, W. H. Hesselink, G. R. Renardel de Lavalette, M. Ijbema: Using belief revision in intelligent agents. Proceedings of the 19th Belgium-Netherlands Conference on Artificial Intelligence (BNAIC 2007), pp. 158-164.
• W.H. Hesselink, J.C. Hummelen, H.T. Jonkman, H.G. Reker, G.R. Renardel de Lavalette, M.H. van der Veen: Kekulé Cells for Molecular Computation. April 2007 (24 pages).
• W. H. Hesselink: A criterion for atomicity revisited. Acta Informatica 44 (2007) 123-151.
• W. H. Hesselink: A linear-time algorithm for Euclidean feature transform sets. Information Processing Letters 102 (2007) 181-186.
• H. Gao, W. H. Hesselink: A general lock-free algorithm using compare-and-swap. Information and Computation 205 (2007) 225-241.
• H. Gao, J. F. Groote, W. H. Hesselink: Lock-free parallel and concurrent garbage collection by mark&sweep. Science of Computer Programming 64 (2007) 341-374.
• W. H. Hesselink: Refinement verification of the lazy caching algorithm. Acta Informatica 43 (2006) 195-222.
• W. H. Hesselink: Splitting forward simulations to cope with liveness. Acta Informatica 42 (2006) 583-602.
• Gao H., Groote J. F., Hesselink W. H.: Lock-free parallel garbage collection. In Pan, Y.; Chen, D.; Guo, M.; Cao, J.; Dongarra, J. (Eds.) : Proceedings of Third International Symposium on Parallel and Distributed Processing and Applications (ISPA'05), Nanjing, China, LNCS 3758, pp. 263-274, 2005.
• H. W. de Haan, W. H. Hesselink, G. Meyer, G. R. Renardel de Lavalette: Experiments with strategies for agents in the social interaction game Mafia. In: K. Verbeek, K. Tuyls, A. Nowe, B. Manderick, B. Kuijpers (eds.): Proceedings of the 17th Belgium-Netherlands Conference on Artificial Intelligence (BNAIC 2005), pp. 89-95.
• W. H. Hesselink, M. Visser, J. B. T. M. Roerdink: Euclidean skeletons of 3D data sets in linear time by the integer medial axis transform. In Mathematical Morphology: 40 Years On (Proc. 7th Intern. Symp. on Mathematical Morphology, April 2005), pages 259-268. Springer V. 2005.
• Gao H., Groote J. F., Hesselink W. H.: Lock-free dynamic hash tables with open addressing. Distributed Computing 17 (2005) 21-42
• W. H. Hesselink: Eternity variables to prove simulation of specifications. ACM Trans. on Computational Logic 6 (2005) 175-201. See also the PVS-proof.
• W. H. Hesselink: An assertional proof for a construction of an atomic variable. Formal Aspects of Computing 16 (2004) 387-393
• H.W. de Haan, W. H. Hesselink, G.R. Renardel de Lavalette: Knowledge-based asynchronous programming. Fundamenta Informatica 63 (2004) 259-281
• H. W. de Haan, W. H. Hesselink, G. R. Renardel de Lavalette: An abstract multi-agent framework applied to a social interaction game. In: R. Verbrugge, N. Taatgen, L. Schomaker (eds.): Proceedings of the 16th Belgium-Netherlands Conference on Artificial Intelligence (BNAIC 2004), pp. 259-267, October 2004.
• H. Gao and W. H. Hesselink: A formal reduction for lock-free parallel algorithms. In R. Alur, D.A. Peled (eds.): Computer Aided Verification, 16th International Conference, CAV 2004. Springer V. (LNCS 3114), p. 44-57.
• Gao H., Groote J. F., Hesselink W. H.: Almost wait-free resizable hashtables (extended abstract). 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), electronic proceedings IEEE 2004, section 13. See also the mechanical verification.
• W. H. Hesselink: Using eternity variables to specify and prove a serializable database interface, Science of Computer Programming 51 (2004) 47-85. See also the NQTHM-proof.
• W. H. Hesselink: Salembier's min-tree algorithm turned into breadth first search. Information Processing Letters 88 (2003) 225-229.
• H. W. de Haan, W. H. Hesselink, G. R. Renardel de Lavalette: Knowledge-based programming inspired by an asynchronous hardware leader election problem. In: B. Dunin-Keplicz, R. Verbrugge (eds.): FAMAS'03, ETAPS 2003, Warsaw, Poland. pp. 117-132
• W. H. Hesselink: Preference rankings in the face of uncertainty. Acta Informatica 39 (2003) 211-231

Comments and questions are welcome.
Back to my home page.
Wim H. Hesselink