The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Koen Claessen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Koen Claessen, Colin Runciman, Olaf Chitil, John Hughes, Malcolm Wallace
    Testing and Tracing Lazy Functional Programs Using QuickCheck and Hat. [Citation Graph (0, 0)][DBLP]
    Advanced Functional Programming, 2002, pp:59-99 [Conf]
  2. Koen Claessen, David Sands
    Observable Sharing for Functional Circuit Description. [Citation Graph (0, 0)][DBLP]
    ASIAN, 1999, pp:62-73 [Conf]
  3. Geoff Sutcliffe, Stephan Schulz, Koen Claessen, Allen Van Gelder
    Using the TPTP Language for Writing Derivations and Finite Interpretations. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:67-81 [Conf]
  4. Jan-Willem Roorda, Koen Claessen
    SAT-Based Assistance in Abstraction Refinement for Symbolic Trajectory Evaluation. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:175-189 [Conf]
  5. Emil Axelsson, Koen Claessen, Mary Sheeran
    Wired: Wire-Aware Circuit Design. [Citation Graph (0, 0)][DBLP]
    CHARME, 2005, pp:5-19 [Conf]
  6. Koen Claessen, Mary Sheeran, Satnam Singh
    The Design and Verification of a Sorter Core. [Citation Graph (0, 0)][DBLP]
    CHARME, 2001, pp:355-369 [Conf]
  7. Jan-Willem Roorda, Koen Claessen
    A New SAT-Based Algorithm for Symbolic Trajectory Evaluation. [Citation Graph (0, 0)][DBLP]
    CHARME, 2005, pp:238-253 [Conf]
  8. Jan-Willem Roorda, Koen Claessen
    Explaining Symbolic Trajectory Evaluation by Giving It a Faithful Semantics. [Citation Graph (0, 0)][DBLP]
    CSR, 2006, pp:555-566 [Conf]
  9. Koen Claessen, Hans Svensson
    A semantics for distributed Erlang. [Citation Graph (0, 0)][DBLP]
    Erlang Workshop, 2005, pp:78-87 [Conf]
  10. Thomas Arts, Koen Claessen, Hans Svensson
    Semi-formal Development of a Fault-Tolerant Leader Election Protocol in Erlang. [Citation Graph (0, 0)][DBLP]
    FATES, 2004, pp:140-154 [Conf]
  11. Per Bjesse, Koen Claessen
    SAT-Based Verification without State Space Traversal. [Citation Graph (0, 0)][DBLP]
    FMCAD, 2000, pp:372-389 [Conf]
  12. Koen Claessen, Johan Mårtensson
    An Operational Semantics for Weak PSL. [Citation Graph (0, 0)][DBLP]
    FMCAD, 2004, pp:337-351 [Conf]
  13. Per Bjesse, Koen Claessen, Mary Sheeran, Satnam Singh
    Lava: Hardware Design in Haskell. [Citation Graph (0, 0)][DBLP]
    ICFP, 1998, pp:174-184 [Conf]
  14. Koen Claessen
    Graphs in Compilation. [Citation Graph (0, 0)][DBLP]
    ICFP, 1997, pp:309- [Conf]
  15. Koen Claessen, John Hughes
    QuickCheck: a lightweight tool for random testing of Haskell programs. [Citation Graph (0, 0)][DBLP]
    ICFP, 2000, pp:268-279 [Conf]
  16. Koen Claessen, Ton Vullinghs, Erik Meijer
    Structuring Graphical Paradigms in TkGofer. [Citation Graph (0, 0)][DBLP]
    ICFP, 1997, pp:251-262 [Conf]
  17. Koen Claessen, Peter Ljunglöf
    Typed Logical Variables in Haskell. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2000, v:41, n:1, pp:- [Journal]
  18. Koen Claessen
    Parallel Parsing Processes. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2004, v:14, n:6, pp:741-757 [Journal]
  19. Koen Claessen
    A Poor Man's Concurrency Monad. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1999, v:9, n:3, pp:313-323 [Journal]
  20. Koen Claessen, John Hughes
    Testing monadic code with QuickCheck. [Citation Graph (0, 0)][DBLP]
    SIGPLAN Notices, 2002, v:37, n:12, pp:47-59 [Journal]
  21. Koen Claessen, Gordon J. Pace
    An embedded language approach to teaching hardware compilation. [Citation Graph (0, 0)][DBLP]
    SIGPLAN Notices, 2002, v:37, n:12, pp:35-46 [Journal]
  22. Koen Claessen, Mary Sheeran, Satnam Singh
    Using Lava to design and verify recursive and periodic sorters. [Citation Graph (0, 0)][DBLP]
    STTT, 2003, v:4, n:3, pp:349-358 [Journal]
  23. Koen Claessen, Jan-Willem Roorda
    An Introduction to Symbolic Trajectory Evaluation. [Citation Graph (0, 0)][DBLP]
    SFM, 2006, pp:56-77 [Conf]

  24. The Twilight Zone: From Testing to Formal Specifications and Back Again. [Citation Graph (, )][DBLP]


  25. Automated Inference of Finite Unsatisfiability. [Citation Graph (, )][DBLP]


  26. Testing Polymorphic Properties. [Citation Graph (, )][DBLP]


  27. A Coverage Analysis for Safety Property Lists. [Citation Graph (, )][DBLP]


  28. Finding race conditions in Erlang with QuickCheck and PULSE. [Citation Graph (, )][DBLP]


  29. Static contract checking for Haskell. [Citation Graph (, )][DBLP]


  30. Finding Counter Examples in Induction Proofs. [Citation Graph (, )][DBLP]


  31. QuickSpec: Guessing Formal Specifications Using Testing. [Citation Graph (, )][DBLP]


  32. A library for light-weight information-flow security in haskell. [Citation Graph (, )][DBLP]


  33. A Faithful Semantics for Generalised Symbolic Trajectory Evaluation [Citation Graph (, )][DBLP]


  34. Safety Property Verification of Cyclic Synchronous Circuits. [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