4047 search results - page 98 / 810 » Algebraic Model Checking |
111
Voted
STACS
2010
Springer
15 years 7 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...
110
Voted
CAV
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Regular model checking is a form of symbolic model checking technique for systems whose states can be represented as finite words over a finite alphabet, where regular ...
110
Voted
MEMOCODE
2006
IEEE
15 years 6 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...
130
click to vote
TABLEAUX
1998
Springer
15 years 5 months ago
1998
Springer
ple (Extended Abstract) Edmund M. Clarke and Sergey Berezin Carnegie Mellon University -- USA Model checking is an automatic verification technique for finite state concurrent syst...
98
Voted
ICALP
2009
Springer
16 years 1 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...