| Publication | Date of Publication | Type |
|---|
Handling transitive relations in first-order automated reasoning
Journal of Automated Reasoning | 2022-01-21 | Paper |
SAT modulo discrete event simulation applied to railway design capacity analysis
Formal Methods in System Design | 2021-12-08 | Paper |
| Efficient encodings of first-order Horn formulas in equational logic | 2018-10-18 | Paper |
Efficient parallel and incremental parsing of practical context-free languages
Journal of Functional Programming | 2017-10-23 | Paper |
Quick specifications for the busy programmer
Journal of Functional Programming | 2017-10-23 | Paper |
Generating constrained random data with uniform distribution
Journal of Functional Programming | 2017-10-23 | Paper |
Practical principled FRP: forget the past, change the future, FRPNow!
Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming | 2017-05-10 | Paper |
SAT modulo intuitionistic implications
Logic for Programming, Artificial Intelligence, and Reasoning | 2016-01-12 | Paper |
TIP: tons of inductive problems
Lecture Notes in Computer Science | 2015-11-20 | Paper |
Static contract checking for Haskell
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2015-07-03 | Paper |
Efficient divide-and-conquer parsing of practical context-free languages
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming | 2015-03-30 | Paper |
Using circular programs for higher-order syntax (functional pearl)
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming | 2015-03-30 | Paper |
HALO, Haskell to logic through denotational semantics
Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2014-11-27 | Paper |
Hipster: integrating theory exploration in a proof assistant
Lecture Notes in Computer Science | 2014-08-07 | Paper |
Automating Inductive Proofs Using Theory Exploration
Automated Deduction – CADE-24 | 2013-06-14 | Paper |
Automated inference of finite unsatisfiability
Journal of Automated Reasoning | 2012-07-31 | Paper |
The TPTP typed first-order form with arithmetic
Logic for Programming, Artificial Intelligence, and Reasoning | 2012-06-15 | Paper |
Sort it out with monotonicity. Translating between many-sorted and unsorted first-order logic
Lecture Notes in Computer Science | 2011-07-29 | Paper |
The anatomy of Equinox -- an extensible automated reasoning tool for first-order logic and beyond (talk abstract)
Lecture Notes in Computer Science | 2011-07-29 | Paper |
Generating counterexamples for structural inductions by exploiting nonstandard models
Logic for Programming, Artificial Intelligence, and Reasoning | 2010-10-12 | Paper |
Testing polymorphic properties
Programming Languages and Systems | 2010-05-04 | Paper |
SAT-solving in practice, with a tutorial example from supervisory control
Discrete Event Dynamic Systems | 2010-01-18 | Paper |
Automated Inference of Finite Unsatisfiability
Automated Deduction – CADE-22 | 2009-07-28 | Paper |
A Faithful Semantics for Generalised Symbolic Trajectory Evaluation
Logical Methods in Computer Science | 2009-06-30 | Paper |
Using the TPTP Language for Writing Derivations and Finite Interpretations
Automated Reasoning | 2009-03-12 | Paper |
Finding Counter Examples in Induction Proofs
Tests and Proofs | 2008-04-24 | Paper |
Explaining Symbolic Trajectory Evaluation by Giving It a Faithful Semantics
Computer Science – Theory and Applications | 2007-05-02 | Paper |
Formal Methods for Hardware Verification
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Correct Hardware Design and Verification Methods
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Formal Methods in Computer-Aided Design
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Correct Hardware Design and Verification Methods
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Formal Approaches to Software Testing
Lecture Notes in Computer Science | 2005-12-02 | Paper |
FUNCTIONAL PEARL <i>Parallel Parsing Processes</i>
Journal of Functional Programming | 2005-03-21 | Paper |
| scientific article; zbMATH DE number 1852169 (Why is no real title available?) | 2003-01-09 | Paper |
A poor man's concurrency monad
Journal of Functional Programming | 2000-01-17 | Paper |
