5015 search results - page 140 / 1003 » Model Checking a Path |
116
Voted
DAC
2004
ACM
16 years 1 months ago
2004
ACM
Bounded Model Checking (BMC) relies on solving a sequence of highly correlated Boolean satisfiability (SAT) problems, each of which corresponds to the existence of counter-example...
140
Voted
CADE
2007
Springer
16 years 1 months ago
2007
Springer
Manna and Pnueli have extensively shown how a mixture of first-order logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problem...
109
Voted
ATVA
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. The saturation state-space generation algorithm has demonstrated clear improvements over state-of-the-art symbolic methods for asynchronous systems. This work is motivate...
75
Voted
DATE
2007
IEEE
15 years 7 months ago
2007
IEEE
Formal verification is an important issue in circuit and system design. In this context, Bounded Model Checking (BMC) is one of the most successful techniques. But even if all sp...
91
Voted
POLICY
2005
Springer
15 years 6 months ago
2005
Springer
Policy refinement is meant to derive lower-level policies from higher-level ones so that these more specific policies are better suited for use in different execution environments...