The following pages link to Koen Claessen (Q438538):
Displaying 35 items.
- Automated inference of finite unsatisfiability (Q438540) (← links)
- SAT-solving in practice, with a tutorial example from supervisory control (Q843991) (← links)
- Efficient encodings of first-order Horn formulas in equational logic (Q1799100) (← links)
- SAT modulo discrete event simulation applied to railway design capacity analysis (Q2058381) (← links)
- Handling transitive relations in first-order automated reasoning (Q2069868) (← links)
- The TPTP Typed First-Order Form with Arithmetic (Q2891471) (← links)
- HALO (Q2931819) (← links)
- Practical principled FRP: forget the past, change the future, FRPNow! (Q2981974) (← links)
- Explaining Symbolic Trajectory Evaluation by Giving It a Faithful Semantics (Q3434722) (← links)
- TIP: Tons of Inductive Problems (Q3453129) (← links)
- SAT Modulo Intuitionistic Implications (Q3460091) (← links)
- Testing Polymorphic Properties (Q3558219) (← links)
- Using the TPTP Language for Writing Derivations and Finite Interpretations (Q3613401) (← links)
- A Faithful Semantics for Generalised Symbolic Trajectory Evaluation (Q3636800) (← links)
- FUNCTIONAL PEARL <i>Parallel Parsing Processes</i> (Q4660270) (← links)
- (Q4787245) (← links)
- Automating Inductive Proofs Using Theory Exploration (Q4928454) (← links)
- Generating Counterexamples for Structural Inductions by Exploiting Nonstandard Models (Q4933301) (← links)
- A poor man's concurrency monad (Q4934240) (← links)
- Automated Inference of Finite Unsatisfiability (Q5191115) (← links)
- The Anatomy of Equinox – An Extensible Automated Reasoning Tool for First-Order Logic and Beyond (Q5200011) (← links)
- Sort It Out with Monotonicity (Q5200026) (← links)
- Efficient divide-and-conquer parsing of practical context-free languages (Q5244794) (← links)
- Using circular programs for higher-order syntax (Q5244805) (← links)
- Static contract checking for Haskell (Q5261504) (← links)
- Efficient parallel and incremental parsing of practical context-free languages (Q5371946) (← links)
- Generating constrained random data with uniform distribution (Q5371949) (← links)
- Quick specifications for the busy programmer (Q5371995) (← links)
- Finding Counter Examples in Induction Proofs (Q5458810) (← links)
- Formal Methods in Computer-Aided Design (Q5492991) (← links)
- Correct Hardware Design and Verification Methods (Q5493212) (← links)
- Correct Hardware Design and Verification Methods (Q5493230) (← links)
- Hipster: Integrating Theory Exploration in a Proof Assistant (Q5495917) (← links)
- Formal Approaches to Software Testing (Q5710639) (← links)
- Formal Methods for Hardware Verification (Q5899153) (← links)
