FlowKlaimInRocq: a certified flow logic for KLAIM tuple trajectories

A machine-checked metatheory, in the Rocq Prover, of a Flow Logic analysis of tuple trajectories for a first-order, located fragment of KLAIM, following the trajectory analysis of Bodei, Degano, Ferrari and Galletta.

The development formalises the syntax, the operational semantics and the acceptability relation of the analysis, and proves its metatheory: closure of acceptable estimates under meet (a Moore family), preservation under value-for-name substitution, subject reduction, trajectory confinement, and the constructive existence of a least acceptable estimate. Acceptability is proved decidable, and the decision procedure is extracted to OCaml, yielding a checker that decides exactly the judgement the soundness theorems speak about.

The development is admit-free: Print Assumptions on the main results reports only the declared interface of the frozen fragment, with no dependence on classical logic, choice, or functional extensionality.

Artifact accompanying the paper KLAIM, Certified: Mechanising Flow Logic for Tuple-Space Coordination.