788 search results - page 26 / 158 » Symbolic Equivalence Checking |
135
click to vote
TACAS
2005
Springer
15 years 10 months ago
2005
Springer
We present a tool for finding errors in Java programs that translates Java bytecodes into symbolic pushdown systems, which are then checked by the Moped tool [1].
166
Voted
ICFEM
2009
Springer
15 years 3 months ago
2009
Springer
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
128
click to vote
TACAS
2005
Springer
15 years 10 months ago
2005
Springer
Shorter counterexamples are typically easier to understand. The length of a counterexample, as reported by a model checker, depends on both the algorithm used for state space explo...
138
click to vote
ACSD
1998
IEEE
15 years 9 months ago
1998
IEEE
This paper makes the idea of memory shadowing [5] applicable to symbolic ternary simulation. Memory shadowing, an extension of Burch and Dill's pipeline verification method [...
128
Voted
ENTCS
2006
15 years 5 months ago
2006
In this paper we describe an algorithm for distributed, BDD-based bounded property checking and its implementation in the verification tool SymC. The distributed algorithm verifie...