Sciweavers

38 search results - page 7 / 8
» cav 2004
Sort
View
CAV
2004
Springer
140views Hardware» more  CAV 2004»
13 years 8 months ago
Indexed Predicate Discovery for Unbounded System Verification
Predicate abstraction has been proved effective for verifying several infinite-state systems. In predicate abstraction, an abstract system is automatinstructed given a set of predi...
Shuvendu K. Lahiri, Randal E. Bryant
CAV
2004
Springer
130views Hardware» more  CAV 2004»
13 years 8 months ago
Global Model-Checking of Infinite-State Systems
Abstract. We extend the automata-theoretic framework for reasoning about infinitestate sequential systems to handle also the global model-checking problem. Our framework is based o...
Nir Piterman, Moshe Y. Vardi
CAV
2004
Springer
108views Hardware» more  CAV 2004»
13 years 10 months ago
DPLL( T): Fast Decision Procedures
The logic of equality with uninterpreted functions (EUF) and its extensions have been widely applied to processor verification, by means of a large variety of progressively more s...
Harald Ganzinger, George Hagen, Robert Nieuwenhuis...
CAV
2004
Springer
123views Hardware» more  CAV 2004»
13 years 10 months ago
SAL 2
SAL 2 augments the specification language and explicit-state model checker of SAL 1 with high-performance symbolic and bounded model checkers, and with novel infinite bounded and...
Leonardo Mendonça de Moura, Sam Owre, Haral...
CAV
2004
Springer
154views Hardware» more  CAV 2004»
13 years 8 months ago
Automatic Verification of Sequential Consistency for Unbounded Addresses and Data Values
Sequential consistency is the archetypal correctness condition for the memory protocols of shared-memory multiprocessors. Typically, such protocols are parameterized by the number ...
Jesse D. Bingham, Anne Condon, Alan J. Hu, Shaz Qa...