797 search results - page 13 / 160 » Eliminating Proofs from Programs |
90
Voted
PROVSEC
2007
Springer
15 years 3 months ago
2007
Springer
Game-playing is an approach to write security proofs that are easy to verify. In this approach, security definitions and intractable problems are written as programs called games ...
183
click to vote
POPL
2004
ACM
15 years 9 months ago
2004
ACM
stractions from Proofs Ranjit Jhala1 Kenneth L. McMillan2 1 UC San Diego 2 Cadence Berkeley Laboratories We present a technique for using infeasible program paths to automatically ...
78
Voted
LFCS
2007
Springer
15 years 3 months ago
2007
Springer
Density elimination by substitutions is introduced as a uniform method for removing applications of the Takeuti-Titani density rule from proofs in firstorder hypersequent calculi....
CADE
2003
Springer
15 years 9 months ago
2003
Springer
Foundational certified code systems seek to prove untrusted programs to be safe relative to safety policies given in terms of actual machine architectures, thereby improving the s...
152
click to vote
POPL
2005
ACM
15 years 9 months ago
2005
ACM
We present Rhodium, a new language for writing compiler optimizations that can be automatically proved sound. Unlike our previous work on Cobalt, Rhodium expresses optimizations u...