696 search results - page 9 / 140 » Explaining abstract counterexamples |
POPL
2004
ACM
14 years 7 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 ...
CAV
2007
Springer
14 years 1 months 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 ...
ICSEA
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract—Nondeterminism is used as a means of underspecification or implementation choice in specifications, and it is often necessary if part of a system or the environment is...
FORTE
2004
13 years 8 months ago
2004
Abstract. We present automated techniques for the explanation of counterexamples, where a counter-example should be understood as a sequence of program statements. Our approach is ...
POPL
2010
ACM
14 years 4 months ago
2010
ACM
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...