46 search results - page 5 / 10 » Synthesizing Proofs from Programs in the Calculus of Inducti... |
91
Voted
TYPES
2004
Springer
15 years 2 months ago
2004
Springer
We present a formalization of a constructive proof of weak normalization for the simply-typed λ-calculus in the theorem prover Isabelle/HOL, and show how a program can be extracte...
AAAI
1990
14 years 10 months ago
1990
Automating proofs by induction is important in many computer science and artificial intelligence applications, in particular in program verification and specification systems. We ...
LPAR
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. To produce a program guaranteed to satisfy a given specification one can synthesize it from a formal constructive proof that a computation satisfying that specification...
86
Voted
CHARME
2003
Springer
15 years 2 months ago
2003
Springer
This paper shows how classic inductive assertions can be used in conjunction with an operational semantics to prove partial correctness properties of programs. The method imposes o...
194
click to vote
POPL
2001
ACM
15 years 9 months ago
2001
ACM
We study the interaction of the "new" construct with a rich but common form of (first-order) communication. This interaction is crucial in security protocols, which are ...