Koen Lindström Claessen

Professor vid Chalmers, Data- och informationsteknik, Funktionell programmering

Visar 86 publikationer

2018

Automatic test suite generation for PMCFG grammars

Inari Listenmaa, Koen Lindström Claessen
Konferensbidrag (offentliggjort, men ej förlagsutgivet)
2017

Quick Specifications for the Busy Programmer

Nicholas Smallbone, Moa Johansson, Koen Lindström Claessen et al
Journal of Functional Programming. Vol. 27
Artikel i vetenskaplig tidskrift
2017

QuickSpec: A Lightweight Theory Exploration Tool for Programmers

Maximilian Algehed, Koen Lindström Claessen, Moa Johansson et al
SIGPLAN Notices (ACM Special Interest Group on Programming Languages). Vol. 52 (10), p. 38-39
Paper i proceeding
2017

A supervisory control algorithm based on property-directed reachability

Koen Lindström Claessen, Jonatan Kilhamn, Laura Kovacs et al
Lecture Notes in Computer Science. Vol. 10629 LNCS, p. 115-130
Paper i proceeding
2016

Handling common transitive relations in first-order automated reasoning

Koen Lindström Claessen, Ann Lillieström
CEUR Workshop Proceedings. Vol. 1635, p. 11-23
Paper i proceeding
2016

Analysing constraint grammars with a SAT-solver

Inari Listenmaa, Koen Lindström Claessen
10th International Conference on Language Resources and Evaluation, LREC 2016; Grand Hotel Bernardin Conference CenterPortoroz; Slovenia; 23 May 2016 through 28 May 2016, p. 699-706
Paper i proceeding
2016

Analysing Constraint Grammars with a SAT-solver

Inari Listenmaa, Koen Lindström Claessen
, p. 699-706
Paper i proceeding
2015

Generating constrained random data with uniform distribution

Koen Lindström Claessen, Jonas Almström Duregård, Michal Palka
Journal of Functional Programming. Vol. 25 (e8)
Artikel i vetenskaplig tidskrift
2015

TIP: Tons of Inductive Problems

Koen Lindström Claessen, Moa Johansson, Dan Rosén et al
Lecture Notes in Computer Science. Vol. 9150, p. 332-336
Paper i proceeding
2015

SAT modulo intuitionistic implications

Koen Lindström Claessen, Dan Rosén
Lecture Notes in Computer Science. Vol. 9450, p. 622-637
Paper i proceeding
2015

Constraint Grammar as a SAT problem

Inari Listenmaa, Koen Lindström Claessen
(113), p. 24-27
Paper i proceeding
2015

Efficient Parallel and Incremental Parsing

Jean-Philippe Bernardy, Koen Lindström Claessen
Journal of Functional Programming
Artikel i vetenskaplig tidskrift
2015

Making Random Judgments: Automatically Generating Well-Typed Terms from the Definition of a Type-System

B. Fetscher, Koen Lindström Claessen, Michal Palka et al
Lecture Notes in Computer Science. Vol. 9032, p. 383-405
Paper i proceeding
2015

Efficient parallel and incremental parsing of practical context-free languages

Jean-Philippe Bernardy, Koen Lindström Claessen
Journal of Functional Programming. Vol. 25, p. Article Number: UNSP e10-
Artikel i vetenskaplig tidskrift
2015

Practical Principled FRP Forget the Past, Change the Future, FRPNow!

Atze van der Ploeg, Koen Lindström Claessen
SIGPLAN Notices (ACM Special Interest Group on Programming Languages). Vol. 50 (9), p. 302-314
Paper i proceeding
2015

Linearly ordered attribute grammar scheduling using SAT-solving

J. Bransen, L.T. Van Binsbergen, Koen Lindström Claessen et al
Lecture Notes in Computer Science. Vol. 9035, p. 289-303
Paper i proceeding
2014

A seamless, client-centric programming model for type safe web applications

Anton Ekblad, Koen Lindström Claessen
6th ACM SIGPLAN Haskell Symposium, Haskell 2014; Gothenburg; Sweden; 4 September 2014 through 5 September 2014, p. 79-89
Paper i proceeding
2014

Generating Constrained Random Data with Uniform Distribution

Koen Lindström Claessen, Jonas Almström Duregård, Michal Palka
Lecture Notes in Computer Science. Vol. 8475, p. 18-34
Paper i proceeding
2014

Hipster: Integrating theory exploration in a proof assistant

