Koen Claessen

Orcid: 0000-0002-8113-4478

Affiliations:
  • Chalmers University of Technology, Gothenburg, Sweden


According to our database1, Koen Claessen authored at least 91 papers between 1997 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Story of Your Lazy Function's Life: A Bidirectional Demand Semantics for Mechanized Cost Analysis of Lazy Programs.
Proc. ACM Program. Lang., 2024

2023
The Verse Calculus: A Core Calculus for Deterministic Functional Logic Programming.
Proc. ACM Program. Lang., August, 2023

QuickerCheck: Implementing and Evaluating a Parallel Run-Time for QuickCheck.
Proceedings of the 35th Symposium on Implementation and Application of Functional Languages, 2023

HasTEE: Programming Trusted Execution Environments with Haskell.
Proceedings of the 16th ACM SIGPLAN International Haskell Symposium, 2023

2022
Testing Cyber-Physical Systems Using a Line-Search Falsification Method.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2022

Creating a Language for Writing Real-Time Applications for the Internet of Things.
Proceedings of the 20th ACM-IEEE International Conference on Formal Methods and Models for System Design, 2022

2021
Handling Transitive Relations in First-Order Automated Reasoning.
J. Autom. Reason., 2021

SAT modulo discrete event simulation applied to railway design capacity analysis.
Formal Methods Syst. Des., 2021

2020
Enhancing Temporal Logic Falsification With Specification Transformation and Valued Booleans.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2020

Towards secure IoT programming in Haskell.
Proceedings of the 13th ACM SIGPLAN International Symposium on Haskell, 2020

Finger trees explained anew, and slightly simplified (functional pearl).
Proceedings of the 13th ACM SIGPLAN International Symposium on Haskell, 2020

2019
Inferring morphological rules from small examples using 0/1 linear programming.
Proceedings of the 22nd Nordic Conference on Computational Linguistics, NoDaLiDa 2019, Turku, Finland, September 30, 2019

Automated Drawing of Railway Schematics Using Numerical Optimization in SAT.
Proceedings of the Integrated Formal Methods - 15th International Conference, 2019

Safety at speed: in-place array algorithms from pure functional programs by safely re-using storage.
Proceedings of the 8th ACM SIGPLAN International Workshop on Functional High-Performance and Numerical Computing, 2019

Testing Safety PLCs Using QuickCheck.
Proceedings of the 15th IEEE International Conference on Automation Science and Engineering, 2019

2018
Design-Time Railway Capacity Verification using SAT modulo Discrete Event Simulation.
Proceedings of the 2018 Formal Methods in Computer Aided Design, 2018

Applying Valued Booleans in Testing of Cyber-Physical Systems.
Proceedings of the 3rd Workshop on Monitoring and Testing of Cyber-Physical Systems, 2018

Efficient Encodings of First-Order Horn Formulas in Equational Logic.
Proceedings of the Automated Reasoning - 9th International Joint Conference, 2018

2017
Quick specifications for the busy programmer.
J. Funct. Program., 2017

A Supervisory Control Algorithm Based on Property-Directed Reachability.
Proceedings of the Hardware and Software: Verification and Testing, 2017

QuickSpec: a lightweight theory exploration tool for programmers (system demonstration).
Proceedings of the 10th ACM SIGPLAN International Symposium on Haskell, 2017

2016
Analysing Constraint Grammars with a SAT-solver.
Proceedings of the Tenth International Conference on Language Resources and Evaluation LREC 2016, 2016

Using fusion to enable late design decisions for pipelined computations.
Proceedings of the 5th International Workshop on Functional High-Performance Computing, 2016

The Key monad: type-safe unconstrained dynamic typing.
Proceedings of the 9th International Symposium on Haskell, 2016

Alternative Treatments of Common Binary Relations in First-order Automated Reasoning.
Proceedings of the 5th Workshop on Practical Aspects of Automated Reasoning co-located with International Joint Conference on Automated Reasoning (IJCAR 2016), 2016

2015
Generating constrained random data with uniform distribution.
J. Funct. Program., 2015

Efficient parallel and incremental parsing of practical context-free languages.
J. Funct. Program., 2015

