Sciweavers

3333 search results - page 62 / 667
» Abstract Proof Search
Sort
View
145
Voted
CADE
2002
Springer
16 years 2 months ago
A Gradual Approach to a More Trustworthy, Yet Scalable, Proof-Carrying Code
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...
Robert R. Schneck, George C. Necula
109
Voted
ESOP
2001
Springer
15 years 7 months ago
Proof-Directed De-compilation of Low-Level Code
Abstract. We present a proof theoretical method for de-compiling lowlevel code to the typed lambda calculus. We first define a proof system for a low-level code language based on...
Shin-ya Katsumata, Atsushi Ohori
104
Voted
FM
1994
Springer
113views Formal Methods» more  FM 1994»
15 years 6 months ago
Abstract Model Checking of Infinite Specifications
Model Checking of Infinite Specifications Daniel Jackson School of Computer Science Carnegie Mellon University Pittsburgh, PA A new method for analyzing specifications in languages...
Daniel Jackson
125
Voted
CSL
2010
Springer
15 years 3 months ago
Embedding Deduction Modulo into a Prover
Deduction modulo consists in presenting a theory through rewrite rules to support automatic and interactive proof search. It induces proof search methods based on narrowing, such a...
Guillaume Burel
125
Voted
STOC
1999
ACM
101views Algorithms» more  STOC 1999»
15 years 6 months ago
Short Proofs are Narrow - Resolution Made Simple
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...
Eli Ben-Sasson, Avi Wigderson