Moa Johansson, Dan Rosén, Nicholas Smallbone et al
Lecture Notes in Computer Science. Vol. 8543, p. 108-122
Paper i proceeding
2013

Efficient Divide-and-Conquer Parsing of Practical Context-Free Languages

Jean-Philippe Bernardy, Koen Lindström Claessen
SIGPLAN Notices (ACM Special Interest Group on Programming Languages). Vol. 48 (9), p. 111-122
Artikel i vetenskaplig tidskrift
2013

HALO: Haskell to Logic through Denotational Semantics

D. Vytiniotis, S. P. Jones, Dan Rosén et al
SIGPLAN Notices (ACM Special Interest Group on Programming Languages). Vol. 48 (1), p. 431-442
Artikel i vetenskaplig tidskrift
2013

Automating Inductive Proofs using Theory Exploration

Koen Lindström Claessen, Dan Rosén, Moa Johansson et al
Lecture Notes in Computer Science. Vol. 7898, p. 392-406
Paper i proceeding
2013

HALO: Haskell to logic through denotational semantics

Dimitrios Vytiniotis, Simon L. Peyton-Jones, Dan Rosén et al
Conference Record of the Annual ACM Symposium on Principles of Programming Languages, p. 431-442
Paper i proceeding
2013

Splittable pseudorandom number generators using cryptographic hashing

Koen Lindström Claessen, Michal Palka
ACM SIGPLAN Notices. Vol. 48 (12), p. 47-58
Artikel i övriga tidskrifter
2013

Model-checking signal transduction networks through decreasing reachability sets

Koen Lindström Claessen, J.P. Fisher, S.S. Ishtiaq et al
Lecture Notes in Computer Science. Vol. 0302-9743, p. 85-100
Paper i proceeding
2013

Using Circular Programs for Higher-Order Syntax Functional pearl

Emil Axelsson, Koen Lindström Claessen
SIGPLAN Notices (ACM Special Interest Group on Programming Languages). Vol. 48 (9), p. 257-262
Artikel i vetenskaplig tidskrift
2013

A circuit approach to LTL model checking

Koen Lindström Claessen, Niklas Een, B. Sterin
13th International Conference on Formal Methods in Computer-Aided Design, FMCAD 2013; Portland, OR; United States; 20 October 2013 through 23 October 2013, p. 53-60
Paper i proceeding
2013

Using circular programs for higher-order syntax: Functional pearl

Emil Axelsson, Koen Lindström Claessen
Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP, p. 257-262
Paper i proceeding
2013

Efficient divide-and-conquer parsing of practical context-free languages

Jean-Philippe Bernardy, Koen Lindström Claessen
Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP, p. 111-122
Paper i proceeding
2013

Splittable Pseudorandom Number Generators using Cryptographic Hashing

Koen Lindström Claessen, Michal Palka
Proceedings of the Haskell Symposium 2013, p. 47-58
Paper i proceeding
2012

Expressive array constructs in an embedded GPU kernel programming language

Koen Lindström Claessen, Mary Sheeran, Joel Bo Svensson
Proceedings of the 7th workshop on Declarative aspects and applications of multicore programming, DAMP'12, p. 21-30
Paper i proceeding
2012

Shrinking and showing functions (Functional pearl)

Koen Lindström Claessen
SIGPLAN Notices (ACM Special Interest Group on Programming Languages). Vol. 47 (12), p. 73-80
Paper i proceeding
2012

A liveness checking algorithm that counts

Koen Lindström Claessen, Niklas Sörensson
2012 Formal Methods in Computer-Aided Design, FMCAD 2012, p. 52-59
Paper i proceeding
2012

The TPTP typed first-order form with arithmetic

G. Sutcliffe, S. Schulz, Koen Lindström Claessen et al
Lecture Notes in Computer Science. Vol. 7180, p. 406-419
Paper i proceeding
2011

QuickCheck: a lightweight tool for random testing of Haskell programs

Koen Lindström Claessen, John Hughes
SIGPLAN Notices (ACM Special Interest Group on Programming Languages). Vol. 46 (4), p. 53-64
Artikel i vetenskaplig tidskrift
2011

Testing an Optimising Compiler by Generating Random Lambda Terms

Michal Palka, Koen Lindström Claessen, Alejandro Russo et al
International Workshop on Automation of Software Test
Paper i proceeding
2011

The Design and Implementation of Feldspar: An Embedded Language for Digital Signal Processing

Emil Axelsson, Koen Lindström Claessen, Mary Sheeran et al
Lecture Notes in Computer Science. Vol. 6647, p. 121-136
Paper i proceeding
2011

