Koen Claessen
Showing 107 publications
HasTEE - Programming Trusted Execution Environments with Haskell
Creating a Language for Writing Real-Time Applications for the Internet of Things
Testing Cyber-Physical Systems Using a Line-Search Falsification Method
Handling Transitive Relations in First-Order Automated Reasoning
SAT modulo discrete event simulation applied to railway design capacity analysis
Towards Secure IoT Programming in Haskell
Multiple Objective Functions for Falsification of Cyber-Physical Systems
Finger trees explained anew, and slightly simplified (functional pearl)
Enhancing Temporal Logic Falsification with Specification Transformation and Valued Booleans
Safety at speed: in-place array algorithms from pure functional programs by safely re-using storage
Testing Safety PLCs Using QuickCheck
Automated Drawing of Railway Schematics Using Numerical Optimization in SAT
Inferring Morphological Rules from Small Examples using 0/1 Linear Programming
Automatic test suite generation for PMCFG grammars
Applying valued booleans in testing of cyber-physical systems
Efficient Encodings of First-Order Horn Formulas in Equational Logic
Design-Time Railway Capacity Verification using SAT modulo Discrete Event Simulation
Using Valued Booleans to Find Simpler Counterexamples in Random Testing of Cyber-Physical Systems
QuickSpec: a lightweight theory exploration tool for programmers (system demonstration)
Quick Specifications for the Busy Programmer
A supervisory control algorithm based on property-directed reachability
QuickSpec: A lightweight theory exploration tool for programmers (system demonstration)
Using fusion to enable late design decisions for pipelined computations
Analysing constraint grammars with a SAT-solver
The Key monad: Type-safe unconstrained dynamic typing
Handling common transitive relations in first-order automated reasoning
Linearly ordered attribute grammar scheduling using SAT-solving
Practical Principled FRP Forget the Past, Change the Future, FRPNow!
TIP: Tons of Inductive Problems
Efficient Parallel and Incremental Parsing
Generating constrained random data with uniform distribution
Practical principled FRP: Forget the past, change the future, FRPNow!
SAT modulo intuitionistic implications
Constraint Grammar as a SAT problem
Efficient parallel and incremental parsing of practical context-free languages
Hipster: Integrating theory exploration in a proof assistant
A seamless, client-centric programming model for type safe web applications
Splittable pseudorandom number generators using cryptographic hashing
Generating Constrained Random Data with Uniform Distribution
HALO: Haskell to Logic through Denotational Semantics
Efficient Divide-and-Conquer Parsing of Practical Context-Free Languages
HALO: Haskell to logic through denotational semantics
Splittable Pseudorandom Number Generators using Cryptographic Hashing
Efficient divide-and-conquer parsing of practical context-free languages
A circuit approach to LTL model checking
Using Circular Programs for Higher-Order Syntax Functional pearl
Automating Inductive Proofs using Theory Exploration
Model-checking signal transduction networks through decreasing reachability sets
Using circular programs for higher-order syntax: Functional pearl
Expressive array constructs in an embedded GPU kernel programming language
Shrinking and showing functions (Functional pearl)
A liveness checking algorithm that counts
The TPTP typed first-order form with arithmetic
Obsidian: A Domain Specific Embedded Language for Parallel Programming of Graphics Processors
The Design and Implementation of Feldspar: An Embedded Language for Digital Signal Processing
Sort it out with monotonicity: translating between many-sorted and unsorted first-order logic
Testing an Optimising Compiler by Generating Random Lambda Terms
QuickCheck: a lightweight tool for random testing of Haskell programs
Automated Inference of Finite Unsatisfiability
Testing Polymorphic Properties
Ranking programs using black box testing
Chalk: a language and tool for architecture design and analysis
GPGPU Kernel Implementation and Refinement using Obsidian
Feldspar: A Domain Specific Language for Digital Signal Processing algorithms
The Design and Implementation of Feldspar: an Embedded Language for Digital Signal Processing
GPGPU Kernel Implementation using an Embedded Language: a Status Report
Generating counterexamples for structural inductions by exploiting nonstandard models
QuickSpec: Guessing Formal Specifications using Testing
Finding Race Conditions in Erlang with QuickCheck and PULSE
High level architectural modelling for early estimation of power and performance
SAT-Solving in Practice, with a Tutorial Example from Supervisory Control
Static contract checking for haskell
A Library for Light-Weight Information-Flow Security in Haskell
Static Contract Checking for Haskell
Finding Race Conditions in Erlang with Quick Check and PULSE
A FAITHFUL SEMANTICS FOR GENERALISED SYMBOLIC TRAJECTORY EVALUATION
Finding race conditions in erlang with quickcheck and PULSE
Finding Counter Examples in Induction Proofs
A Library for Light-Weight Information-Flow Security in Haskell
Obsidian: An Embedded Language for Data-Parallel Programming
Embedded Hardware Description Languages: Exploring the Design Space
A Coverage Analysis for Safety Property Lists
Using Lava and Wired for Design Exploration
Explaining Symbolic Trajectory Evaluation by Giving It a Faithful Semantics.
SAT-based Assistance in Abstraction Refinement for Symbolic Trajectory Evaluation
An Introduction to Symbolic Trajectory Evaluation
SAT-based Assistance in Abstraction Refinement for Symbolic Trajectory Evaluation
A Faithful Semantics for Generalised Symbolic Trajectory Evaluation
A new SAT-based Algorithm for Symbolic Trajectory Evaluation
Wired: Wire-Aware Circuit Design
Semi-Formal Development of a Fault-Tolerant Leader Election Protocol in Erlang
A Semantics for Distributed Erlang
Testing Implementations of Formally Verified Algorithms
Wired - a Language for Describing Non-Functional Properties of Digital Circuits
An Operational Semantics for Weak PSL
Specification-Based Testing with QuickCheck
Safety Property Verification of Cyclic Synchronous Circuits
New Techniques that Improve MACE-style Model Finding
Functional Hardware Description in Lava
Testing monadic code with QuickCheck
Embedded Languages for Describing and Verifying Hardware
An embedded language approach to hardware description and verification
QuickCheck: A lightweight tool for random testing of Haskell programs
Typed logical variables in Haskell
Download publication list
You can download this list to your computer.
Filter and download publication list
As logged in user (Chalmers employee) you find more export functions in MyResearch.
You may also import these directly to Zotero or Mendeley by using a browser plugin. These are found herer:
Zotero Connector
Mendeley Web Importer
The service SwePub offers export of contents from Research in other formats, such as Harvard and Oxford in .RIS, BibTex and RefWorks format.
Showing 5 research projects
Octopi: Secure Programming for the Internet of Things
Octopi: Säker Programering för Sakernas Internet
Systematic testing of cyber-physical systems (SyTeC)
Proof-based Testing - Using Proof Techniques to Enable Automated Testing of Complex Algorithms
Development of automated methods for specification extraction from programs