 | 2012 |
|---|
| 14 |       | Alexander Krauss,
Tobias Nipkow:
Proof Pearl: Regular Expression Equivalence and Relation Algebra.
J. Autom. Reasoning 49(1): 95-106 (2012) |
| 2011 |
|---|
| 13 | | Alexander Krauss,
Christian Sternagel,
René Thiemann,
Carsten Fuhs,
Jürgen Giesl:
Termination of Isabelle Functions via Termination of Rewriting.
ITP 2011: 152-167 |
| 12 | | Jasmin Christian Blanchette,
Alexander Krauss:
Monotonicity Inference for Higher-Order Formulas.
J. Autom. Reasoning 47(4): 369-398 (2011) |
| 2010 |
|---|
| 11 | | Jasmin Christian Blanchette,
Alexander Krauss:
Monotonicity Inference for Higher-Order Formulas.
IJCAR 2010: 91-106 |
| 10 | | Alexander Krauss,
Andreas Schropp:
A Mechanized Translation from Higher-Order Logic to Set Theory.
ITP 2010: 323-338 |
| 9 | | Alexander Krauss:
Recursive Definitions of Monadic Functions
PAR 2010: 1-13 |
| 8 | | Alexander Krauss,
Tobias Nipkow:
Regular Sets and Expressions.
Archive of Formal Proofs 2010: (2010) |
| 7 | | Alexander Krauss:
Partial and Nested Recursive Function Definitions in Higher-order Logic.
J. Autom. Reasoning 44(4): 303-336 (2010) |
| 2009 |
|---|
| 6 | | Alexander Krauss:
Automating recursive definitions and termination proofs in higher-order logic.
Technical University Munich 2009: 1-127 |
| 2008 |
|---|
| 5 | | Alexander Krauss:
Pattern minimization problems over recursive data types.
ICFP 2008: 267-274 |
| 4 | | Lukas Bulwahn,
Alexander Krauss,
Florian Haftmann,
Levent Erkök,
John Matthews:
Imperative Functional Programming with Isabelle/HOL.
TPHOLs 2008: 134-149 |
| 2007 |
|---|
| 3 | | Alexander Krauss:
Certified Size-Change Termination.
CADE 2007: 460-475 |
| 2 | | Lukas Bulwahn,
Alexander Krauss,
Tobias Nipkow:
Finding Lexicographic Orders for Termination Proofs in Isabelle/HOL.
TPHOLs 2007: 38-53 |
| 2006 |
|---|
| 1 | | Alexander Krauss:
Partial Recursive Functions in Higher-Order Logic.
IJCAR 2006: 589-603 |
Data released under the ODC-BY 1.0 license — See also our legal information page