Program Complexity in Hierarchical Module Checking
From MaRDI portal
Publication:5505563
DOI10.1007/978-3-540-89439-1_23zbMATH Open1182.68124OpenAlexW1940010026MaRDI QIDQ5505563FDOQ5505563
Margherita Napoli, Aniello Murano, 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
Recommendations
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Cited In (10)
- Hierarchical cost-parity games
- Improved model checking of hierarchical systems
- Module checking
- A Parametrized Analysis of Algorithms on Hierarchical Graphs
- Improved model checking of hierarchical systems
- Pushing Efficient Evaluation of HEX Programs by Modular Decomposition
- Title not available (Why is that?)
- Static correctness of hierarchical procedures
- Automata-theoretic decision of timed games
- Pushdown module checking with imperfect information
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)