696 search results - page 9 / 140 » Explaining abstract counterexamples |
274
click to vote
POPL
2004
ACM
16 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 ...
137
click to vote
CAV
2007
Springer
15 years 11 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 ...
149
click to vote
ICSEA
2007
IEEE
15 years 11 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...
137
click to vote
FORTE
2004
15 years 6 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 ...
137
click to vote
POPL
2010
ACM
16 years 2 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...