332 search results - page 15 / 67 » A Direct Algorithm for Multi-valued Bounded Model Checking |
113
click to vote
FORMATS
2006
Springer
15 years 3 months ago
2006
Springer
In this paper we describe an extension of timed automata with priorities, and efficient algorithms to compute subtraction on DBMs (difference bounded matrices), needed in symbolic ...
ICCAD
1996
IEEE
15 years 3 months ago
1996
IEEE
Based Automatic Abstraction for CTL Model Checking Woohyuk Lee Abelardo Pardo Jae-Young Jang Gary Hachtel Fabio Somenzi University of Colorado ECEN Campus Box 425 Boulder, CO, 8030...
ICCD
1995
IEEE
15 years 3 months ago
1995
IEEE
Symbolic model checking is a successful technique for checking properties of large finite-state systems. This method has been used to verify a number of real-world hardware desig...
ENTCS
2007
14 years 11 months ago
2007
Application of model checking to isolated software components is not directly possible because a component does not form a complete program - the problem of missing environment oc...
FMSD
2006
14 years 11 months ago
2006
Two base algorithms are known for reachability verification over timed automata. They are called forward and backwards, and traverse the automata edges using either successors or p...