A trace logic with chop and least fixed points exactly characterizes recursive programs, with a sound and relatively complete compositional proof calculus and a Galois connection between programs and formulas.
9 Mads Dam and Dilian Gurov.µ-calculus with explicit points and approximations.J
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
An Expressive Trace Logic for Recursive Programs
A trace logic with chop and least fixed points exactly characterizes recursive programs, with a sound and relatively complete compositional proof calculus and a Galois connection between programs and formulas.