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