CAV
2003
Springer
13 years 8 months ago
2003
Springer
We generalize the traditional definition of a multicounter machine (where the counters, which can only assume nonnegative integer values, can be incremented/decremented by 1 and te...
CAV
2003
Springer
13 years 8 months ago
2003
Springer
odular Abstraction Refinement Thomas A. Henzinger1 , Ranjit Jhala1 , Rupak Majumdar1 , and Shaz Qadeer2 1 University of California, Berkeley 2 Microsoft Research, Redmond Abstract....
CAV
2003
Springer
13 years 8 months ago
2003
Springer
Abstract. Temporal logic is popular for specifying correctness properties of reactive systems. Real-time temporal logics add the ability to express quantitative timing aspects. Tab...
CAV
2003
Springer
13 years 8 months ago
2003
Springer
redicate Abstraction Efficient: How to eliminate redundant predicates Edmund Clarke
CAV
2003
Springer
13 years 8 months ago
2003
Springer
Thispapergivesashort overviewofa model checking tool forreal-time systems. The modeling language are timed automata extended with concepts for modular modeling. The tool provides r...
CAV
2003
Springer
13 years 9 months ago
2003
Springer
CAV
2003
Springer
13 years 9 months ago
2003
Springer
CAV
2003
Springer
13 years 9 months ago
2003
Springer
Abstract. The theme of this paper is certifying software for state estimation of dynamic systems, which is an important problem found in spacecraft, aircraft, geophysical, and in m...
CAV
2003
Springer
13 years 9 months ago
2003
Springer
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...
CAV
2003
Springer
13 years 9 months ago
2003
Springer
Abstract. We consider a fully SAT-based method of unbounded symbolic model checking based on computing Craig interpolants. In benchmark studies using a set of large industrial circ...