Theorem 4.11 (Deriving Footprint) — with precise preconditions and best anti-frames, foot(C) = P_C
ProvedBiAbduction.Footprint.theorem_4_11Let be a nonempty sequence of actions, each action given by its specification , and suppose that every precondition of the sequence is precise. Let be the precondition of the canonical spec of obtained when every call to the bi-abductive prover delivers the best anti-frame: for a single action, and for , where is the best solution of . Then
an equality of predicates, where is the footprint of Definition 4.10.
The theorem says that, on straight-line paths, analysis by bi-abduction with an ideal prover infers exactly the footprint: the minimal states on which the sequence does not fault.
Formalization Note A sequence is a head action and a tail list. The canonical precondition is the inductive relation IsCanonPre, built from the proof of the theorem (the paper does not define the canonical spec in §4.2.4); its anti-frames are arbitrary ≾-least solutions, so the theorem is not an unfolding of a definition. Precision is assumed for every action of the sequence, including the last.
import Mathlib import Definitions.Def_BiAbduction_Footprint_Semantics import Definitions.Def_BiAbduction_Footprint_Footprint
namespace BiAbduction.Footprint
/-- Theorem 4.11 (Deriving Footprint, p. 50): if the precondition of every action of the sequence
`α; C` is precise and `P` is the precondition of the canonical spec of `α; C` obtained when
every bi-abduction call delivers the best anti-frame, then `foot(α; C) = P`. -/
theorem theorem_4_11 (α : Action) (C : List Action) (P : Pred)
(hprec : ∀ a ∈ α :: C, IsPrecise a.pre) (hcanon : IsCanonPre α C P) :
foot α C = P := by sorry
end BiAbduction.Footprint
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.