Koen Claessen

ORCID

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 36

Top Venues

CoRR

Haskell

J. Funct. Program.

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.

Chalmers University of Technology, Gothenburg, Sweden (PHD)

Education History

Chalmers University of Technology, Gothenburg, Sweden

PHD

Publications

Li-yao Xia, Laura Israel, Maite Kramarz, Nicholas Coltharp, Koen Claessen, Stephanie Weirich, Yao Li
Story of Your Lazy Function's Life: A Bidirectional Demand Semantics for Mechanized Cost Analysis of Lazy Programs. CoRR (2024)
Robert Krook, Nicholas Smallbone, Bo Joel Svensson, Koen Claessen
QuickerCheck: Implementing and Evaluating a Parallel Run-Time for QuickCheck. CoRR (2024)
Abhiroop Sarkar, Robert Krook, Alejandro Russo, Koen Claessen
HasTEE: Programming Trusted Execution Environments with Haskell. CoRR (2023)
Robert Krook, Nicholas Smallbone, Bo Joel Svensson, Koen Claessen
QuickerCheck: Implementing and Evaluating a Parallel Run-Time for QuickCheck. IFL (2023)
Abhiroop Sarkar, Robert Krook, Alejandro Russo, Koen Claessen
HasTEE: Programming Trusted Execution Environments with Haskell. Haskell (2023)
Lennart Augustsson, Joachim Breitner, Koen Claessen, Ranjit Jhala, Simon Peyton Jones, Olin Shivers, Guy L. Steele Jr., Tim Sweeney
The Verse Calculus: A Core Calculus for Deterministic Functional Logic Programming. Proc. ACM Program. Lang. 7 (ICFP) (2023)
Robert Krook, John Hui, Bo Joel Svensson, Stephen A. Edwards, Koen Claessen
Creating a Language for Writing Real-Time Applications for the Internet of Things. MEMOCODE (2022)
Zahra Ramezani, Koen Claessen, Nicholas Smallbone, Martin Fabian, Knut Åkesson
Testing Cyber-Physical Systems Using a Line-Search Falsification Method. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 41 (8) (2022)
Koen Claessen, Ann Lillieström
Handling Transitive Relations in First-Order Automated Reasoning. J. Autom. Reason. 65 (8) (2021)
Bjørnar Luteberget, Koen Claessen, Christian Johansen, Martin Steffen
SAT modulo discrete event simulation applied to railway design capacity analysis. Formal Methods Syst. Des. 57 (2) (2021)
Koen Claessen
Finger trees explained anew, and slightly simplified (functional pearl). Haskell@ICFP (2020)
Nachiappan Valliappan, Robert Krook, Alejandro Russo, Koen Claessen
Towards secure IoT programming in Haskell. Haskell@ICFP (2020)
Johan Lidén Eddeland, Koen Claessen, Nicholas Smallbone, Zahra Ramezani, Sajed Miremadi, Knut Åkesson
Enhancing Temporal Logic Falsification With Specification Transformation and Valued Booleans. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 39 (12) (2020)
Markus Aronsson, Koen Claessen, Mary Sheeran, Nicholas Smallbone
Safety at speed: in-place array algorithms from pure functional programs by safely re-using storage. FHPNC@ICFP (2019)
Ann Lillieström, Koen Claessen, Nicholas Smallbone
Inferring morphological rules from small examples using 0/1 linear programming. NODALIDA (2019)
Bjørnar Luteberget, Koen Claessen, Christian Johansen
Automated Drawing of Railway Schematics Using Numerical Optimization in SAT. IFM (2019)
David Thönnessen, Nick Smallbone, Martin Fabian, Koen Claessen, Stefan Kowalewski
Testing Safety PLCs Using QuickCheck. CASE (2019)
Johan Lidén Eddeland, Koen Claessen, Nicholas Smallbone, Zahra Ramezani, Sajed Miremadi, Knut Åkesson
Enhancing Temporal Logic Falsification with Specification Transformation and Valued Booleans. CoRR (2019)
Bjørnar Luteberget, Koen Claessen, Christian Johansen
Design-Time Railway Capacity Verification using SAT modulo Discrete Event Simulation. FMCAD (2018)
Koen Claessen, Nicholas Smallbone
Efficient Encodings of First-Order Horn Formulas in Equational Logic. IJCAR (2018)
Koen Claessen, Nicholas Smallbone, Johan Lidén Eddeland, Zahra Ramezani, Knut Åkesson, Sajed Miremadi
Applying Valued Booleans in Testing of Cyber-Physical Systems. MT@CPSWeek (2018)
Koen Claessen, Jonatan Kilhamn, Laura Kovács, Bengt Lennartson
A Supervisory Control Algorithm Based on Property-Directed Reachability. CoRR (2017)
Koen Claessen, Jonatan Kilhamn, Laura Kovács, Bengt Lennartson
A Supervisory Control Algorithm Based on Property-Directed Reachability. Haifa Verification Conference (2017)
Nicholas Smallbone, Moa Johansson, Koen Claessen, Maximilian Algehed
Quick specifications for the busy programmer. J. Funct. Program. 27 (2017)
Maximilian Algehed, Koen Claessen, Moa Johansson, Nicholas Smallbone
QuickSpec: a lightweight theory exploration tool for programmers (system demonstration). Haskell (2017)
Koen Claessen, Ann Lillieström
Alternative Treatments of Common Binary Relations in First-order Automated Reasoning. PAAR@IJCAR (2016)
Atze van der Ploeg, Koen Claessen, Pablo Buiras
The Key monad: type-safe unconstrained dynamic typing. Haskell (2016)
Inari Listenmaa, Koen Claessen
Analysing Constraint Grammars with a SAT-solver. LREC (2016)
Máté Karácsony, Koen Claessen
Using fusion to enable late design decisions for pipelined computations. FHPC@ICFP (2016)
Burke Fetscher, Koen Claessen, Michal H. Palka, John Hughes, Robert Bruce Findler
Making Random Judgments: Automatically Generating Well-Typed Terms from the Definition of a Type-System. ESOP (2015)
Jeroen Bransen, L. Thomas van Binsbergen, Koen Claessen, Atze Dijkstra
Linearly Ordered Attribute Grammar Scheduling Using SAT-Solving. TACAS (2015)
Jean-Philippe Bernardy, Koen Claessen
Efficient parallel and incremental parsing of practical context-free languages. J. Funct. Program. 25 (2015)
Koen Claessen, Moa Johansson, Dan Rosén, Nicholas Smallbone
TIP: Tons of Inductive Problems. CICM (2015)
Koen Claessen, Dan Rosén
SAT Modulo Intuitionistic Implications. LPAR (2015)
Atze van der Ploeg, Koen Claessen
Practical principled FRP: forget the past, change the future, FRPNow! ICFP (2015)
Koen Claessen, Jonas Duregård, Michal H. Palka
Generating constrained random data with uniform distribution. J. Funct. Program. 25 (2015)
Koen Claessen, Jonas Duregård, Michal H. Palka
Generating Constrained Random Data with Uniform Distribution. FLOPS (2014)
Anton Ekblad, Koen Claessen
A seamless, client-centric programming model for type safe web applications. Haskell (2014)
Moa Johansson, Dan Rosén, Nicholas Smallbone, Koen Claessen
Hipster: Integrating Theory Exploration in a Proof Assistant. CICM (2014)
Moa Johansson, Dan Rosén, Nicholas Smallbone, Koen Claessen
Hipster: Integrating Theory Exploration in a Proof Assistant. CoRR (2014)
Koen Claessen, Michal H. Palka
Splittable pseudorandom number generators using cryptographic hashing. Haskell (2013)
Koen Claessen, Moa Johansson, Dan Rosén, Nicholas Smallbone
Automating Inductive Proofs Using Theory Exploration. CADE (2013)
Koen Claessen, Niklas Eén, Baruch Sterin
A circuit approach to LTL model checking. FMCAD (2013)
Emil Axelsson, Koen Claessen
Using circular programs for higher-order syntax: functional pearl. ICFP (2013)
Jean-Philippe Bernardy, Koen Claessen
Efficient divide-and-conquer parsing of practical context-free languages. ICFP (2013)
Koen Claessen, Jasmin Fisher, Samin Ishtiaq, Nir Piterman, Qinsi Wang
Model-Checking Signal Transduction Networks through Decreasing Reachability Sets. CAV (2013)
Dimitrios Vytiniotis, Simon L. Peyton Jones, Koen Claessen, Dan Rosén
HALO: haskell to logic through denotational semantics. POPL (2013)
Koen Claessen, Niklas Sörensson
A liveness checking algorithm that counts. FMCAD (2012)
Geoff Sutcliffe, Stephan Schulz, Koen Claessen, Peter Baumgartner
The TPTP Typed First-Order Form with Arithmetic. LPAR (2012)
Koen Claessen, Moa Johansson, Dan Rosén, Nicholas Smallbone
HipSpec: Automating Inductive Proofs of Program Properties. ATx/WInG@IJCAR (2012)
Koen Claessen
. Haskell (2012)
Koen Claessen, Mary Sheeran, Joel Svensson
Expressive array constructs in an embedded GPU kernel programming language. DAMP (2012)
Koen Claessen, Ann Lillieström, Nicholas Smallbone
Sort It Out with Monotonicity - Translating between Many-Sorted and Unsorted First-Order Logic. CADE (2011)
Koen Claessen
The Anatomy of Equinox - An Extensible Automated Reasoning Tool for First-Order Logic and Beyond - (Talk Abstract). CADE (2011)
Michal H. Palka, Koen Claessen, Alejandro Russo, John Hughes
Testing an optimising compiler by generating random lambda terms. AST (2011)
Koen Claessen, Ann Lillieström
Automated Inference of Finite Unsatisfiability. J. Autom. Reason. 47 (2) (2011)
Jean-Philippe Bernardy, Patrik Jansson, Koen Claessen
Testing Polymorphic Properties. ESOP (2010)
Koen Claessen, John Hughes, Michal H. Palka, Nicholas Smallbone, Hans Svensson
Ranking programs using black box testing. AST (2010)
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)
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)
Joel Svensson, Koen Claessen, Mary Sheeran
GPGPU kernel implementation and refinement using Obsidian. ICCS (1) (2010)
Jasmin Christian Blanchette, Koen Claessen
Generating Counterexamples for Structural Inductions by Exploiting Nonstandard Models. LPAR (Yogyakarta) (2010)
Koen Claessen, Nicholas Smallbone, John Hughes
QuickSpec: Guessing Formal Specifications Using Testing. TAP@TOOLS (2010)
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. Discret. Event Dyn. Syst. 19 (4) (2009)
Koen Claessen
The Twilight Zone: From Testing to Formal Specifications and Back Again. APLAS (2009)
Koen Claessen, Jan-Willem Roorda
A Faithful Semantics for Generalised Symbolic Trajectory Evaluation Log. Methods Comput. Sci. 5 (2) (2009)
Koen Claessen, Michal H. Palka, Nicholas Smallbone, John Hughes, Hans Svensson, Thomas Arts, Ulf T. Wiger
Finding race conditions in Erlang with QuickCheck and PULSE. ICFP (2009)
Koen Claessen, Ann Lillieström
Automated Inference of Finite Unsatisfiability. CADE (2009)
Dana N. Xu, Simon L. Peyton Jones, Koen Claessen
Static contract checking for Haskell. POPL (2009)
Joel Svensson, Mary Sheeran, Koen Claessen
Obsidian: A Domain Specific Embedded Language for Parallel Programming of Graphics Processors. IFL (2008)
Alejandro Russo, Koen Claessen, John Hughes
A library for light-weight information-flow security in haskell. Haskell (2008)
Koen Claessen, Hans Svensson
Finding Counter Examples in Induction Proofs. TAP (2008)
Koen Claessen
A Coverage Analysis for Safety Property Lists. FMCAD (2007)
Geoff Sutcliffe, Stephan Schulz, Koen Claessen, Allen Van Gelder
Using the TPTP Language for Writing Derivations and Finite Interpretations. IJCAR (2006)
Koen Claessen, Jan-Willem Roorda
An Introduction to Symbolic Trajectory Evaluation. SFM (2006)
Jan-Willem Roorda, Koen Claessen
SAT-Based Assistance in Abstraction Refinement for Symbolic Trajectory Evaluation. CAV (2006)
Jan-Willem Roorda, Koen Claessen
Explaining Symbolic Trajectory Evaluation by Giving It a Faithful Semantics. CSR (2006)
Koen Claessen, Hans Svensson
A semantics for distributed Erlang. Erlang Workshop (2005)
Emil Axelsson, Koen Claessen, Mary Sheeran
Wired: Wire-Aware Circuit Design. CHARME (2005)
Jan-Willem Roorda, Koen Claessen
A New SAT-Based Algorithm for Symbolic Trajectory Evaluation. CHARME (2005)
Thomas Arts, Koen Claessen, Hans Svensson
Semi-formal Development of a Fault-Tolerant Leader Election Protocol in Erlang. FATES (2004)
Koen Claessen, Johan Mårtensson
An Operational Semantics for Weak PSL. FMCAD (2004)
Koen Claessen
Parallel Parsing Processes. J. Funct. Program. 14 (6) (2004)
Koen Claessen
Safety Property Verification of Cyclic Synchronous Circuits. Electron. Notes Theor. Comput. Sci. 88 (2004)
Koen Claessen, Mary Sheeran, Satnam Singh
Using Lava to design and verify recursive and periodic sorters. Int. J. Softw. Tools Technol. Transf. 4 (3) (2003)
Koen Claessen, Colin Runciman, Olaf Chitil, John Hughes, Malcolm Wallace
Testing and Tracing Lazy Functional Programs Using QuickCheck and Hat. Advanced Functional Programming (2002)
Koen Claessen, Gordon J. Pace
An embedded language approach to teaching hardware compilation. ACM SIGPLAN Notices 37 (12) (2002)
Koen Claessen, John Hughes
Testing monadic code with QuickCheck. ACM SIGPLAN Notices 37 (12) (2002)
Koen Claessen, John Hughes
Testing monadic code with QuickCheck. Haskell (2002)
Koen Claessen, Mary Sheeran, Satnam Singh
The Design and Verification of a Sorter Core. CHARME (2001)
Koen Claessen, John Hughes
QuickCheck: a lightweight tool for random testing of Haskell programs. ICFP (2000)
Per Bjesse, Koen Claessen
SAT-Based Verification without State Space Traversal. FMCAD (2000)
Koen Claessen, Peter Ljunglöf
Typed Logical Variables in Haskell. Electron. Notes Theor. Comput. Sci. 41 (1) (2000)
Koen Claessen, David Sands
Observable Sharing for Functional Circuit Description. ASIAN (1999)
Koen Claessen
A Poor Man's Concurrency Monad. J. Funct. Program. 9 (3) (1999)
Per Bjesse, Koen Claessen, Mary Sheeran, Satnam Singh
Lava: Hardware Design in Haskell. ICFP (1998)
Koen Claessen, Ton Vullinghs, Erik Meijer
Structuring Graphical Paradigms in TkGofer. ICFP (1997)
Koen Claessen
Graphs in Compilation. ICFP (1997)

Koen Claessen.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Koen Claessen