Turning inductive into equational specifications

by Stefan Berghofer , Lukas Bulwahn , Florian Haftmann , Technische Universität München
Citations:7 - 5 self

Active Bibliography

α Code generation from Isabelle/HOL theories – Florian Haftmann
8 Structure of a proof-producing compiler for a subset of higher order logic – Guodong Li, Scott Owens, Konrad Slind - 2007
15 Verified Bytecode Subroutines – G. Klein, M. Wildmoser - 2003
Deductive Translation Validation for a Subset of Higher Order Logic – Guodong Li, Konrad Slind
9 Proofs, Programs and Executable Specifications in Higher Order Logic – Stefan Berghofer - 2003
5 Extracting a Formally Verified, Fully Executable Compiler From a Proof Assistant – Stefan Berghofer, Martin Strecker - 2002
6 Verified Bytecode Verification and Type-Certifying Compilation – Gerwin Klein, Martin Strecker - 2003
28 Formal Verification of a Java Compiler in Isabelle – Martin Strecker, Fakultät Für Informatik, Technische Universität München - 2002
LP with Flexible Grouping and Aggregates Using Modes – Marcin Czenko, Ro Etalle
28 Termination of Well-Moded Programs – S. Etalle, A. Bossi, N. Cocco - 1994
9 Layered Modes – Sandro Etalle, Maurizio Gabbrielli - 1999
DOI 10.1007/s10817-009-9148-3 Mechanized Semantics for the Clight Subset of the C Language – Rine Blazy Xavier Leroy
Mechanized – unknown authors
25 Mechanized Semantics for the Clight Subset of the C Language – Sandrine Blazy, Xavier Leroy
Contents – Jasmin Christian Blanchette - 2009
Proof Pearl: Mechanizing the Textbook Proof of Huffman’s Algorithm – Jasmin Christian Blanchette - 2009
1 An Isabelle/HOL Formalization of the Textbook Proof of Huffman’s Algorithm – Jasmin Christian Blanchette - 2009
Originality Statement – Rafal Kolanski
1 Reflecting Quantifier Elimination for Linear Arithmetic – Tobias Nipkow