Linearly Ordered Attribute Grammar Scheduling Using SAT-Solving.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2015

TIP: Tons of Inductive Problems.
Proceedings of the Intelligent Computer Mathematics - International Conference, 2015

SAT Modulo Intuitionistic Implications.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2015

Practical principled FRP: forget the past, change the future, FRPNow!
Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming, 2015

Making Random Judgments: Automatically Generating Well-Typed Terms from the Definition of a Type-System.
Proceedings of the Programming Languages and Systems, 2015

2014
Hipster: Integrating Theory Exploration in a Proof Assistant.
Proceedings of the Intelligent Computer Mathematics - International Conference, 2014

A seamless, client-centric programming model for type safe web applications.
Proceedings of the 2014 ACM SIGPLAN symposium on Haskell, 2014

2013
HALO: haskell to logic through denotational semantics.
Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2013

Efficient divide-and-conquer parsing of practical context-free languages.
Proceedings of the ACM SIGPLAN International Conference on Functional Programming, 2013

Using circular programs for higher-order syntax: functional pearl.
Proceedings of the ACM SIGPLAN International Conference on Functional Programming, 2013

Splittable pseudorandom number generators using cryptographic hashing.
Proceedings of the 2013 ACM SIGPLAN Symposium on Haskell, 2013

A circuit approach to LTL model checking.
Proceedings of the Formal Methods in Computer-Aided Design, 2013

Model-Checking Signal Transduction Networks through Decreasing Reachability Sets.
Proceedings of the Computer Aided Verification - 25th International Conference, 2013

Automating Inductive Proofs Using Theory Exploration.
Proceedings of the Automated Deduction - CADE-24, 2013

2012
Expressive array constructs in an embedded GPU kernel programming language.
Proceedings of the POPL 2012 Workshop on Declarative Aspects of Multicore Programming, 2012

The TPTP Typed First-Order Form with Arithmetic.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2012

Shrinking and showing functions: <i>(functional pearl)</i>.
Proceedings of the 5th ACM SIGPLAN Symposium on Haskell, 2012

A liveness checking algorithm that counts.
Proceedings of the Formal Methods in Computer-Aided Design, 2012

HipSpec: Automating Inductive Proofs of Program Properties.
Proceedings of the ATx'12/WInG'12: Joint Proceedings of the Workshops on Automated Theory eXploration and on Invariant Generation, 2012

2011
Automated Inference of Finite Unsatisfiability.
J. Autom. Reason., 2011

Testing an optimising compiler by generating random lambda terms.
Proceedings of the 6th International Workshop on Automation of Software Test, 2011

Sort It Out with Monotonicity - Translating between Many-Sorted and Unsorted First-Order Logic.
Proceedings of the Automated Deduction - CADE-23 - 23rd International Conference on Automated Deduction, Wroclaw, Poland, July 31, 2011

The Anatomy of Equinox - An Extensible Automated Reasoning Tool for First-Order Logic and Beyond - (Talk Abstract).
Proceedings of the Automated Deduction - CADE-23 - 23rd International Conference on Automated Deduction, Wroclaw, Poland, July 31, 2011

2010
GPGPU kernel implementation and refinement using Obsidian.
Proceedings of the International Conference on Computational Science, 2010

QuickSpec: Guessing Formal Specifications Using Testing.
Proceedings of the Tests and Proofs - 4th International Conference, 2010

Feldspar: A domain specific language for digital signal processing algorithms.
Proceedings of the 8th ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE 2010), 2010

Generating Counterexamples for Structural Inductions by Exploiting Nonstandard Models.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

The Design and Implementation of Feldspar - An Embedded Language for Digital Signal Processing.
Proceedings of the Implementation and Application of Functional Languages, 2010

Ranking programs using black box testing.
Proceedings of the 5th Workshop on Automation of Software Test, 2010

Testing Polymorphic Properties.
Proceedings of the Programming Languages and Systems, 2010

2009
SAT-Solving in Practice, with a Tutorial Example from Supervisory Control.
Discret. Event Dyn. Syst., 2009

A Faithful Semantics for Generalised Symbolic Trajectory Evaluation
Log. Methods Comput. Sci., 2009

Static contract checking for Haskell.
Proceedings of the 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2009

