|
|
α Code generation from Isabelle/HOL theories
– Florian Haftmann
|
|
6
|
Structure of a proof-producing compiler for a subset of higher order logic
– Guodong Li, Scott Owens, Konrad Slind
- 2007
|
|
12
|
Verified Bytecode Subroutines
– G. Klein, M. Wildmoser
- 2003
|
|
|
Deductive Translation Validation for a Subset of Higher Order Logic
– Guodong Li, Konrad Slind
|
|
8
|
Proofs, Programs and Executable Specifications in Higher Order Logic
– Technische Universität München, Technische Universität München, Stefan Berghofer, Stefan Berghofer
- 2003
|
|
3
|
Extracting a Formally Verified, Fully Executable Compiler From a Proof Assistant
– Stefan Berghofer, Martin Strecker
- 2002
|
|
5
|
Verified Bytecode Verification and Type-Certifying Compilation
– Gerwin Klein, Martin Strecker, Technische Universität München, Fakultät Für Informatik, D- Garching
- 2003
|
|
24
|
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
|
|
8
|
Layered Modes
– Sandro Etalle, Maurizio Gabbrielli
- 1999
|
|
26
|
Termination of Well-Moded Programs
– S. Etalle, A. Bossi, N. Cocco
- 1994
|
|
|
DOI 10.1007/s10817-009-9148-3 Mechanized Semantics for the Clight Subset of the C Language
– Rine Blazy Xavier Leroy
|
|
|
Originality Statement
– Rafal Kolanski
|
|
|
Mechanized
– unknown authors
|
|
16
|
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
|
|
2
|
Satisfiability modulo recursive programs
– Ali Sinan Köksal, Viktor Kuncak
- 2011
|
