Results 1 
5 of
5
Turning inductive into equational specifications
"... Abstract. Inductively defined predicates are frequently used in formal specifications. Using the theorem prover Isabelle, we describe an approach to turn a class of systems of inductively defined predicates into a system of equations using data flow analysis; the translation is carried out inside th ..."
Abstract

Cited by 9 (6 self)
 Add to MetaCart
(Show Context)
Abstract. Inductively defined predicates are frequently used in formal specifications. Using the theorem prover Isabelle, we describe an approach to turn a class of systems of inductively defined predicates into a system of equations using data flow analysis; the translation is carried out inside the logic and resulting equations can be turned into functional program code in SML, OCaml or Haskell using the existing code generator of Isabelle. Thus we extend the scope of code generation in Isabelle from functional to functionallogic programs while leaving the trusted foundations of code generation itself intact. 1
Author manuscript, published in "Journal of Automated Reasoning (2011)" DOI: 10.1007/s1081701192261 Journal of Automated Reasoning manuscript No.
, 2012
"... (will be inserted by the editor) A listmachine benchmark for mechanized metatheory ..."
Abstract
 Add to MetaCart
(Show Context)
(will be inserted by the editor) A listmachine benchmark for mechanized metatheory
Predicates in Isabelle/HOL
, 2009
"... This thesis presents a compiler from inductive predicates to executable functional equations and a proof procedure to formally verify the compilation in the theorem prover Isabelle/HOL. This continues the general idea of compiling inductive predicates to functional programs from Berghofer and Nipkow ..."
Abstract
 Add to MetaCart
(Show Context)
This thesis presents a compiler from inductive predicates to executable functional equations and a proof procedure to formally verify the compilation in the theorem prover Isabelle/HOL. This continues the general idea of compiling inductive predicates to functional programs from Berghofer and Nipkow [4]. We adopt their idea of compiling inductive predicates to functions with the use of a mode analysis. The new contributions are a model for executing inductive predicates in Isabelle/HOL, from which the code generation can create executable code, and a sound and complete proof procedure for the equivalence of the inductive predicate and its functional definition. As a result of this work, we reduce the trusted code base for code generation while still retaining the same functionality. Acknowledgements First of all, I would like to thank Tobias Nipkow for introducing me to the field of theorem proving in the very beginning of my studies and giving me the opportunity to actively take part in research during my graduate studies. I am indepted to my advisors Stefan Berghofer and Florian Haftmann for the support and encouragement, especially for explaining the existing framework and source code in late evening sessions.
Journal of Automated Reasoning manuscript No.
"... (will be inserted by the editor) A listmachine benchmark for mechanized metatheory ..."
Abstract
 Add to MetaCart
(Show Context)
(will be inserted by the editor) A listmachine benchmark for mechanized metatheory