Computer Science Publications 1988 - 2002

• G. R. Renardel de Lavalette, W. H. Hesselink: Reduction steps in partitions. Liber Amicorum Jaco de Bakker. CWI, Amsterdam, August 2002, pp. 175-178
• W. H. Hesselink: Predestination and invariants of specifications. Liber Amicorum Jaco de Bakker. CWI, Amsterdam, August 2002, pp. 111-116
• W. H. Hesselink: Eternity Variables to Simulate Specifications. In: E. A. Boiten, B. Moeller (eds.): Proceedings Mathematics of Program Construction, Dagstuhl, 2002 ( LNCS 2386), pp. 117-130. Corrected version, June 20, 2002 (16 pages)
• W. H. Hesselink: An Assertional Criterion for Atomicity. Acta Informatica 38 (2002) 343-366
• W.H. Hesselink, J.F. Groote: Waitfree concurrent memory management by Create, and Read until Deletion (CaRuD). Distributed Computing 14 (2001) 31--39
• J.F. Groote, W.H. Hesselink, S. Mauw, R. Vermeulen: An algorithm for the asynchronous Write-All problem based on process collision. Distributed Computing 14 (2001) 75--81
• W.H. Hesselink, A. Meijster, C. Bron: Concurrent Determination of Connected Components. Science of Computer Programming 41 (2001) 173--194
• W.H. Hesselink, A. Thijs: Fixpoint semantics and simulation. Theoretical Computer Science 238 (2000) 275-311.
• A. Meijster, J.B.T.M. Roerdink, W.H. Hesselink: A general algorithm for computing distance transforms in linear time. In: J. Goutsias, L. Vincent, D.S. Bloomberg (eds.): Mathematical morphology and its applications to image and signal processing (Proc. 5th Int. Conf.), Kluwer, 2000. Pages 331-340.
• W.H. Hesselink: A generalization of Naundorf's fixpoint theorem. Theoretical Computer Science 247 (2000) 291-296.
• W.H. Hesselink: The verified incremental design of a distributed spanning tree algorithm: extended abstract. Formal Aspects of Computing 11 (1999) 45-55
• W.H. Hesselink: The verified incremental design of a distributed spanning tree algorithm. This full paper can be found as Supplementary Material at the page of the extended abstract.
• W.H. Hesselink: Progress under bounded fairness. Distributed Computing 12 (1999) 197-207.
• W.H. Hesselink: Predicate transformers for recursive procedures with local variables. Formal Aspects of Computing 11 (1999) 616--636.
• W.H. Hesselink: The design of a linearization of a concurrent data object. In: D. Gries, W.-P. de Roever (eds.): Programming Concepts and Methods, Proceedings PROCOMET '98, Chapman & Hall, IFIP 1998, pp. 205-224.
• W.H. Hesselink: Invariants for the construction of a handshake register. Information Processing Letters 68 (1998) 173-177.
• W.H. Hesselink: A mechanical proof of Segall's PIF algorithm. Formal Aspects of Computing 9 (1997) 208-226.
• W.H. Hesselink: Theories for mechanical proofs of imperative programs. Formal Aspects of Computing 9 (1997) 448-468.
• W.H. Hesselink: Bounded Delay for a Free Address. Acta Informatica 33 (1996) 233-254.
• W.H. Hesselink: Specificatie van Berekening (Inaugural address, in Dutch). University of Groningen, 4 April 1995.
• W.H. Hesselink: Angelic termination in Dijkstra's calculus. In: B. Moeller (ed.): Mathematics of Program Construction, Proceedings Kloster Irsee, 1995. Springer Verlag (LNCS 947), 1995, pp. 322-334.
• W.H. Hesselink: Safety and progress of recursive procedures. Formal Aspects of Computing 7 (1995) 389-411.
• W.H. Hesselink: Wait-free linearization with a mechanical proof. Distr. Comput. 9 (1995) 21-36.
• W.H. Hesselink: Nondeterminacy and recursion via stacks and games. Theoretical Computer Science 124 (1994) 273-295.
• W.H. Hesselink: Wait-free linearization with an assertional proof. Distributed Computing 8 (1994) 65-80.
• W.H. Hesselink: NQTHM proving sequential programs. Computing Science Reports Groningen CS-R9407.
• W.H. Hesselink, R. Reinds: Temporal preconditions of recursive procedures. In: J.W. de Bakker, W.-P. de Roever, G. Rozenberg (eds.): Semantics: Foundations and Applications. Proceedings of REX Workshop Beekbergen 1992. Springer V. 1993 (LNCS 666), pp. 236-260.
• W.H. Hesselink: Proof rules for recursive procedures. Formal Aspects of Computing 5 (1993) 554-570.
• W.H. Hesselink: Processes and formalisms for unbounded choice. Theoretical Computer Science 99 (1992) 105-119.
• 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: LR-parsing derived. Science of Computer Programming 19 (1992) 171-196.
• W.H. Hesselink, J.H. Jongejan: Duplicate deletion derived. Comm. ACM 35 (1992) 99-103, 107.
• D.C. Hoogvorst, W.H. Hesselink: Logically synchronous multicasts. In: J.L.G. Dietz (ed.): Proceedings CSN'92, pp. 132-142. SMC Amsterdam 1992.
• W.H. Hesselink: Procedures: specification and recursion. In: W.H.J. Feijen, A.J.M. van Gasteren (eds.): C.S. Scholten Dedicata: van oude machines en nieuwe rekenwijzen. Academic Service 1991.
• C. Bron, W.H. Hesselink: Smoothsort revisited. Information Processing Letters 39 (1991) 269-276.
• W.H. Hesselink: Repetitions, known or unknown? Information Processing Letters 40 (1991) 51-57.
• W.H. Hesselink: Command algebras, recursion and program transformation. Formal Aspects of Computing 2 (1990) 60-104.
• W.H. Hesselink: Modalities of nondeterminacy. In: W.H.J. Feijen et al. (eds.): Beauty is our business, a birthday salute to Edsger W. Dijkstra. Springer V. 1990, pp. 182-192.
• W.H. Hesselink: Axioms and models of linear logic. Formal Aspects of Computing 2 (1990) 139-166.
• W.H. Hesselink: Predicate transformer semantics of general recursion. Acta Informatica 26 (1989) 309-332.
• W.H. Hesselink: The induction rule of De Bakker and Scott. In: J.W. de Bakker, 25 jaar Semantiek, Liber Amicorum, p. 261-264. CWI, april 1989.
• W.H. Hesselink: Initialisation with a final value, an exercise in program transformation. In: J.L.A. van de Snepscheut (ed.): Mathematics of Program Construction, Proceedings, June 1989. Springer V. LNCS 375, p. 273-280.
• W.H. Hesselink: A mathematical approach to nondeterminism in data types. ACM Transactions on Programming Languages and Systems 10 (1988) 87-117.
• W.H. Hesselink: Interpretations of recursion under unbounded nondeterminacy. Theoretical Computer Science 59 (1988) 211-234.
• W.H. Hesselink: Deadlock and fairness in morphisms of transition systems. Theoretical Computer Science 59 (1988) 235-257.