Results 1 
2 of
2
FAQ for proof producing synthesis in HOL
 Sixth International Workshop on Designing Correct Circuits
, 2006
"... Proof producing synthesis compiles a source specification (see 2) to an implementation and generates a theorem certifying that the implementation is correct. The specification is expressed in higher order logic. 2 What is the synthesisable subset of HOL? The compiler automatically translates functio ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Proof producing synthesis compiles a source specification (see 2) to an implementation and generates a theorem certifying that the implementation is correct. The specification is expressed in higher order logic. 2 What is the synthesisable subset of HOL? The compiler automatically translates functions f: σ1 × · · ·×σm → τ1 × · · ·×τn, where the argument (σi) and result (τj) types are words. It can translate any tail recursive definition of such a function as long as the subfunctions used in the definition are in the library of primitive or previously defined functions. Formal refinement into this subset is
Under consideration for publication in Formal Aspects of Computing Proof producing synthesis of
"... arithmetic and cryptographic ..."