10870 search results - page 284 / 2174 » Model Checking Programs |
170
click to vote
ICFEM
2009
Springer
15 years 4 months 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...
108
Voted
ECEASST
2010
15 years 4 months ago
2010
175
click to vote
TOCL
2011
15 years 1 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...