Person: Koen Claessen

DBLP: Claessen:Koen

Facilitated 1 volumes:

Ed

Contributed to:

2015

2015

2015

2014

2013

2013

2013

2013

2011

2010

2010

2010

2009

2009

2009

2008

2008

2006

2006

2006

2004

2002

2000

1998

1997

2018

2008

2012

2013

2014

2016

2017

2019

Wrote 36 papers:

ESOP-2015-FetscherCPHF #automation #generative #random #type system

Making Random Judgments: Automatically Generating Well-Typed Terms from the Definition of a Type-System (BF, KC, MHP, JH, RBF), pp. 383–405.

ICFP-2015-PloegC #exclamation

Practical principled FRP: forget the past, change the future, FRPNow! (AvdP, KC), pp. 302–314.

TACAS-2015-BransenBCD #attribute grammar #order #scheduling #using

Linearly Ordered Attribute Grammar Scheduling Using SAT-Solving (JB, LTvB, KC, AD), pp. 289–303.

FLOPS-2014-ClaessenDP #generative #random

Generating Constrained Random Data with Uniform Distribution (KC, JD, MHP), pp. 18–34.

CADE-2013-ClaessenJRS #automation #induction #proving #using

Automating Inductive Proofs Using Theory Exploration (KC, MJ, DR, NS), pp. 392–406.

CAV-2013-ClaessenFIPW #model checking #network #reachability #set

Model-Checking Signal Transduction Networks through Decreasing Reachability Sets (KC, JF, SI, NP, QW), pp. 85–100.

ICFP-2013-AxelssonC #functional #higher-order #source code #syntax #using

Using circular programs for higher-order syntax: functional pearl (EA, KC), pp. 257–262.

ICFP-2013-BernardyC #context-free grammar #divide and conquer #parsing #performance

Efficient divide-and-conquer parsing of practical context-free languages (JPB, KC), pp. 111–122.

POPL-2013-VytiniotisJCR #haskell #logic #named #semantics

HALO: haskell to logic through denotational semantics (DV, SLPJ, KC, DR), pp. 431–442.

CADE-2011-Claessen #automation #first-order #logic #reasoning

The Anatomy of Equinox — An Extensible Automated Reasoning Tool for First-Order Logic and Beyond — (KC), pp. 1–3.

CADE-2011-ClaessenLS #first-order #logic

Sort It Out with Monotonicity — Translating between Many-Sorted and Unsorted First-Order Logic (KC, AL, NS), pp. 207–221.

ESOP-2010-BernardyJC #polymorphism #testing

Testing Polymorphic Properties (JPB, PJ, KC), pp. 125–144.

IFL-2010-AxelssonCSSEP #design #embedded #implementation

The Design and Implementation of Feldspar — An Embedded Language for Digital Signal Processing (EA, KC, MS, JS, DE, AP), pp. 121–136.

TAP-2010-ClaessenSH #named #specification #testing #using

QuickSpec: Guessing Formal Specifications Using Testing (KC, NS, JH), pp. 6–21.

CADE-2009-ClaessenL #automation #finite #satisfiability

Automated Inference of Finite Unsatisfiability (KC, AL), pp. 388–403.

ICFP-2009-ClaessenPSHSAW #erlang #quickcheck

Finding race conditions in Erlang with QuickCheck and PULSE (KC, MHP, NS, JH, HS, TA, UTW), pp. 149–160.

POPL-2009-XuJC #contract #haskell

Static contract checking for Haskell (DNX, SLPJ, KC), pp. 41–52.

IFL-2008-SvenssonSC #embedded #named #parallel #programming

Obsidian: A Domain Specific Embedded Language for Parallel Programming of Graphics Processors (JS, MS, KC), pp. 156–173.

TAP-2008-ClaessenS #induction #proving

Finding Counter Examples in Induction Proofs (KC, HS), pp. 48–65.

CAV-2006-RoordaC #abstraction #evaluation #refinement #satisfiability

SAT-Based Assistance in Abstraction Refinement for Symbolic Trajectory Evaluation (JWR, KC), pp. 175–189.

IJCAR-2006-SutcliffeSCG #finite #using

Using the TPTP Language for Writing Derivations and Finite Interpretations (GS, SS, KC, AVG), pp. 67–81.

SFM-2006-ClaessenR #evaluation

An Introduction to Symbolic Trajectory Evaluation (KC, JWR), pp. 56–77.

FATES-2004-ArtsCS #development #erlang #fault tolerance #protocol

Semi-formal Development of a Fault-Tolerant Leader Election Protocol in Erlang (TA, KC, HS), pp. 140–154.

AFP-2002-ClaessenRCHW02 #functional #lazy evaluation #quickcheck #source code #testing #using

Testing and Tracing Lazy Functional Programs Using QuickCheck and Hat (KC, CR, OC, JH, MW), pp. 59–99.

ICFP-2000-ClaessenH #haskell #lightweight #named #quickcheck #random testing #source code #testing

QuickCheck: a lightweight tool for random testing of Haskell programs (KC, JH), pp. 268–279.

ICFP-1998-BjesseCSS #design #hardware #haskell #named

Lava: Hardware Design in Haskell (PB, KC, MS, SS), pp. 174–184.

ICFP-1997-Claessen #compilation #graph

Graphs in Compilation (KC), p. 309.

ICFP-1997-ClaessenVM #paradigm #visual notation

Structuring Graphical Paradigms in TkGofer (KC, TV, EM), pp. 251–262.

IJCAR-2018-ClaessenS #encoding #equation #first-order #logic #performance

Efficient Encodings of First-Order Horn Formulas in Equational Logic (KC, NS), pp. 388–404.

Haskell-2008-RussoCH #data flow #haskell #library #security

A library for light-weight information-flow security in haskell (AR, KC, JH), pp. 13–24.

Haskell-2012-Claessen #functional

Shrinking and showing functions: (functional pearl) (KC), pp. 73–80.

Haskell-2013-ClaessenP #encryption #generative #pseudo #using

Splittable pseudorandom number generators using cryptographic hashing (KC, MHP), pp. 47–58.

Haskell-2014-EkbladC #programming #type safety #web

A seamless, client-centric programming model for type safe web applications (AE, KC), pp. 79–89.

Haskell-2016-PloegCB #dynamic typing #monad #type safety #type system

The Key monad: type-safe unconstrained dynamic typing (AvdP, KC, PB), pp. 146–157.

Haskell-2017-AlgehedCJS #lightweight #named

QuickSpec: a lightweight theory exploration tool for programmers (system demonstration) (MA, KC, MJ, NS), pp. 38–39.

CASE-2019-ThonnessenSFCK #quickcheck #safety #testing #using

Testing Safety PLCs Using QuickCheck (DT, NS, MF, KC, SK), pp. 1–6.