default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKoen Claessen
Person information
- affiliation: Chalmers University of Technology, Gothenburg, Sweden
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 2001
[b1]Koen Claessen:
Embedded Languages for Describing and Verifying Hardware. Chalmers University of Technology, Gothenburg, Sweden, 2001
Journal Articles
- 2023
- [j16]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): 417-447 (2023) - 2022
- [j15]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): 2393-2406 (2022) - 2021
- [j14]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): 211-245 (2021) - [j13]Koen Claessen, Ann Lillieström:
Handling Transitive Relations in First-Order Automated Reasoning. J. Autom. Reason. 65(8): 1097-1124 (2021) - 2020
- [j12]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): 5247-5260 (2020) - 2017
- [j11]Nicholas Smallbone, Moa Johansson, Koen Claessen, Maximilian Algehed:
Quick specifications for the busy programmer. J. Funct. Program. 27: e18 (2017) - 2015
- [j10]Jean-Philippe Bernardy, Koen Claessen:
Efficient parallel and incremental parsing of practical context-free languages. J. Funct. Program. 25 (2015) - [j9]Koen Claessen, Jonas Duregård, Michal H. Palka:
Generating constrained random data with uniform distribution. J. Funct. Program. 25 (2015) - 2011
- [j8]Koen Claessen, Ann Lillieström:
Automated Inference of Finite Unsatisfiability. J. Autom. Reason. 47(2): 111-132 (2011) - 2009
- [j7]Koen Claessen, Jan-Willem Roorda:
A Faithful Semantics for Generalised Symbolic Trajectory Evaluation. Log. Methods Comput. Sci. 5(2) (2009) - [j6]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): 495-524 (2009) - 2004
- [j5]Koen Claessen:
Parallel Parsing Processes. J. Funct. Program. 14(6): 741-757 (2004) - 2003
- [j4]Koen Claessen, Mary Sheeran, Satnam Singh:
Using Lava to design and verify recursive and periodic sorters. Int. J. Softw. Tools Technol. Transf. 4(3): 349-358 (2003) - 2002
- [j3]Koen Claessen, Gordon J. Pace:
An embedded language approach to teaching hardware compilation. ACM SIGPLAN Notices 37(12): 35-46 (2002) - [j2]Koen Claessen, John Hughes:
Testing monadic code with QuickCheck. ACM SIGPLAN Notices 37(12): 47-59 (2002) - 1999
- [j1]Koen Claessen:
A Poor Man's Concurrency Monad. J. Funct. Program. 9(3): 313-323 (1999)
Conference and Workshop Papers
- 2023
- [c76]Abhiroop Sarkar, Robert Krook, Alejandro Russo, Koen Claessen:
HasTEE: Programming Trusted Execution Environments with Haskell. Haskell 2023: 72-88 - [c75]Robert Krook, Nicholas Smallbone, Bo Joel Svensson, Koen Claessen:
QuickerCheck: Implementing and Evaluating a Parallel Run-Time for QuickCheck. IFL 2023: 9:1-9:12 - 2022
- [c74]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: 1-20 - 2020
- [c73]Koen Claessen:
Finger trees explained anew, and slightly simplified (functional pearl). Haskell@ICFP 2020: 31-38 - [c72]Nachiappan Valliappan, Robert Krook, Alejandro Russo, Koen Claessen:
Towards secure IoT programming in Haskell. Haskell@ICFP 2020: 136-150 - 2019
- [c71]David Thönnessen, Nick Smallbone, Martin Fabian, Koen Claessen, Stefan Kowalewski:
Testing Safety PLCs Using QuickCheck. CASE 2019: 1-6 - [c70]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: 34-46 - [c69]Bjørnar Luteberget, Koen Claessen, Christian Johansen:
Automated Drawing of Railway Schematics Using Numerical Optimization in SAT. IFM 2019: 341-359 - [c68]Ann Lillieström, Koen Claessen, Nicholas Smallbone:
Inferring morphological rules from small examples using 0/1 linear programming. NODALIDA 2019: 164-174 - 2018
- [c67]Koen Claessen, Nicholas Smallbone:
Efficient Encodings of First-Order Horn Formulas in Equational Logic. IJCAR 2018: 388-404 - [c66]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: 8-9 - [c65]Bjørnar Luteberget, Koen Claessen, Christian Johansen:
Design-Time Railway Capacity Verification using SAT modulo Discrete Event Simulation. FMCAD 2018: 1-9 - 2017
- [c64]Maximilian Algehed, Koen Claessen, Moa Johansson, Nicholas Smallbone:
QuickSpec: a lightweight theory exploration tool for programmers (system demonstration). Haskell 2017: 38-39 - [c63]Koen Claessen, Jonatan Kilhamn, Laura Kovács, Bengt Lennartson:
A Supervisory Control Algorithm Based on Property-Directed Reachability. Haifa Verification Conference 2017: 115-130 - 2016
- [c62]Koen Claessen, Ann Lillieström:
Alternative Treatments of Common Binary Relations in First-order Automated Reasoning. PAAR@IJCAR 2016: 11-23 - [c61]Atze van der Ploeg, Koen Claessen, Pablo Buiras:
The Key monad: type-safe unconstrained dynamic typing. Haskell 2016: 146-157 - [c60]Máté Karácsony, Koen Claessen:
Using fusion to enable late design decisions for pipelined computations. FHPC@ICFP 2016: 9-16 - [c59]Inari Listenmaa, Koen Claessen:
Analysing Constraint Grammars with a SAT-solver. LREC 2016 - 2015
- [c58]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: 383-405 - [c57]Atze van der Ploeg, Koen Claessen:
Practical principled FRP: forget the past, change the future, FRPNow! ICFP 2015: 302-314 - [c56]Koen Claessen, Dan Rosén:
SAT Modulo Intuitionistic Implications. LPAR 2015: 622-637 - [c55]Koen Claessen, Moa Johansson, Dan Rosén, Nicholas Smallbone:
TIP: Tons of Inductive Problems. CICM 2015: 333-337 - [c54]Jeroen Bransen, L. Thomas van Binsbergen, Koen Claessen, Atze Dijkstra:
Linearly Ordered Attribute Grammar Scheduling Using SAT-Solving. TACAS 2015: 289-303 - 2014
- [c53]Koen Claessen, Jonas Duregård, Michal H. Palka:
Generating Constrained Random Data with Uniform Distribution. FLOPS 2014: 18-34 - [c52]Anton Ekblad, Koen Claessen:
A seamless, client-centric programming model for type safe web applications. Haskell 2014: 79-89 - [c51]Moa Johansson, Dan Rosén, Nicholas Smallbone, Koen Claessen:
Hipster: Integrating Theory Exploration in a Proof Assistant. CICM 2014: 108-122 - 2013
- [c50]Koen Claessen, Moa Johansson, Dan Rosén, Nicholas Smallbone:
Automating Inductive Proofs Using Theory Exploration. CADE 2013: 392-406 - [c49]Koen Claessen, Jasmin Fisher, Samin Ishtiaq, Nir Piterman, Qinsi Wang:
Model-Checking Signal Transduction Networks through Decreasing Reachability Sets. CAV 2013: 85-100 - [c48]Koen Claessen, Niklas Eén, Baruch Sterin:
A circuit approach to LTL model checking. FMCAD 2013: 53-60 - [c47]Koen Claessen, Michal H. Palka:
Splittable pseudorandom number generators using cryptographic hashing. Haskell 2013: 47-58 - [c46]Jean-Philippe Bernardy, Koen Claessen:
Efficient divide-and-conquer parsing of practical context-free languages. ICFP 2013: 111-122 - [c45]Emil Axelsson, Koen Claessen:
Using circular programs for higher-order syntax: functional pearl. ICFP 2013: 257-262 - [c44]Dimitrios Vytiniotis, Simon L. Peyton Jones, Koen Claessen, Dan Rosén:
HALO: haskell to logic through denotational semantics. POPL 2013: 431-442 - 2012
- [c43]Koen Claessen, Moa Johansson, Dan Rosén, Nicholas Smallbone:
HipSpec: Automating Inductive Proofs of Program Properties. ATx/WInG@IJCAR 2012: 16-25 - [c42]Koen Claessen, Niklas Sörensson:
A liveness checking algorithm that counts. FMCAD 2012: 52-59 - [c41]Koen Claessen:
Shrinking and showing functions: (functional pearl). Haskell 2012: 73-80 - [c40]Geoff Sutcliffe, Stephan Schulz, Koen Claessen, Peter Baumgartner:
The TPTP Typed First-Order Form with Arithmetic. LPAR 2012: 406-419 - [c39]Koen Claessen, Mary Sheeran, Joel Svensson:
Expressive array constructs in an embedded GPU kernel programming language. DAMP 2012: 21-30 - 2011
- [c38]Koen Claessen:
The Anatomy of Equinox - An Extensible Automated Reasoning Tool for First-Order Logic and Beyond - (Talk Abstract). CADE 2011: 1-3 - [c37]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 - [c36]Michal H. Palka, Koen Claessen, Alejandro Russo, John Hughes:
Testing an optimising compiler by generating random lambda terms. AST 2011: 91-97 - 2010
- [c35]Jean-Philippe Bernardy, Patrik Jansson, Koen Claessen:
Testing Polymorphic Properties. ESOP 2010: 125-144 - [c34]Koen Claessen, John Hughes, Michal H. Palka, Nicholas Smallbone, Hans Svensson:
Ranking programs using black box testing. AST 2010: 103-110 - [c33]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 - [c32]Jasmin Christian Blanchette, Koen Claessen:
Generating Counterexamples for Structural Inductions by Exploiting Nonstandard Models. LPAR (Yogyakarta) 2010: 127-141 - [c31]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 - [c30]Koen Claessen, Nicholas Smallbone, John Hughes:
QuickSpec: Guessing Formal Specifications Using Testing. TAP@TOOLS 2010: 6-21 - [c29]Joel Svensson, Koen Claessen, Mary Sheeran:
GPGPU kernel implementation and refinement using Obsidian. ICCS 2010: 2065-2074 - 2009
- [c28]Koen Claessen:
The Twilight Zone: From Testing to Formal Specifications and Back Again. APLAS 2009: 1 - [c27]Koen Claessen, Ann Lillieström:
Automated Inference of Finite Unsatisfiability. CADE 2009: 388-403 - [c26]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: 149-160 - [c25]Dana N. Xu, Simon L. Peyton Jones, Koen Claessen:
Static contract checking for Haskell. POPL 2009: 41-52 - 2008
- [c24]Alejandro Russo, Koen Claessen, John Hughes:
A library for light-weight information-flow security in haskell. Haskell 2008: 13-24 - [c23]Joel Svensson, Mary Sheeran, Koen Claessen:
Obsidian: A Domain Specific Embedded Language for Parallel Programming of Graphics Processors. IFL 2008: 156-173 - [c22]Koen Claessen, Hans Svensson:
Finding Counter Examples in Induction Proofs. TAP 2008: 48-65 - 2007
- [c21]Koen Claessen:
A Coverage Analysis for Safety Property Lists. FMCAD 2007: 139-145 - 2006
- [c20]Geoff Sutcliffe, Stephan Schulz, Koen Claessen, Allen Van Gelder:
Using the TPTP Language for Writing Derivations and Finite Interpretations. IJCAR 2006: 67-81 - [c19]Jan-Willem Roorda, Koen Claessen:
SAT-Based Assistance in Abstraction Refinement for Symbolic Trajectory Evaluation. CAV 2006: 175-189 - [c18]Jan-Willem Roorda, Koen Claessen:
Explaining Symbolic Trajectory Evaluation by Giving It a Faithful Semantics. CSR 2006: 555-566 - [c17]Koen Claessen, Jan-Willem Roorda:
An Introduction to Symbolic Trajectory Evaluation. SFM 2006: 56-77 - 2005
- [c16]Emil Axelsson, Koen Claessen, Mary Sheeran:
Wired: Wire-Aware Circuit Design. CHARME 2005: 5-19 - [c15]Jan-Willem Roorda, Koen Claessen:
A New SAT-Based Algorithm for Symbolic Trajectory Evaluation. CHARME 2005: 238-253 - [c14]Koen Claessen, Hans Svensson:
A semantics for distributed Erlang. Erlang Workshop 2005: 78-87 - 2004
- [c13]Thomas Arts, Koen Claessen, Hans Svensson:
Semi-formal Development of a Fault-Tolerant Leader Election Protocol in Erlang. FATES 2004: 140-154 - [c12]Koen Claessen, Johan Mårtensson:
An Operational Semantics for Weak PSL. FMCAD 2004: 337-351 - 2003
- [c11]Koen Claessen:
Safety Property Verification of Cyclic Synchronous Circuits. SLAP 2003: 55-69 - 2002
- [c10]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 - [c9]Koen Claessen, John Hughes:
Testing monadic code with QuickCheck. Haskell 2002: 65-77 - 2001
- [c8]Koen Claessen, Mary Sheeran, Satnam Singh:
The Design and Verification of a Sorter Core. CHARME 2001: 355-369 - 2000
- [c7]Per Bjesse, Koen Claessen:
SAT-Based Verification without State Space Traversal. FMCAD 2000: 372-389 - [c6]Koen Claessen, John Hughes:
QuickCheck: a lightweight tool for random testing of Haskell programs. ICFP 2000: 268-279 - [c5]Koen Claessen, Peter Ljunglöf:
Typed Logical Variables in Haskell. Haskell 2000: 37 - 1999
- [c4]Koen Claessen, David Sands:
Observable Sharing for Functional Circuit Description. ASIAN 1999: 62-73 - 1998
- [c3]Per Bjesse, Koen Claessen, Mary Sheeran, Satnam Singh:
Lava: Hardware Design in Haskell. ICFP 1998: 174-184 - 1997
- [c2]Koen Claessen, Ton Vullinghs, Erik Meijer:
Structuring Graphical Paradigms in TkGofer. ICFP 1997: 251-262 - [c1]Koen Claessen:
Graphs in Compilation. ICFP 1997: 309
Editorship
- 2012
- [e2]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, ISBN 978-1-4503-1125-0 [contents] - 2011
- [e1]Koen Claessen:
Proceedings of the 4th ACM SIGPLAN Symposium on Haskell, Haskell 2011, Tokyo, Japan, 22 September 2011. ACM 2011, ISBN 978-1-4503-0860-1 [contents]
Informal and Other Publications
- 2024
- [i6]Robert Krook, Nicholas Smallbone, Bo Joel Svensson, Koen Claessen:
QuickerCheck: Implementing and Evaluating a Parallel Run-Time for QuickCheck. CoRR abs/2404.16062 (2024) - [i5]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 abs/2406.14787 (2024) - 2023
- [i4]Abhiroop Sarkar, Robert Krook, Alejandro Russo, Koen Claessen:
HasTEE: Programming Trusted Execution Environments with Haskell. CoRR abs/2307.13172 (2023) - 2019
- [i3]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 abs/1910.08306 (2019) - 2017
- [i2]Koen Claessen, Jonatan Kilhamn, Laura Kovács, Bengt Lennartson:
A Supervisory Control Algorithm Based on Property-Directed Reachability. CoRR abs/1711.06501 (2017) - 2014
- [i1]Moa Johansson, Dan Rosén, Nicholas Smallbone, Koen Claessen:
Hipster: Integrating Theory Exploration in a Proof Assistant. CoRR abs/1405.3426 (2014)
Coauthor Index
Nicholas Smallbone
aka: Nick Smallbone
aka: Nick Smallbone
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-17 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
