| 2009 |
|---|
| 58 | EE | Alex A. Aravind,
Wim H. Hesselink:
A queue based mutual exclusion algorithm.
Acta Inf. 46(1): 73-86 (2009) |
| 2008 |
|---|
| 57 | EE | Wim H. Hesselink:
Simulation Refinement for Concurrency Verification.
Electr. Notes Theor. Comput. Sci. 214: 3-23 (2008) |
| 56 | EE | Wim H. Hesselink:
Universal extensions to simulate specifications.
Inf. Comput. 206(1): 108-128 (2008) |
| 55 | EE | Wim H. Hesselink:
A challenge for atomicity verification.
Sci. Comput. Program. 71(1): 57-72 (2008) |
| 2007 |
|---|
| 54 | EE | Wim H. Hesselink:
A criterion for atomicity revisited.
Acta Inf. 44(2): 123-151 (2007) |
| 53 | EE | 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) |
| 52 | EE | Hui Gao,
Wim H. Hesselink:
A general lock-free algorithm using compare-and-swap.
Inf. Comput. 205(2): 225-241 (2007) |
| 51 | EE | Wim H. Hesselink:
A linear-time algorithm for Euclidean feature transform sets.
Inf. Process. Lett. 102(5): 181-186 (2007) |
| 50 | EE | Hui Gao,
Jan Friso Groote,
Wim H. Hesselink:
Lock-free parallel and concurrent garbage collection by mark&sweep.
Sci. Comput. Program. 64(3): 341-374 (2007) |
| 2006 |
|---|
| 49 | EE | Wim H. Hesselink:
Splitting forward simulations to copewith liveness.
Acta Inf. 42(8-9): 583-602 (2006) |
| 48 | EE | Wim H. Hesselink:
Refinement verification of the lazy caching algorithm.
Acta Inf. 43(3): 195-222 (2006) |
| 2005 |
|---|
| 47 | | Hendrik Wietze de Haan,
Wim H. Hesselink,
Gerben Meyer,
Gerard R. Renardel de Lavalette:
Experiments with strategies for agents in the social interaction game Mafia.
BNAIC 2005: 89-95 |
| 46 | EE | Hui Gao,
Jan Friso Groote,
Wim H. Hesselink:
Lock-Free Parallel Garbage Collection.
ISPA 2005: 263-274 |
| 45 | EE | Wim H. Hesselink:
Eternity variables to prove simulation of specifications.
ACM Trans. Comput. Log. 6(1): 175-201 (2005) |
| 44 | EE | Hui Gao,
Jan Friso Groote,
Wim H. Hesselink:
Lock-free dynamic hash tables with open addressing.
Distributed Computing 18(1): 21-42 (2005) |
| 2004 |
|---|
| 43 | EE | Hui Gao,
Wim H. Hesselink:
A Formal Reduction for Lock-Free Parallel Algorithms.
CAV 2004: 44-56 |
| 42 | EE | Hui Gao,
Jan Friso Groote,
Wim H. Hesselink:
Almost Wait-Free Resizable Hashtable.
IPDPS 2004 |
| 41 | EE | Wim H. Hesselink:
An assertional proof for a construction of an atomic variable.
Formal Asp. Comput. 16(4): 387-393 (2004) |
| 40 | EE | Hendrik Wietze de Haan,
Wim H. Hesselink,
Gerard R. Renardel de Lavalette:
Knowledge-Based Asynchronous Programming.
Fundam. Inform. 63(2-3): 259-281 (2004) |
| 39 | EE | Wim H. Hesselink:
Using eternity variables to specify and prove a serializable database interface.
Sci. Comput. Program. 51(1-2): 47-85 (2004) |
| 2003 |
|---|
| 38 | EE | Wim H. Hesselink:
Preference rankings in the face of uncertainty.
Acta Inf. 39(3): 211-231 (2003) |
| 37 | EE | Hui Gao,
Jan Friso Groote,
Wim H. Hesselink:
Efficient almost wait-free parallel accessible dynamic hashtables
CoRR cs.DC/0303011: (2003) |
| 36 | EE | Wim H. Hesselink:
Salembier's Min-tree algorithm turned into breadth first search.
Inf. Process. Lett. 88(5): 225-229 (2003) |
| 2002 |
|---|
| 35 | EE | Wim H. Hesselink:
Eternity Variables to Simulate Specifications.
MPC 2002: 117-130 |
| 34 | EE | Wim H. Hesselink:
An assertional criterion for atomicity.
Acta Inf. 38(5): 343-366 (2002) |
| 33 | EE | Wim H. Hesselink:
Eternity variables to prove simulation of specifications
CoRR cs.DC/0207095: (2002) |
| 2001 |
|---|
| 32 | EE | Wim H. Hesselink,
Jan Friso Groote:
Wait-free concurrent memory management by Create and Read until Deletion (CaRuD).
Distributed Computing 14(1): 31-39 (2001) |
| 31 | EE | Jan Friso Groote,
Wim H. Hesselink,
Sjouke Mauw,
Rogier Vermeulen:
An algorithm for the asynchronous Write-All problem based on process collision.
Distributed Computing 14(2): 75-81 (2001) |
| 30 | | Wim H. Hesselink,
Arnold Meijster,
Coenraad Bron:
Concurrent determination of connected components.
Sci. Comput. Program. 41(2): 173-194 (2001) |
| 2000 |
|---|
| 29 | EE | Wim H. Hesselink,
Albert Thijs:
Fixpoint semantics and simulation.
Theor. Comput. Sci. 238(1-2): 275-311 (2000) |
| 28 | EE | Wim H. Hesselink:
A generalization of Naundorf's fixpoint theorem.
Theor. Comput. Sci. 247(1-2): 291-296 (2000) |
| 1999 |
|---|
| 27 | EE | Wim H. Hesselink:
Progress Under Bounded Fairness.
Distributed Computing 12(4): 197-207 (1999) |
| 26 | EE | Wim H. Hesselink:
The Verified Incremental Design of a Distributed Spanning Tree Algorithm: Extended Abstract.
Formal Asp. Comput. 11(1): 45-55 (1999) |
| 25 | EE | Wim H. Hesselink:
Predicate Transformers for Recursive Procedures with Local Variables.
Formal Asp. Comput. 11(6): 616-636 (1999) |
| 1998 |
|---|
| 24 | | Wim H. Hesselink:
The design of a linearization of a concurrent data object.
PROCOMET 1998: 205-224 |
| 23 | EE | Wim H. Hesselink:
Invariants for the Construction of a Handshake Register.
Inf. Process. Lett. 68(4): 173-177 (1998) |
| 1997 |
|---|
| 22 | | Wim H. Hesselink:
A Mechanical Proof of Segall's PIF Algorithm.
Formal Asp. Comput. 9(2): 208-226 (1997) |
| 21 | | Wim H. Hesselink:
Theories for Mechanical Proofs of Imperative Programs.
Formal Asp. Comput. 9(5-6): 448-468 (1997) |
| 1996 |
|---|
| 20 | | Wim H. Hesselink:
Bounded Delay for a Free Address.
Acta Inf. 33(3): 233-254 (1996) |
| 1995 |
|---|
| 19 | | Wim H. Hesselink:
Angelic Termination in Dijkstra`s Calculus.
MPC 1995: 322-334 |
| 18 | | Wim H. Hesselink:
Wait-Free Linearization with a Mechanical Proof.
Distributed Computing 9(1): 21-36 (1995) |
| 17 | | Wim H. Hesselink:
Safety and Progress of Recursive Procedures.
Formal Asp. Comput. 7(4): 389-411 (1995) |
| 1994 |
|---|
| 16 | | Wim H. Hesselink:
Compact Image Representation using Gabor Wavelets.
EUROSIM 1994: 863-870 |
| 15 | | Wim H. Hesselink:
Wait-Free Linearization with an Assertional Proof.
Distributed Computing 8(2): 65-80 (1994) |
| 14 | | Wim H. Hesselink:
Proof Rules for Recursive Procedures.
Formal Asp. Comput. 5(6): 554-570 (1994) |
| 13 | | Wim H. Hesselink:
Nondeterminacy and Recursion via Stacks and Games.
Theor. Comput. Sci. 124(2): 273-295 (1994) |
| 1992 |
|---|
| 12 | | Wim H. Hesselink,
Ronald Reinds:
Temporal Preconditions of Recursive Procedures.
REX Workshop 1992: 236-260 |
| 11 | | Wim H. Hesselink:
LR-Parsing Derived.
Sci. Comput. Program. 19(2): 171-196 (1992) |
| 10 | | Wim H. Hesselink:
Processes and Formalism for Unbounded Choice.
Theor. Comput. Sci. 99(1): 105-119 (1992) |
| 1991 |
|---|
| 9 | | Coenraad Bron,
Wim H. Hesselink:
Smoothsort Revisited.
Inf. Process. Lett. 39(5): 269-276 (1991) |
| 8 | | Wim H. Hesselink:
Repetitions, Known or Unknown?
Inf. Process. Lett. 40(1): 51-57 (1991) |
| 1990 |
|---|
| 7 | | Wim H. Hesselink:
Command Algebras, Recursion and Program Transformation.
Formal Asp. Comput. 2(1): 60-104 (1990) |
| 6 | | Wim H. Hesselink:
Axioms and Models of Linear Logic.
Formal Asp. Comput. 2(2): 139-166 (1990) |
| 1989 |
|---|
| 5 | | Wim H. Hesselink:
Initialisation with a Final Value, an Exercise in Program Transformation.
MPC 1989: 273-280 |
| 4 | | Wim H. Hesselink:
Predicate-Transformer Semantics of General Recursion.
Acta Inf. 26(4): 309-332 (1989) |
| 1988 |
|---|
| 3 | EE | Wim H. Hesselink:
A Mathematical Approach to Nondeterminism in Data Types.
ACM Trans. Program. Lang. Syst. 10(1): 87-117 (1988) |
| 2 | | Wim H. Hesselink:
Interpretations of Recursion under Unbounded Nondeterminacy.
Theor. Comput. Sci. 59: 211-234 (1988) |
| 1 | | Wim H. Hesselink:
Deadlock and Fairness in Morphisms of Transition Systems.
Theor. Comput. Sci. 59: 235-257 (1988) |
