718 search results - page 5 / 144 » Extraction of Structured Programs from Specification Proofs |
CSREAESA
2004
13 years 9 months ago
2004
In this paper we present an algorithm for automatic extraction of system behavior from a structural Verilog specification. The algorithm generates a series-parallel poset expressi...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Dependently typed lambda calculi such as the Logical Framework (LF) can encode relationships between terms in types and can naturally capture correspondences between formulas and ...
PPDP
2009
Springer
14 years 1 days ago
2009
Springer
We present direct proofs of termination of evaluation for typed delimited-control operators shift and reset using a variant of Tait’s method with context-based reducibility pred...
ENTCS
2002
13 years 7 months ago
2002
This paper presents a step in the development of an operational approach to program extraction in type theory. In order to get a program from a lambda term, the logical parts need...
ICFP
2012
ACM
11 years 10 months ago
2012
ACM
The higher-order logic found in proof assistants such as Coq and various HOL systems provides a convenient setting for the development and verification of pure functional program...