622 search results - page 46 / 125 » Answer Set Programming and Bounded Model Checking |
142
click to vote
LICS
2006
IEEE
15 years 10 months ago
2006
IEEE
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and w...
141
click to vote
SIGSOFT
2003
ACM
15 years 9 months ago
2003
ACM
Model checking is an automated technique for verifying that a system satisfies a set of required properties. Such properties are typically expressed as temporal logic formulas, in...
133
click to vote
ICLP
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. We extend Clark’s definition of a completed program and the definition of a loop formula due to Lin and Zhao to disjunctive logic programs. Our main result, generaliz...
135
click to vote
TASE
2007
IEEE
15 years 10 months ago
2007
IEEE
Symmetry reduction is a technique that can help alleviate the problem of state space explosion in model checking. The idea is to verify only a subset of states from each class (or...
237
click to vote
ECOOP
2009
Springer
16 years 4 months ago
2009
Springer
The dynamic frames approach has proven to be a powerful formalism for specifying and verifying object-oriented programs. However, it requires writing and checking many frame annota...