The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Wim H. Hesselink: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  55. A queue based mutual exclusion algorithm. [Citation Graph (, )][DBLP]


  56. Simulation Refinement for Concurrency Verification. [Citation Graph (, )][DBLP]


  57. Formalizing a Hierarchical File System. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002