2878 search results - page 59 / 576 » Model Checking FTA |
97
Voted
ICALP
2009
Springer
16 years 29 days ago
2009
Springer
Ong has shown that the modal mu-calculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possibly-infinite ranked trees gen...
96
Voted
FMCAD
2007
Springer
15 years 6 months ago
2007
Springer
Abstract— Model checking can be aided by inductive invariants, small local properties that can be proved by simple induction. We present a way to automatically extract inductive ...
111
Voted
MEMOCODE
2003
IEEE
15 years 6 months ago
2003
IEEE
— Modern SAT solvers have proved highly successful in finding counterexamples to temporal properties of systems, using a method known as ”bounded model checking”. It is natu...
101
click to vote
APN
2003
Springer
15 years 6 months ago
2003
Springer
Model checking by exhaustive state space enumeration is one of the most developed analysis methods for distributed event systems. Its main problem—the size of the state spaces—...
112
Voted
CAV
2009
Springer
15 years 5 months ago
2009
Springer
Priorities are used to control the execution of systems to meet given requirements for optimal use of resources, e.g., by using scheduling policies. For distributed systems, it is ...