797 search results - page 21 / 160 » Eliminating Proofs from Programs |
109
Voted
GI
2004
Springer
15 years 6 months ago
2004
Springer
Abstract: Optimizations in compilers are the most error-prone phases in the compilation process. Since correct compilers are a vital precondition for software correctness, it is ne...
110
click to vote
SFP
2004
15 years 2 months ago
2004
Abstract: Generic programming can bring important benefits to software engineering. In particular, it reduces the burden of verification, since generic proofs can be instantiated a...
100
Voted
KBSE
1997
IEEE
15 years 5 months ago
1997
IEEE
Proofs in the Nuprl system, an implementation of a constructive type theory, yield “correct-by-construction” programs. In this paper a new methodology is presented for extract...
131
click to vote
AGP
2010
IEEE
15 years 5 months ago
2010
IEEE
We review the Italian contribution to proof-theoretic and higher-order extensions of logic programming; this originated from the realization that Horn clauses lacked standard abstr...
117
click to vote
BIRTHDAY
2010
Springer
15 years 1 months ago
2010
Springer
In this paper, we present an overview to programming with proofs in the reasoning framework, Beluga. Beluga supports the specification of formal systems given by axioms and inferen...