Automated Inference of Finite Unsatisfiability

Koen Lindström Claessen, Ann Lillieström
Journal of Automated Reasoning. Vol. 47 (2), p. 111-132
Artikel i vetenskaplig tidskrift
2011

Obsidian: A Domain Specific Embedded Language for Parallel Programming of Graphics Processors

Joel Bo Svensson, Mary Sheeran, Koen Lindström Claessen
Lecture Notes in Computer Science. Vol. 5836, p. 156-173
Paper i proceeding
2011

Sort it out with monotonicity: translating between many-sorted and unsorted first-order logic

Koen Lindström Claessen, Ann Lillieström, Nicholas Smallbone
Lecture Notes in Computer Science, p. 207-221
Paper i proceeding
2010

GPGPU Kernel Implementation and Refinement using Obsidian

Joel Bo Svensson, Mary Sheeran, Koen Lindström Claessen
ICCS 2010 conference proceedings; Amsterdam, NETHERLANDS, MAY 31-JUN 02, 2010. Vol. 1 (1), p. 2059-2068
Paper i proceeding
2010

Generating counterexamples for structural inductions by exploiting nonstandard models

J.C. Blanchette, Koen Lindström Claessen
Lecture Notes in Computer Science. Vol. 6397, p. 127-141
Paper i proceeding
2010

GPGPU Kernel Implementation using an Embedded Language: a Status Report

Joel Bo Svensson, Koen Lindström Claessen, Mary Sheeran
Rapport
2010

Chalk: a language and tool for architecture design and analysis

Wouter Swierstra, Koen Lindström Claessen, Carl Seger et al
Workshop on Designing Correct Circuits, associated with ETAPS
Konferensbidrag (offentliggjort, men ej förlagsutgivet)
2010

Feldspar: A Domain Specific Language for Digital Signal Processing algorithms

Emil Axelsson, Koen Lindström Claessen, Gergely Dévai et al
Eighth ACM/IEEE International Conference on Formal Methods and Models for Codesign, p. 169-178
Paper i proceeding
2010

QuickSpec: Guessing Formal Specifications using Testing

Koen Lindström Claessen, Nicholas Smallbone, John Hughes
Lecture Notes in Computer Science. Vol. 6143, p. 6-21
Paper i proceeding
2010

The Design and Implementation of Feldspar: an Embedded Language for Digital Signal Processing

Emil Axelsson, Koen Lindström Claessen, Mary Sheeran et al
IFL 2010, the 22nd Symposium on Implementation and Application of Functional Languages
Konferensbidrag (offentliggjort, men ej förlagsutgivet)
2010

Testing Polymorphic Properties

Jean-Philippe Bernardy, Patrik Jansson, Koen Lindström Claessen
Lecture Notes in Computer Science. Vol. 6012, p. 125-144
Paper i proceeding
2010

Ranking programs using black box testing

Koen Lindström Claessen, John Hughes, Michal Palka et al
Proceedings - International Conference on Software Engineering, p. 103-110
Paper i proceeding
2009

Finding Race Conditions in Erlang with Quick Check and PULSE

Koen Lindström Claessen, Michal Palka, Nicholas Smallbone et al
ICFP'09: Proceedings of the ACM SIGPLAN International Conference on Functional Programming, p. 149-160
Paper i proceeding
2009

Static contract checking for haskell

D. N. Xu, S. P. Jones, Koen Lindström Claessen
Conference Record of the Annual ACM Symposium on Principles of Programming Languages, p. 41-52
Paper i proceeding
2009

A Library for Light-Weight Information-Flow Security in Haskell

Alejandro Russo, Koen Lindström Claessen, John Hughes
SIGPLAN Notices (ACM Special Interest Group on Programming Languages). Vol. 44 (2), p. 13-24
Artikel i vetenskaplig tidskrift
2009

Static Contract Checking for Haskell

D. N. Xu, S. P. Jones, Koen Lindström Claessen
SIGPLAN Notices (ACM Special Interest Group on Programming Languages). Vol. 44 (1), p. 41-52
Artikel i vetenskaplig tidskrift
2009

High level architectural modelling for early estimation of power and performance

Koen Lindström Claessen, Carl Seger, Mary Sheeran et al
Workshop on Hardware Design and Functional Languages, associated with ETAPS
Konferensbidrag (offentliggjort, men ej förlagsutgivet)
2009

Finding race conditions in erlang with quickcheck and PULSE

