10038 search results - page 96 / 2008 » Model Checking for Managers |
TACAS
2005
Springer
15 years 5 months ago
2005
Springer
Shorter counterexamples are typically easier to understand. The length of a counterexample, as reported by a model checker, depends on both the algorithm used for state space explo...
ASE
2008
15 years 17 hour ago
2008
Model checkers were originally developed to support the formal verification of high-level design models of distributed system designs. Over the years, they have become unmatched in...
ISVLSI
2007
IEEE
15 years 6 months ago
2007
IEEE
Formal verification has become an important step in circuit and system design. A prominent technique is Bounded Model Checking (BMC) which is widely used in industry. In BMC it i...
107
click to vote
ICTAC
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. This paper introduces the notion of finite precision timed automata (FPTAs) and proposes a data structure to represent its symbolic states. To reduce the state space, FP...
CAV
2004
Springer
15 years 5 months ago
2004
Springer
Verifying whether an ω-regular property is satisfied by a finite-state system is a core problem in model checking. Standard techniques build an automaton with the complementary ...