-Calculus with Explicit Points and Approximations

DOI10.1093/logcom/12.2.255zbMath1003.03033OpenAlexW2014496562MaRDI QIDQ4542238

Mads Dam, Dilian Gurov

Publication date: 1 August 2002

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/3b0df0bf432686704cce361ab4984320a5a1e216

zbMATH Keywords

\(\mu\)-calculuscompositionalitysequent calculusprogram verificationfixed-point formulas

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (4)

Sequent calculi for process verification: Hennessy-Milner logic for an arbitrary GSOS ⋮ Reducing behavioural to structural properties of programs with procedures ⋮ Canonical completeness of infinitary \(\mu \) ⋮ On global induction mechanisms in aμ-calculus with explicit approximations

This page was built for publication: -Calculus with Explicit Points and Approximations