Koen Lindström Claessen, Michal Palka, Nicholas Smallbone et al
ACM SIGPLAN Notices. Vol. 44 (9), p. 149-160
Artikel i vetenskaplig tidskrift
2009

A FAITHFUL SEMANTICS FOR GENERALISED SYMBOLIC TRAJECTORY EVALUATION

Koen Lindström Claessen, J. W. Roorda
Logical Methods in Computer Science. Vol. 5 (2), p. 1 (artno)-
Artikel i vetenskaplig tidskrift
2009

SAT-Solving in Practice, with a Tutorial Example from Supervisory Control

Koen Lindström Claessen, Niklas Een, Mary Sheeran et al
Discrete Event Dynamic Systems: Theory and Applications. Vol. 19 (4), p. 495-524
Artikel i vetenskaplig tidskrift
2008

A Library for Light-Weight Information-Flow Security in Haskell

Alejandro Russo, Koen Lindström Claessen, John Hughes
1st ACM SIGPLAN Haskell Symposium, Haskell'08; Victoria, BC; Canada; 25 September 2008 through 25 September 2008, p. 13-24
Paper i proceeding
2008

Finding Counter Examples in Induction Proofs

Koen Lindström Claessen, Hans Svensson
Lecture Notes in Computer Science
Paper i proceeding
2008

SAT-Solving in Practice

Koen Lindström Claessen, Niklas Een, Mary Sheeran et al
9th International Workshop on Discrete Event Systems, WODES' 08; Goteborg; Sweden; 28 May 2008 through 30 May 2008, p. 61-67
Paper i proceeding
2008

Obsidian: An Embedded Language for Data-Parallel Programming

Joel Bo Svensson, Koen Lindström Claessen, Mary Sheeran
Int. Workshop on Designing Correct Circuits, DCC'08, associated with ETAPS
Konferensbidrag (offentliggjort, men ej förlagsutgivet)
2007

Embedded Hardware Description Languages: Exploring the Design Space

Koen Lindström Claessen, Gordon Pace
Hardware Design and Functional Languages
Paper i proceeding
2007

A Coverage Analysis for Safety Property Lists

Koen Lindström Claessen
Conference on Formal Methods for Computer Aided Design (FMCAD), Austin, TX, NOV 11-14, 2007, p. 139-145
Paper i proceeding
2006

SAT-based Assistance in Abstraction Refinement for Symbolic Trajectory Evaluation

Jan-Willem Roorda, Koen Lindström Claessen
Preprint
2006

A Faithful Semantics for Generalised Symbolic Trajectory Evaluation

Jan-Willem Roorda, Koen Lindström Claessen
Preprint
2006

Using Lava and Wired for Design Exploration

Emil Axelsson, Koen Lindström Claessen, Mary Sheeran
Artikel i övriga tidskrifter
2006

Explaining Symbolic Trajectory Evaluation by Giving It a Faithful Semantics.

Jan-Willem Roorda, Koen Lindström Claessen
Proceedings of the First International Computer Science Symposium in Russia, (CSR 2006) Lecture Notes in Computer Science. Vol. 3967, p. 555-566
Artikel i vetenskaplig tidskrift
2006

SAT-based Assistance in Abstraction Refinement for Symbolic Trajectory Evaluation

Jan-Willem Roorda, Koen Lindström Claessen
Proceedings of the 18th International Conference on Computer Aided Verification, (CAV 2006) Lecture Notes in Computer Science. Vol. 4144, p. 175-189
Artikel i vetenskaplig tidskrift
2006

An Introduction to Symbolic Trajectory Evaluation

Koen Lindström Claessen, Jan-Willem Roorda
Lecture notes of the sixth International School on Formal Methods for the Design of Computer, Communication and Software Systems: Hardware Verification, Lecture Notes in Computer Science. Vol. 3965
Kapitel i bok
2005

A Semantics for Distributed Erlang

Koen Lindström Claessen, Hans Svensson
Proceedings of the ACM SIGPLAN 2005 Erlang Workshop
Paper i proceeding
2005

Semi-Formal Development of a Fault-Tolerant Leader Election Protocol in Erlang

Koen Lindström Claessen, Hans Svensson, Thomas Arts
Lecture Notes in Computer Science. Vol. 3395, p. 140-154
Artikel i vetenskaplig tidskrift
2005

A new SAT-based Algorithm for Symbolic Trajectory Evaluation

Jan-Willem Roorda, Koen Lindström Claessen
Proceedings of Correct Hardware Design and Verification Methods 2005, (CHARME 2005). Vol. 3725, p. 238-253
Paper i proceeding
2005

