Deriving a Hoare-Floyd logic for non-local jumps from a formulae-as-types notion of control
Texte intégral
Documents relatifs
Deriving Local Internal Logic for Black Box Models 3 The feature values that in conjunction or disjunction are relevant for a pre- diction are highlighted by a local
Here a Floyd-Hoare triple { p } f { q } means that when the program’s input data d satisfies the pre-condition (q(d) is defined and true), and the program termi- nates on d, and
In the previous works [8, 9] we have considered extensions of Floyd-Hoare logic to partial mappings over data represented as partial mappings on named values (called nominative
We derive a Floyd-Hoare logic for non-local jumps and mutable higher-order procedural variables from a for- mulæ-as-types notion of control for classical logic.. A key contribution
We present a Hoare logic for a call-by-value programming language equipped with recursive, higher-order functions, algebraic data types, and a polymorphic type system in the style
In joint work with Peter O’Hearn and others, based on early ideas of Burstall, we have developed an extension of Hoare logic that permits reasoning about low-level impera- tive
We provide an axiomatization and a Kripke model se- mantics for the logic C ICL , prove that the axiomatization is sound and complete with respect to the semantics, and define a
Although we can use the termination tool to generate WF relations for all cyclic paths, these relations cannot be used as variants for Hoare logic.. First, there may be nested