![]() | ![]() |
| 2012 | ||
|---|---|---|
| 47 | Koen Claessen, Nikhil Swamy: Proceedings of the sixth workshop on Programming Languages meets Program Verification, PLPV 2012, Philadelphia, PA, USA, January 24, 2012 ACM 2012 | |
| 46 | Koen Claessen, Mary Sheeran, Joel Svensson: Expressive array constructs in an embedded GPU kernel programming language. DAMP 2012: 21-30 | |
| 45 | Geoff Sutcliffe, Stephan Schulz, Koen Claessen, Peter Baumgartner: The TPTP Typed First-Order Form with Arithmetic. LPAR 2012: 406-419 | |
| 2011 | ||
| 44 | Koen Claessen: Proceedings of the 4th ACM SIGPLAN Symposium on Haskell, Haskell 2011, Tokyo, Japan, 22 September 2011 ACM 2011 | |
| 43 | Koen Claessen: The Anatomy of Equinox - An Extensible Automated Reasoning Tool for First-Order Logic and Beyond - (Talk Abstract). CADE 2011: 1-3 | |
| 42 | Koen Claessen, Ann Lillieström, Nicholas Smallbone: Sort It Out with Monotonicity - Translating between Many-Sorted and Unsorted First-Order Logic. CADE 2011: 207-221 | |
| 41 | Koen Claessen, Ann Lillieström: Automated Inference of Finite Unsatisfiability. J. Autom. Reasoning 47(2): 111-132 (2011) | |
| 2010 | ||
| 40 | Jean-Philippe Bernardy, Patrik Jansson, Koen Claessen: Testing Polymorphic Properties. ESOP 2010: 125-144 | |
| 39 | Emil Axelsson, Koen Claessen, Mary Sheeran, Josef Svenningsson, David Engdal, Anders Persson: The Design and Implementation of Feldspar - An Embedded Language for Digital Signal Processing. IFL 2010: 121-136 | |
| 38 | Jasmin Christian Blanchette, Koen Claessen: Generating Counterexamples for Structural Inductions by Exploiting Nonstandard Models. LPAR (Yogyakarta) 2010: 127-141 | |
| 37 | Emil Axelsson, Koen Claessen, Gergely Dévai, Zoltán Horváth, Karin Keijzer, Bo Lyckegård, Anders Persson, Mary Sheeran, Josef Svenningsson, András Vajda: Feldspar: A domain specific language for digital signal processing algorithms. MEMOCODE 2010: 169-178 | |
| 36 | Koen Claessen, Nicholas Smallbone, John Hughes: QuickSpec: Guessing Formal Specifications Using Testing. TAP 2010: 6-21 | |
| 35 | Joel Svensson, Koen Claessen, Mary Sheeran: GPGPU kernel implementation and refinement using Obsidian. Procedia CS 1(1): 2065-2074 (2010) | |
| 2009 | ||
| 34 | Koen Claessen: The Twilight Zone: From Testing to Formal Specifications and Back Again. APLAS 2009: 1 | |
| 33 | Koen Claessen, Ann Lillieström: Automated Inference of Finite Unsatisfiability. CADE 2009: 388-403 | |
| 32 | Koen Claessen, Michal Palka, Nicholas Smallbone, John Hughes, Hans Svensson, Thomas Arts, Ulf T. Wiger: Finding race conditions in Erlang with QuickCheck and PULSE. ICFP 2009: 149-160 | |
| 31 | Dana N. Xu, Simon L. Peyton Jones, Koen Claessen: Static contract checking for Haskell. POPL 2009: 41-52 | |
| 30 | Koen Claessen, Niklas Eén, Mary Sheeran, Niklas Sörensson, Alexey Voronov, Knut Åkesson: SAT-Solving in Practice, with a Tutorial Example from Supervisory Control. Discrete Event Dynamic Systems 19(4): 495-524 (2009) | |
| 29 | Koen Claessen, Jan-Willem Roorda: A Faithful Semantics for Generalised Symbolic Trajectory Evaluation Logical Methods in Computer Science 5(2): (2009) | |
| 2008 | ||
| 28 | Alejandro Russo, Koen Claessen, John Hughes: A library for light-weight information-flow security in haskell. Haskell 2008: 13-24 | |
| 27 | Joel Svensson, Mary Sheeran, Koen Claessen: Obsidian: A Domain Specific Embedded Language for Parallel Programming of Graphics Processors. IFL 2008: 156-173 | |
| 26 | Koen Claessen, Hans Svensson: Finding Counter Examples in Induction Proofs. TAP 2008: 48-65 | |
| 2007 | ||
| 25 | Koen Claessen: A Coverage Analysis for Safety Property Lists. FMCAD 2007: 139-145 | |
| 2006 | ||
| 24 | Jan-Willem Roorda, Koen Claessen: SAT-Based Assistance in Abstraction Refinement for Symbolic Trajectory Evaluation. CAV 2006: 175-189 | |
| 23 | Jan-Willem Roorda, Koen Claessen: Explaining Symbolic Trajectory Evaluation by Giving It a Faithful Semantics. CSR 2006: 555-566 | |
| 22 | Geoff Sutcliffe, Stephan Schulz, Koen Claessen, Allen Van Gelder: Using the TPTP Language for Writing Derivations and Finite Interpretations. IJCAR 2006: 67-81 | |
| 21 | Koen Claessen, Jan-Willem Roorda: An Introduction to Symbolic Trajectory Evaluation. SFM 2006: 56-77 | |
| 2005 | ||
| 20 | Jan-Willem Roorda, Koen Claessen: A New SAT-Based Algorithm for Symbolic Trajectory Evaluation. CHARME 2005: 238-253 | |
| 19 | Emil Axelsson, Koen Claessen, Mary Sheeran: Wired: Wire-Aware Circuit Design. CHARME 2005: 5-19 | |
| 18 | Koen Claessen, Hans Svensson: A semantics for distributed Erlang. Erlang Workshop 2005: 78-87 | |
| 2004 | ||
| 17 | Thomas Arts, Koen Claessen, Hans Svensson: Semi-formal Development of a Fault-Tolerant Leader Election Protocol in Erlang. FATES 2004: 140-154 | |
| 16 | Koen Claessen, Johan Mårtensson: An Operational Semantics for Weak PSL. FMCAD 2004: 337-351 | |
| 15 | Koen Claessen: Safety Property Verification of Cyclic Synchronous Circuits. Electr. Notes Theor. Comput. Sci. 88: 55-69 (2004) | |
| 14 | Koen Claessen: Parallel Parsing Processes. J. Funct. Program. 14(6): 741-757 (2004) | |
| 2003 | ||
| 13 | Koen Claessen, Mary Sheeran, Satnam Singh: Using Lava to design and verify recursive and periodic sorters. STTT 4(3): 349-358 (2003) | |
| 2002 | ||
| 12 | 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 | Koen Claessen, Gordon J. Pace: An embedded language approach to teaching hardware compilation. SIGPLAN Notices 37(12): 35-46 (2002) | |
| 10 | Koen Claessen, John Hughes: Testing monadic code with QuickCheck. SIGPLAN Notices 37(12): 47-59 (2002) | |
| 2001 | ||
| 9 | Koen Claessen, Mary Sheeran, Satnam Singh: The Design and Verification of a Sorter Core. CHARME 2001: 355-369 | |
| 2000 | ||
| 8 | Per Bjesse, Koen Claessen: SAT-Based Verification without State Space Traversal. FMCAD 2000: 372-389 | |
| 7 | Koen Claessen, John Hughes: QuickCheck: a lightweight tool for random testing of Haskell programs. ICFP 2000: 268-279 | |
| 6 | Koen Claessen, Peter Ljunglöf: Typed Logical Variables in Haskell. Electr. Notes Theor. Comput. Sci. 41(1): 37 (2000) | |
| 1999 | ||
| 5 | 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 | 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 | |
Colors in the list of coauthors
Last update Tue May 29 01:28:40 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page