290 search results - page 29 / 58 » Theorem Proving Using Lazy Proof Explication |
144
click to vote
CADE
2002
Springer
16 years 2 months ago
2002
Springer
Abstract. Proof-carrying code (PCC) allows a code producer to associate to a program a machine-checkable proof of its safety. In the original approach to PCC, the safety policy inc...
230
Voted
POPL
2006
ACM
16 years 2 months ago
2006
ACM
This paper reports on the development and formal certification (proof of semantic preservation) of a compiler from Cminor (a Clike imperative language) to PowerPC assembly code, u...
127
click to vote
SAC
2006
ACM
15 years 2 months ago
2006
ACM
The implementation of a correctly rounded or interval elementary function needs to be proven carefully in the very last details. The proof requires a tight bound on the overall er...
106
click to vote
JAR
2008
15 years 2 months ago
2008
We analyze three proof strategies commonly used in deductive verification of deterministic sequential programs formalized with operational semantics. The strategies are: (i) stepw...
106
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
This paper considers three variants of quantum interactive proof systems in which short (meaning logarithmic-length) messages are exchanged between the prover and verifier. The ...