| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Wim H. Hesselink, Muhammad Ikram Lali |
Formalizing a hierarchical file system.  |
Formal Asp. Comput.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Wim H. Hesselink |
A distributed resource allocation algorithm for many processes |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Wim H. Hesselink |
Simulation refinement for concurrency verification. |
Sci. Comput. Program. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Wim H. Hesselink, Alex A. Aravind |
Queue based mutual exclusion with linearly bounded overtaking. |
Sci. Comput. Program. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Alex A. Aravind, Wim H. Hesselink |
Nonatomic dual bakery algorithm with bounded tokens. |
Acta Inf. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Wim H. Hesselink |
Partial mutual exclusion for infinitely many processes |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Wim H. Hesselink |
Solutions of equations in languages. |
Formal Asp. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Wim H. Hesselink |
Alternating states for dual nondeterminism in imperative programming. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Wim H. Hesselink, Muhammad Ikram Lali |
Simple concurrent garbage collection almost without synchronization. |
Formal Methods in System Design |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Alex A. Aravind, Wim H. Hesselink |
A queue based mutual exclusion algorithm. |
Acta Inf. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Wim H. Hesselink, Muhammad Ikram Lali |
Formalizing a Hierarchical File System. |
Electr. Notes Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hui Gao, Yan Fu, Wim H. Hesselink |
Verification of a Lock-Free Implementation of Multiword LL/SC Object. |
DASC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Wim H. Hesselink |
A challenge for atomicity verification. |
Sci. Comput. Program. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael H. F. Wilkinson, Hui Gao, Wim H. Hesselink, Jan-Eppo Jonker, Arnold Meijster |
Concurrent Computation of Attribute Filters on Shared Memory Parallel Machines. |
IEEE Trans. Pattern Anal. Mach. Intell. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Wim H. Hesselink, Jos B. T. M. Roerdink |
Euclidean Skeletons of Digital Image and Volume Data in Linear Time by the Integer Medial Axis Transform. |
IEEE Trans. Pattern Anal. Mach. Intell. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Wim H. Hesselink |
Universal extensions to simulate specifications. |
Inf. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Wim H. Hesselink |
Simulation Refinement for Concurrency Verification. |
Electr. Notes Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Wim H. Hesselink |
A linear-time algorithm for Euclidean feature transform sets. |
Inf. Process. Lett. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Hui Gao, Jan Friso Groote, Wim H. Hesselink |
Lock-free parallel and concurrent garbage collection by mark&sweep. |
Sci. Comput. Program. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Wim H. Hesselink |
A criterion for atomicity revisited. |
Acta Inf. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Hui Gao, Wim H. Hesselink |
A general lock-free algorithm using compare-and-swap. |
Inf. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2007 |
DBLP BibTeX RDF |
|
| 1 | Wim H. Hesselink |
Refinement verification of the lazy caching algorithm. |
Acta Inf. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Wim H. Hesselink |
Splitting forward simulations to copewith liveness. |
Acta Inf. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Hui Gao, Jan Friso Groote, Wim H. Hesselink |
Lock-free dynamic hash tables with open addressing. |
Distributed Computing |
2005 |
DBLP DOI BibTeX RDF |
Distributed algorithms, Wait-free, Lock-free, Hash tables |
| 1 | Wim H. Hesselink |
Eternity variables to prove simulation of specifications. |
ACM Trans. Comput. Log. |
2005 |
DBLP DOI BibTeX RDF |
History variables, preservation of quiescence, prophecy variables, simulation, implementation, invariant, refinement mapping |
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Hui Gao, Jan Friso Groote, Wim H. Hesselink |
Lock-Free Parallel Garbage Collection. |
ISPA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Wim H. Hesselink |
An assertional proof for a construction of an atomic variable. |
Formal Asp. Comput. |
2004 |
DBLP DOI BibTeX RDF |
Invariant, Atomicity, Wait-free, Safeness |
| 1 | Wim H. Hesselink |
Using eternity variables to specify and prove a serializable database interface. |
Sci. Comput. Program. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Hendrik Wietze de Haan, Wim H. Hesselink, Gerard R. Renardel de Lavalette |
Knowledge-Based Asynchronous Programming. |
Fundam. Inform. |
2004 |
DBLP BibTeX RDF |
|
| 1 | Hui Gao, Jan Friso Groote, Wim H. Hesselink |
Almost Wait-Free Resizable Hashtable. |
IPDPS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Hui Gao, Wim H. Hesselink |
A Formal Reduction for Lock-Free Parallel Algorithms. |
CAV |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Wim H. Hesselink |
Salembier's Min-tree algorithm turned into breadth first search. |
Inf. Process. Lett. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Wim H. Hesselink |
Preference rankings in the face of uncertainty. |
Acta Inf. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Hui Gao, Jan Friso Groote, Wim H. Hesselink |
Efficient almost wait-free parallel accessible dynamic hashtables |
CoRR |
2003 |
DBLP BibTeX RDF |
|
| 1 | Wim H. Hesselink |
An assertional criterion for atomicity. |
Acta Inf. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Wim H. Hesselink |
Eternity variables to prove simulation of specifications |
CoRR |
2002 |
DBLP BibTeX RDF |
|
| 1 | Wim H. Hesselink |
Eternity Variables to Simulate Specifications. |
MPC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Wim H. Hesselink, Arnold Meijster, Coenraad Bron |
Concurrent determination of connected components. |
Sci. Comput. Program. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Friso Groote, Wim H. Hesselink, Sjouke Mauw, Rogier Vermeulen |
An algorithm for the asynchronous Write-All problem based on process collision. |
Distributed Computing |
2001 |
DBLP DOI BibTeX RDF |
Write-all problem, Distributed algorithms, Dynamic load balancing, PRAM, Wait-free, Work complexity |
| 1 | Wim H. Hesselink, Jan Friso Groote |
Wait-free concurrent memory management by Create and Read until Deletion (CaRuD). |
Distributed Computing |
2001 |
DBLP DOI BibTeX RDF |
Shared memory, Consensus, Wait-free, Reference counting, Concurrent garbage collection, Terms |
| 1 | Wim H. Hesselink, Albert Thijs |
Fixpoint semantics and simulation. |
Theor. Comput. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Wim H. Hesselink |
A generalization of Naundorf's fixpoint theorem. |
Theor. Comput. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Wim H. Hesselink |
Predicate Transformers for Recursive Procedures with Local Variables. |
Formal Asp. Comput. |
1999 |
DBLP DOI BibTeX RDF |
Frames, Predicate transformers, Proof rule, Recursive procedures |
| 1 | Wim H. Hesselink |
The Verified Incremental Design of a Distributed Spanning Tree Algorithm: Extended Abstract. |
Formal Asp. Comput. |
1999 |
DBLP DOI BibTeX RDF |
Message passing, Theorem proving, Minimum spanning tree, Asynchronous communication |
| 1 | Wim H. Hesselink |
Progress Under Bounded Fairness. |
Distributed Computing |
1999 |
DBLP DOI BibTeX RDF |
Bounded fairness, Concurrent data object, Fault tolerance, Memory management, Client server architecture |
| 1 | Wim H. Hesselink |
Invariants for the Construction of a Handshake Register. |
Inf. Process. Lett. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Wim H. Hesselink |
The design of a linearization of a concurrent data object. |
PROCOMET |
1998 |
DBLP BibTeX RDF |
|
| 1 | Wim H. Hesselink |
Theories for Mechanical Proofs of Imperative Programs. |
Formal Asp. Comput. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Wim H. Hesselink |
A Mechanical Proof of Segall's PIF Algorithm. |
Formal Asp. Comput. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Wim H. Hesselink |
Bounded Delay for a Free Address. |
Acta Inf. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Wim H. Hesselink |
Safety and Progress of Recursive Procedures. |
Formal Asp. Comput. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Wim H. Hesselink |
Wait-Free Linearization with a Mechanical Proof. |
Distributed Computing |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Wim H. Hesselink |
Angelic Termination in Dijkstra`s Calculus. |
MPC |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Wim H. Hesselink |
Proof Rules for Recursive Procedures. |
Formal Asp. Comput. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Wim H. Hesselink |
Nondeterminacy and Recursion via Stacks and Games. |
Theor. Comput. Sci. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Wim H. Hesselink |
Wait-Free Linearization with an Assertional Proof. |
Distributed Computing |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Wim H. Hesselink |
Compact Image Representation using Gabor Wavelets. |
EUROSIM |
1994 |
DBLP BibTeX RDF |
|
| 1 | Wim H. Hesselink |
LR-Parsing Derived. |
Sci. Comput. Program. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Wim H. Hesselink |
Processes and Formalism for Unbounded Choice. |
Theor. Comput. Sci. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Wim H. Hesselink, Ronald Reinds |
Temporal Preconditions of Recursive Procedures. |
REX Workshop |
1992 |
DBLP DOI BibTeX RDF |
leads-to, eventually, healthiness law, guarded recursion, unfolding, weakest precondition, recursive procedure |
| 1 | Coenraad Bron, Wim H. Hesselink |
Smoothsort Revisited. |
Inf. Process. Lett. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Wim H. Hesselink |
Repetitions, Known or Unknown? |
Inf. Process. Lett. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Wim H. Hesselink |
Axioms and Models of Linear Logic. |
Formal Asp. Comput. |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Wim H. Hesselink |
Command Algebras, Recursion and Program Transformation. |
Formal Asp. Comput. |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Wim H. Hesselink |
Predicate-Transformer Semantics of General Recursion. |
Acta Inf. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Wim H. Hesselink |
Initialisation with a Final Value, an Exercise in Program Transformation. |
MPC |
1989 |
DBLP BibTeX RDF |
|
| 1 | Wim H. Hesselink |
Interpretations of Recursion under Unbounded Nondeterminacy. |
Theor. Comput. Sci. |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Wim H. Hesselink |
Deadlock and Fairness in Morphisms of Transition Systems. |
Theor. Comput. Sci. |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Wim H. Hesselink |
A Mathematical Approach to Nondeterminism in Data Types. |
ACM Trans. Program. Lang. Syst. |
1988 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")