2872 search results - page 4 / 575 » On (Omega-)Regular Model Checking |
150
click to vote
ATVA
2011
Springer
13 years 10 months ago
2011
Springer
Even though the well-known nested-depth first search algorithm for LTL model checking provides good performance, it cannot benefit from the recent advent of multi-core computers....
119
click to vote
NFM
2011
14 years 5 months ago
2011
A main idea underlying bounded model checking is to limit the length of the potential counter-examples, and then prove properties for the bounded version of the problem. In softwar...
151
click to vote
CLIMA
2011
13 years 10 months ago
2011
Multi-agent systems are an increasingly important software paradigm and in many of its applications agents cooperate to achieve a particular goal. This requires the design of effi...
CAV
2012
Springer
13 years 15 days ago
2012
Springer
A SAT-based incremental, inductive algorithm for model checking CTL properties is proposed. As in classic CTL model checking, the parse graph of the property shapes the analysis. H...
IS
2011
14 years 5 months ago
2011
We consider the determinism checking of XML Schema content models, as required by the W3C Recommendation. We argue that currently applied solutions have flaws and make processors...