1226 search results - page 3 / 246 » Proofs, Programs and Abstract Complexity |
STACS
2001
Springer
13 years 9 months ago
2001
Springer
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proof size by a large polynomial, or have a high (though constant) query complexity. In thi...
POPL
2009
ACM
14 years 6 months ago
2009
ACM
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
POPL
2004
ACM
14 years 5 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 ...
POPL
2012
ACM
12 years 26 days ago
2012
ACM
We develop logical mechanisms and decision procedures to facilitate the verification of full functional properties of inductive tree data-structures using recursion that are soun...
ESOP
2007
Springer
13 years 11 months ago
2007
Springer
tnesses for Abstract Interpretation-based Proofs Fr´ed´eric Besson, Thomas Jensen, and Tiphaine Turpin IRISA/{Inria, CNRS, Universit´e de Rennes 1} Campus de Beaulieu, F-35042 R...