Pushdown module checking
From MaRDI portal
Publication:968362
DOI10.1007/s10703-010-0093-xzbMath1209.68312OpenAlexW2092229972MaRDI QIDQ968362
Adriano Peron, Aniello Murano, Laura Bozzelli
Publication date: 5 May 2010
Published in: Formal Methods in System Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10703-010-0093-x
Related Items (11)
Ordered multi-stack visibly pushdown automata ⋮ Automata-theoretic decision of timed games ⋮ Efficient CTL model-checking for pushdown systems ⋮ Interval Temporal Logic for Visibly Pushdown Systems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Model checking properties on reduced trace systems ⋮ Cycle detection in computation tree logic ⋮ Efficient CTL Model-Checking for Pushdown Systems ⋮ Context-free timed formalisms: robust automata and linear temporal logics
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Alternating finite automata on \(\omega\)-words
- The theory of ends, pushdown automata, and second-order logic
- Automata-theoretic techniques for modal logics of programs
- Monadic second-order logic on tree-like structures
- Module checking
- Model checking LTL with regular valuations for pushdown systems
- Pushdown Module Checking with Imperfect Information
- Enriched MU-Calculi Module Checking
- “Sometimes” and “not never” revisited
- Alternation
- Two-Way Tree Automata Solving Pushdown Games
- Buy one, get one free!!!
- An automata-theoretic approach to branching-time model checking
- Pushdown Module Checking
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Verification, Model Checking, and Abstract Interpretation
This page was built for publication: Pushdown module checking
