Program Complexity in Hierarchical Module Checking

DOI10.1007/978-3-540-89439-1_23MaRDI QIDQ5505563zbMATH OpenOpenAlexFDO

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

(11)

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

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)