4502 search results - page 109 / 901 » Regular Model Checking |
91
Voted
TACAS
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We propose a novel algorithm for automata-based LTL model checking that interleaves the construction of the generalized B¨uchi automaton for the negation of the formula ...
CAV
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. In order to make multithreaded programming manageable, programmers often follow a design principle where they break the problem into tasks which are then solved asynchron...
113
Voted
ECBS
2006
IEEE
15 years 4 months ago
2006
IEEE
The paper depicts experiments and results with preditraction based verification applied to infinite state Predicate abstraction is a method for automatic tion of abstract state sp...
104
click to vote
FSTTCS
2006
Springer
15 years 4 months ago
2006
Springer
We establish a decidability boundary of the model checking problem for infinite-state systems defined by Process Rewrite Systems (PRS) or weakly extended Process Rewrite Systems (w...
103
Voted
ITA
2007
15 years 19 days ago
2007
Abstract. This paper analyses the complexity of model checking Fixpoint Logic with Chop – an extension of the modal µ-calculus with a sequential composition operator. It uses tw...