Pushdown module checking

DOI10.1007/S10703-010-0093-XMaRDI QIDQ968362zbMATH OpenOpenAlexFDO

Authors Laura Bozzelli, Aniello Murano, Adriano Peron

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

zbMATH Keywords

pushdown systemstree automatabranching temporal logicsmodule checking

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Pushdown Module Checking
• Enriched μ–Calculus Pushdown Module Checking
• Pushdown Module Checking with Imperfect Information
• Pushdown module checking with imperfect information
• Module checking

Cites work

• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 1223729 (Why is no real title available?)
• scientific article; zbMATH DE number 1759605 (Why is no real title available?)
• Alternating finite automata on \(\omega\)-words
• Alternation
• An automata-theoretic approach to branching-time model checking
• Automata-theoretic techniques for modal logics of programs
• Buy one, get one free!!!
• Enriched MU-Calculi Module Checking
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Model checking LTL with regular valuations for pushdown systems
• Module checking
• Monadic second-order logic on tree-like structures
• Pushdown Module Checking
• Pushdown Module Checking with Imperfect Information
• The theory of ends, pushdown automata, and second-order logic
• Two-Way Tree Automata Solving Pushdown Games
• Verification, Model Checking, and Abstract Interpretation
• “Sometimes” and “not never” revisited

Cited in

(19)

• scientific article; zbMATH DE number 1980931 (Why is no real title available?)
• Ordered multi-stack visibly pushdown automata
• Improving Pushdown System Model Checking
• Interval Temporal Logic for Visibly Pushdown Systems
• Module checking
• Enriched μ–Calculus Pushdown Module Checking
• Program Complexity in Hierarchical Module Checking
• Efficient CTL model-checking for pushdown systems
• Pushdown Module Checking
• Context-free timed formalisms: robust automata and linear temporal logics
• Pushdown Module Checking with Imperfect Information
• Efficient CTL model-checking for pushdown systems
• Automata-theoretic decision of timed games
• Model checking properties on reduced trace systems
• scientific article; zbMATH DE number 7447746 (Why is no real title available?)
• Cycle detection in computation tree logic
• scientific article; zbMATH DE number 7439738 (Why is no real title available?)
• Pushdown module checking with imperfect information
• On the complexity of \(\mathsf{ATL}\) and \(\mathsf{ATL}^*\) module checking

This page was built for publication: Pushdown module checking

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968362)