On global induction mechanisms in aμ-calculus with explicit approximations

DOI10.1051/ita:2003024zbMath1111.68518OpenAlexW2029129011MaRDI QIDQ4460690

Christoph Sprenger, Mads Dam

Publication date: 29 March 2004

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=ITA_2003__37_4_365_0

zbMATH Keywords

inductive reasoning

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Mechanization of proofs and logical operations (03B35) Structure of proofs (03F07)

Related Items (3)

Sequent calculi for process verification: Hennessy-Milner logic for an arbitrary GSOS ⋮ Extracting Proofs from Tabled Proof Search ⋮ Cyclic Arithmetic Is Equivalent to Peano Arithmetic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Games for the \(\mu\)-calculus
• Results on the propositional \(\mu\)-calculus
• Local model checking in the modal mu-calculus
• Local model checking for infinite state spaces
• Finiteness is mu-ineffable
• Proving properties of dynamic process networks
• Modalities for model checking: Branching time logic strikes back
• -Calculus with Explicit Points and Approximations

This page was built for publication: On global induction mechanisms in aμ-calculus with explicit approximations