232 search results - page 14 / 47 » Symbolic Bounded Conformance Checking of Model Programs |
FORMATS
2006
Springer
14 years 7 days 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 ...
CADE
2002
Springer
14 years 9 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
FMCAD
2009
Springer
14 years 3 months ago
2009
Springer
Abstract—Several successful approaches to software verificabased on the construction and analysis of an abstract reachability tree (ART). The ART represents unwindings of the co...
FORTE
2008
13 years 10 months ago
2008
Model programs represent transition systems that are used fy expected behavior of systems at a high level of abstraction. The main application area is application-level network pro...
ICCD
1995
IEEE
14 years 4 days 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...