Enriched μ–Calculus Pushdown Module Checking

DOI10.1007/978-3-540-75560-9_32zbMath1137.68434OpenAlexW1507564730MaRDI QIDQ3498485

Aniello Murano, Alessandro Ferrante

Publication date: 15 May 2008

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-75560-9_32

Mathematics Subject Classification ID

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

Cites Work

• Results on the propositional \(\mu\)-calculus
• On the undecidability of logics with converse, nominals, recursion and counting
• Module checking
• The Complexity of Enriched μ-Calculi
• An automata-theoretic approach to branching-time model checking
• Pushdown Module Checking
• Enriched μ-Calculi Module Checking
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Enriched μ–Calculus Pushdown Module Checking