Communicating sequential processes
Communicating sequential processes
“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Journal of the ACM (JACM) - The MIT Press scientific computation series
Automata-Theoretic techniques for modal logics of programs
Journal of Computer and System Sciences
Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Journal of the ACM (JACM)
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
Information and Computation - Special issue on FLOC '96
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Reasoning about The Past with Two-Way Automata
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Reachability Analysis of Pushdown Automata: Application to Model-Checking
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Open Systems in Reactive Environments: Control and Synthesis
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Model Checking CTL Properties of Pushdown Systems
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Specification and verification of concurrent systems in CESAR
Proceedings of the 5th Colloquium on International Symposium on Programming
Pushdown Processes: Games and Model Checking
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Efficient model checking via the equational /spl mu/-calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
The complexity of tree automata and logics of programs
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Program Complexity in Hierarchical Module Checking
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Enriched µ-calculi module checking
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Formal Methods in System Design
Enriched µ-calculus pushdown module checking
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
An automata-theoretic approach to infinite-state systems
Time for verification
Effcient CTL model-checking for pushdown systems
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Pushdown module checking with imperfect information
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Pushdown module checking with imperfect information
Information and Computation
| Hi-index | 0.00 |
Model checking is a useful method to verify automatically the correctness of a system with respect to a desired behavior, by checking whether a mathematical model of the system satisfies a formal specification of this behavior. Many systems of interest are open, in the sense that their behavior depends on the interaction with their environment. The model checking problem for finite–state open systems (called module checking) has been intensively studied in the literature. In this paper, we focus on open pushdown systems and we study the related model–checking problem (pushdown module checking, for short) with respect to properties expressed by CTL and CTL* formulas. We show that pushdown module checking against CTL (resp., CTL*) is 2Exptime-complete (resp., 3Exptime-complete). Moreover, we prove that for a fixed CTL* formula, the problem is Exptime-complete.