Scientific Publications
Book and booklet
Links to other publications
Publications from 2003
Most of the papers below, if not directly on the web, are available
electronically on request.
- W.H. Hesselink:
Complete assertional proof rules for progress under weak
and strong fairness. Science of Computer Programming (in print, 2012).
- W.H. Hesselink: Graph Theory
for Alternating Hydrocarbons with Attached Ports. Indagationes
Mathematicae 24 (2013) 115-141.
- 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. IJbema:
Starvation-free mutual exclusion with semaphores.
Formal Aspects of Computing (in print, 2011).
DOI: 10.1007/s00165-011-0219-y.
- 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:
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.
Last modified: Thu Nov 29 11:06:28 CET 2012
Wim H. Hesselink,
e-mail: w.h.hesselink@rug.nl