Program Complexity in Hierarchical Module Checking

DOI10.1007/978-3-540-89439-1_23zbMATH Open1182.68124OpenAlexW1940010026MaRDI QIDQ5505563FDOQ5505563

Authors Aniello Murano, Margherita Napoli, Mimmo Parente

Publication date 27 January 2009

Published in Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-89439-1_23

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Module checking
• Pushdown module checking
• Pushdown Module Checking
• Improved model checking of hierarchical systems
• Improved model checking of hierarchical systems

Cited in

(10)

• Hierarchical cost-parity games
• Module checking
• Improved model checking of hierarchical systems
• Automata-theoretic decision of timed games
• Static correctness of hierarchical procedures
• Improved model checking of hierarchical systems
• Pushing Efficient Evaluation of HEX Programs by Modular Decomposition
• A Parametrized Analysis of Algorithms on Hierarchical Graphs
• Pushdown module checking with imperfect information
• On the complexity of \(\mathsf{ATL}\) and \(\mathsf{ATL}^*\) module checking

This page was built for publication: Program Complexity in Hierarchical Module Checking

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