12981 search results - page 150 / 2597 » Model Checking (Abstract) |
149
click to vote
ACMICEC
2007
ACM
15 years 6 months ago
2007
ACM
Norms defined by institutions and enforced by organizations have been put forward as a mechanism to increase the efficiency and reliability of electronic transactions carried out ...
132
click to vote
STACS
2010
Springer
15 years 9 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...
127
click to vote
MEMOCODE
2006
IEEE
15 years 8 months ago
2006
IEEE
We present an efficient symbolic search algorithm for software model checking. The algorithm combines multiple symbolic representations to efficiently represent the transition r...
111
click to vote
ICALP
2009
Springer
16 years 3 months 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...
133
click to vote
MEMOCODE
2003
IEEE
15 years 8 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...