381 search results - page 25 / 77 » Model Checking Is Static Analysis of Modal Logic |
172
click to vote
FSTTCS
2010
Springer
14 years 9 months ago
2010
Springer
We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...
114
click to vote
CONCUR
1997
Springer
15 years 3 months ago
1997
Springer
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets of con gurations of such systems by means of nite-state automata. In order to re...
103
click to vote
TACAS
2004
Springer
15 years 5 months ago
2004
Springer
Temporal logic is two-valued: formulas are interpreted as either true or false. When applied to the analysis of stochastic systems, or systems with imprecise formal models, tempor...
120
click to vote
CAV
2009
Springer
16 years 7 days ago
2009
Springer
Context-bounded analysis is an attractive approach to verification of concurrent programs. Bounding the number of contexts executed per thread not only reduces the asymptotic compl...
100
click to vote
STACS
2010
Springer
15 years 6 months ago
2010
Springer
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...