Sciweavers

12981 search results - page 351 / 2597
» Model Checking (Abstract)
Sort
View
POPL
2010
ACM
16 years 1 months ago
Dependent Types from Counterexamples
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...
Tachio Terauchi
LICS
1997
IEEE
15 years 8 months ago
Full Abstraction for Functional Languages with Control
traction for Functional Languages with Control James Laird LFCS, Department of Computer Science University of Edinburgh This paper considers the consequences of relaxing the brack...
James Laird
CAV
2003
Springer
166views Hardware» more  CAV 2003»
15 years 9 months ago
Bridging the Gap between Fair Simulation and Trace Inclusion
The paper considers the problem of checking abstraction between two finite-state fair discrete systems (FDS). In automata-theoretic terms this is trace inclusion between two nond...
Yonit Kesten, Nir Piterman, Amir Pnueli
CONCUR
2006
Springer
15 years 8 months ago
Sanity Checks in Formal Verification
One of the advantages of temporal-logic model-checking tools is their ability to accompany a negative answer to the correctness query by a counterexample to the satisfaction of the...
Orna Kupferman
125
Voted
CAV
2006
Springer
157views Hardware» more  CAV 2006»
15 years 8 months ago
Lazy Abstraction with Interpolants
traction with Interpolants K. L. McMillan Cadence Berkeley Labs Abstract. We describe a model checker for infinite-state sequential proased on Craig interpolation and the lazy abst...
Kenneth L. McMillan