Finding race conditions in Erlang with QuickCheck and PULSE.
Proceedings of the Proceeding of the 14th ACM SIGPLAN international conference on Functional programming, 2009

The Twilight Zone: From Testing to Formal Specifications and Back Again.
Proceedings of the Programming Languages and Systems, 7th Asian Symposium, 2009

2008
Finding Counter Examples in Induction Proofs.
Proceedings of the Tests and Proofs - 2nd International Conference, 2008

Obsidian: A Domain Specific Embedded Language for Parallel Programming of Graphics Processors.
Proceedings of the Implementation and Application of Functional Languages, 2008

A library for light-weight information-flow security in haskell.
Proceedings of the 1st ACM SIGPLAN Symposium on Haskell, 2008

2007
A Coverage Analysis for Safety Property Lists.
Proceedings of the Formal Methods in Computer-Aided Design, 7th International Conference, 2007

2006
An Introduction to Symbolic Trajectory Evaluation.
Proceedings of the Formal Methods for Hardware Verification, 2006

Explaining Symbolic Trajectory Evaluation by Giving It a Faithful Semantics.
Proceedings of the Computer Science, 2006

SAT-Based Assistance in Abstraction Refinement for Symbolic Trajectory Evaluation.
Proceedings of the Computer Aided Verification, 18th International Conference, 2006

Using the TPTP Language for Writing Derivations and Finite Interpretations.
Proceedings of the Automated Reasoning, Third International Joint Conference, 2006

2005
A semantics for distributed Erlang.
Proceedings of the 2005 ACM SIGPLAN Workshop on Erlang, Tallinn, 2005

A New SAT-Based Algorithm for Symbolic Trajectory Evaluation.
Proceedings of the Correct Hardware Design and Verification Methods, 2005

Wired: Wire-Aware Circuit Design.
Proceedings of the Correct Hardware Design and Verification Methods, 2005

2004
Parallel Parsing Processes.
J. Funct. Program., 2004

An Operational Semantics for Weak PSL.
Proceedings of the Formal Methods in Computer-Aided Design, 5th International Conference, 2004

Semi-formal Development of a Fault-Tolerant Leader Election Protocol in Erlang.
Proceedings of the Formal Approaches to Software Testing, 4th International Workshop, 2004

2003
Using Lava to design and verify recursive and periodic sorters.
Int. J. Softw. Tools Technol. Transf., 2003

Safety Property Verification of Cyclic Synchronous Circuits.
Proceedings of the Synchronous Languages, Applications and Programming, 2003

2002
An embedded language approach to teaching hardware compilation.
ACM SIGPLAN Notices, 2002

Testing monadic code with QuickCheck.
ACM SIGPLAN Notices, 2002

Testing and Tracing Lazy Functional Programs Using QuickCheck and Hat.
Proceedings of the Advanced Functional Programming, 2002

2001
Embedded Languages for Describing and Verifying Hardware.
PhD thesis, 2001

The Design and Verification of a Sorter Core.
Proceedings of the Correct Hardware Design and Verification Methods, 2001

2000
Typed Logical Variables in Haskell.
Proceedings of the 2000 ACM SIGPLAN Workshop on Haskell, 2000

QuickCheck: a lightweight tool for random testing of Haskell programs.
Proceedings of the Fifth ACM SIGPLAN International Conference on Functional Programming (ICFP '00), 2000

SAT-Based Verification without State Space Traversal.
Proceedings of the Formal Methods in Computer-Aided Design, Third International Conference, 2000

1999
A Poor Man's Concurrency Monad.
J. Funct. Program., 1999

Observable Sharing for Functional Circuit Description.
Proceedings of the Advances in Computing Science, 1999

1998
Lava: Hardware Design in Haskell.
Proceedings of the third ACM SIGPLAN International Conference on Functional Programming (ICFP '98), 1998

1997
Structuring Graphical Paradigms in TkGofer.
Proceedings of the 1997 ACM SIGPLAN International Conference on Functional Programming (ICFP '97), 1997

Graphs in Compilation.
Proceedings of the 1997 ACM SIGPLAN International Conference on Functional Programming (ICFP '97), 1997


  Loading...