25 search results - page 4 / 5 » Algorithmic Metatheorems for Decidable LTL Model Checking ov... |
113
click to vote
TACAS
2005
Springer
15 years 8 months ago
2005
Springer
We present MC2 , what we believe to be the first randomized, Monte Carlo algorithm for temporal-logic model checking, the classical problem of deciding whether or not a property s...
228
click to vote
POPL
2007
ACM
16 years 3 months ago
2007
ACM
Pushdown Systems (PDSs) has become an important paradigm for program analysis. Indeed, recent work has shown a deep connection between inter-procedural dataflow analysis for seque...
136
click to vote
LICS
2003
IEEE
15 years 8 months ago
2003
IEEE
We define the class of micro-macro stack graphs, a new class of graphs modeling infinite-state sequential systems with a decidable model-checking problem. Micro-macro stack grap...
134
click to vote
SIGSOFT
2007
ACM
16 years 3 months ago
2007
ACM
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
127
click to vote
CDC
2010
IEEE
14 years 10 months ago
2010
IEEE
Abstract-- We present a computational framework for automatic synthesis of a feedback control strategy for a piecewise affine (PWA) system from a specification given as a Linear Te...