Results 1 
4 of
4
Code generation from Isabelle/HOL theories
, 2007
"... This tutorial introduces the code generator facilities of Isabelle/HOL. They empower the user to turn HOL specifications into corresponding executable programs in the languages SML, OCaml, Haskell and Scala. 1 INTRODUCTION 1 1 ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
This tutorial introduces the code generator facilities of Isabelle/HOL. They empower the user to turn HOL specifications into corresponding executable programs in the languages SML, OCaml, Haskell and Scala. 1 INTRODUCTION 1 1
On Theorem Proverbased Testing
 UNDER CONSIDERATION FOR PUBLICATION IN FORMAL ASPECTS OF COMPUTING
, 2012
"... HOLTestGen is a specification and test case generation environment extending the interactive theorem prover Isabelle/HOL. As such, HOLTestGen allows for an integrated workflow supporting interactive theorem proving, test case generation, and test data generation. The HOLTestGen method is twostag ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
HOLTestGen is a specification and test case generation environment extending the interactive theorem prover Isabelle/HOL. As such, HOLTestGen allows for an integrated workflow supporting interactive theorem proving, test case generation, and test data generation. The HOLTestGen method is twostaged: first, the original formula is partitioned into test cases by transformation into a normal form called test theorem. Second, the test cases are analyzed for ground instances (the test data) satisfying the constraints of the test cases. Particular emphasis is put on the control of explicit testhypotheses which can be proven over concrete programs. Due to the generality of the underlying framework, our system can be used for blackbox unit, sequence, reactive sequence and whitebox test scenarios. Although based on particularly clean theoretical foundations, the system can be applied for substantial casestudies.
Parametric linear arithmetic over ordered fields in Isabelle/HOL
"... We use higherorder logic to verify a quantifier elimination procedure for linear arithmetic over ordered fields, where the coefficients of variables are multivariate polynomials over another set of variables, we call parameters. The procedure generalizes Ferrante and Rackoff’s algorithm for the non ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We use higherorder logic to verify a quantifier elimination procedure for linear arithmetic over ordered fields, where the coefficients of variables are multivariate polynomials over another set of variables, we call parameters. The procedure generalizes Ferrante and Rackoff’s algorithm for the nonparametric case. The formalization is based on axiomatic type classes and automatically carries over to e.g. the rational, real and nonstandard real numbers. It is executable, can be applied to HOL formulae by reflection and performs well on practical examples.
Normalization by Evaluation
, 2013
"... This article formalizes normalization by evaluation as implemented in Isabelle. Lambda calculus plus term rewriting is compiled into a functional program with pattern matching. It is proved that the result of a successful evaluation is a) correct, i.e. equivalent to the input, and b) in normal form. ..."
Abstract
 Add to MetaCart
This article formalizes normalization by evaluation as implemented in Isabelle. Lambda calculus plus term rewriting is compiled into a functional program with pattern matching. It is proved that the result of a successful evaluation is a) correct, i.e. equivalent to the input, and b) in normal form. An earlier version of this theory is described in a paper by Aehlig et al. [1]. The normal form proof is not in that paper. 1