566 search results - page 1 / 114 » Array Abstractions from Proofs |
160
Voted
CAV
2007
Springer
16 years 16 days ago
2007
Springer
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 ...
308
Voted
POPL
2004
ACM
16 years 6 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 ...
182
Voted
CSL
2007
Springer
16 years 16 days ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
139
click to vote
ASAP
2010
IEEE
15 years 8 months ago
2010
IEEE
urrence abstractions Arpith C. Jacob Jeremy D. Buhler Roger D. Chamberlain Arpith C. Jacob, Jeremy D. Buhler, and Roger D. Chamberlain, "Design of ut-optimized arrays from rec...
165
Voted
SAS
2009
Springer
16 years 6 months ago
2009
Springer
ion Refinement for Quantified Array Assertions Mohamed Nassim Seghir1, , Andreas Podelski1 , and Thomas Wies1,2 1 University of Freiburg, Germany 2 EPFL, Switzerland Abstract. We p...