125 search results - page 12 / 25 » Computing Over-Approximations with Bounded Model Checking |
STACS
2010
Springer
14 years 2 months ago
2010
Springer
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
ECOOPW
1999
Springer
13 years 12 months ago
1999
Springer
The model checking of applications of aspects is explained, by showing the stages and proof obligations when a collection of generic aspects (called a superimposition) is combined...
VLSID
2004
IEEE
14 years 8 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 (...
TPHOL
2008
IEEE
14 years 2 months ago
2008
IEEE
Systems that can immediately react to their inputs may suffer from cyclic dependencies between their actions and the corresponding trigger conditions. For this reason, causality an...
KBSE
2005
IEEE
14 years 1 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...