Enriched μ-Calculi Module Checking

DOI10.1007/978-3-540-71389-0_14zbMATH Open1195.68066OpenAlexW1769049963MaRDI QIDQ5758045FDOQ5758045

Authors: Alessandro Ferrante, Aniello Murano 

Publication date: 7 September 2007

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-71389-0_14

Recommendations

• Enriched MU-Calculi Module Checking
• Enriched μ–Calculus Pushdown Module Checking
• The Complexity of Enriched Mu-Calculi
• The Complexity of Enriched μ-Calculi
• On model checking for the \(\mu\)-calculus and its fragments

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (4)

• Enriched μ–Calculus Pushdown Module Checking
• Enriched MU-Calculi Module Checking
• The Complexity of Enriched Mu-Calculi
• The Complexity of Enriched μ-Calculi

This page was built for publication: Enriched μ-Calculi Module Checking

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