Wired: Wire-Aware Circuit Design

Emil Axelsson, Koen Lindström Claessen, Mary Sheeran
Correct Hardware Design and Verification Methods. Vol. 3725, p. 5-19
Paper i proceeding
2005

Testing Implementations of Formally Verified Algorithms

Thomas Arts, Koen Lindström Claessen, John Hughes et al
Proceedings of the 5th Conference on Software Engineering Research and Practice in Sweden
Paper i proceeding
2004

Wired - a Language for Describing Non-Functional Properties of Digital Circuits

Emil Axelsson, Mary Sheeran, Koen Lindström Claessen
Proceedings of International Workshop on Designing Correct Circuits. Barcelona, Spain, March 2004
Konferensbidrag (offentliggjort, men ej förlagsutgivet)
2004

An Operational Semantics for Weak PSL

Koen Lindström Claessen, Johan Mårtensson
Lecture Notes in Computer Science. Vol. 3312, p. 337-351
Artikel i vetenskaplig tidskrift
2004

Parallel Parsing Processes

Koen Lindström Claessen
Journal of Functional Programming. Vol. 14 (6), p. 741--757-
Artikel i vetenskaplig tidskrift
2003

Functional Hardware Description in Lava

Koen Lindström Claessen, Mary Sheeran, Satnam Singh
Kapitel i bok
2003

New Techniques that Improve MACE-style Model Finding

Koen Lindström Claessen, Niklas Sörensson
Model Computation
Paper i proceeding
2003

Safety Property Verification of Cyclic Synchronous Circuits

Koen Lindström Claessen
Electronic Notes in Theoretical Computer Science. Vol. 88, p. 55-69
Paper i proceeding
2003

Specification-Based Testing with QuickCheck

John Hughes, Koen Lindström Claessen
The fun of programming - edited by Jeremy Gibbons and Oege de Moor, p. 17-40
Kapitel i bok
2002

Testing monadic code with QuickCheck

Koen Lindström Claessen, John Hughes
SIGPLAN Notices (ACM Special Interest Group on Programming Languages). Vol. 37 (12), p. 47-59
Paper i proceeding
2001

Embedded Languages for Describing and Verifying Hardware

Koen Lindström Claessen
Doktorsavhandling
2000

An embedded language approach to hardware description and verification

Koen Lindström Claessen
Licentiatavhandling
2000

QuickCheck: A lightweight tool for random testing of Haskell programs

Koen Lindström Claessen, John Hughes
5th ACM SIGPLAN International Conference on Functional Programming (ICFP'00); Montreal, Que, Can; ; 18 September 2000 through 21 September 2000. Vol. 35 (9), p. 268-279
Paper i proceeding
2000

Typed logical variables in Haskell

Koen Lindström Claessen, Peter Ljunglöf
Electronic Notes in Theoretical Computer Science. Vol. 41 (1)
Artikel i vetenskaplig tidskrift

Spara referenser

Om du har installerat Zotero eller Mendeley på din dator kan du direkt ta ut referenser från de publikationer du ser i listan.

Du laddar ner dessa pluginer här:
Zotero
Mendeley

Visar 4 forskningsprojekt

2018–

Octopi: Säker Programmering för Sakernas Internet

Alejandro Russo Informationssäkerhet
John Hughes Funktionell programmering
Mary Sheeran Funktionell programmering
Koen Lindström Claessen Funktionell programmering
Carl-Johan Seger Funktionell programmering
Stiftelsen för Strategisk forskning (SSF)

2012–2012

Development of automated methods for specification extraction from programs

Koen Lindström Claessen Programvaruteknik
Dan Rosén Programvaruteknik
Microsoft Research

2014–2017

Bevisbaserad Testning - Bevistekniker som gör det möjligt att testa komplicerade algoritmer automatiskt

Koen Lindström Claessen Programvaruteknik
Vetenskapsrådet (VR)

2017–2022

Systematisk testning av cyberfysiska system (SyTeC)

John Hughes Funktionell programmering
Koen Lindström Claessen Funktionell programmering
Martin Fabian Automation
Mary Sheeran Funktionell programmering
Bengt Lennartson Automation
Nicholas Smallbone Funktionell programmering
Zahra Ramezani Automation
Knut Åkesson Automation
Vetenskapsrådet (VR)

Det kan finnas fler projekt där Koen Lindström Claessen medverkar, men du måste vara inloggad som anställd på Chalmers för att kunna se dem.