3909 search results - page 200 / 782 » Extreme Model Checking |
CORR
2009
Springer
15 years 22 days ago
2009
Springer
109
click to vote
ICFEM
2009
Springer
15 years 20 days ago
2009
Springer
One of the most important open problems of parallel LTL model-checking is to design an on-the-fly scalable parallel algorithm with linear time complexity. Such an algorithm would g...
ECEASST
2010
15 years 9 days ago
2010
133
click to vote
TOCL
2011
14 years 10 months ago
2011
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the s...