319 search results - page 31 / 64 » Space-Efficient Bounded Model Checking |
TACAS
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. We present a tool for the formal verification of ANSI-C programs using Bounded Model Checking (BMC). The emphasis is on usability: the tool supports almost all ANSI-C la...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
SPIN
2007
Springer
14 years 4 months ago
2007
Springer
Boolean programs are frequently used to model abstractions of software programs. They have the advantage that reachability properties are decidable, despite the fact that their sta...
VLSID
2004
IEEE
14 years 10 months ago
2004
IEEE
This paper presents a novel technique for abstracting designs in order to increase the efficiency of formal property checking. Bounded Model Checking (BMC), using Satisfiability (...
KBSE
2005
IEEE
14 years 3 months ago
2005
IEEE
Software verification using model checking often translates programs into corresponding transition systems that model the program behavior. As software systems continue to grow i...