Intermittent Assertion Proofs in Lucid
نویسندگان
چکیده
The intermittent assertion technique of Burstall can be formulated and made rigorous in the formal-system/programming-language Lucid, in a very straightforward way. This reinforces the contention that Lucid is a framework within which many sorts of proofs of program properties may be expressed. This paper includes three proofs, all of which are the Lucid versions of intermittent assertion proofs found in the literature.
منابع مشابه
Lucid: Scope Structures and Defined Functions∗
In the paper we describe how Lucid can be extended to allow user-defined functions and scope conventions, i.e., conventions for limiting the range or scope of the validity of definitions. The new constructs added (they are called clauses) are similar in form to the blocks and procedure declarations of Algol-like languages, but are nevertheless strictly non-imperative, because a clause is actual...
متن کاملReconstruction Proofs at the Assertion Level
Most automated theorem provers suuer from the problem that they can produce proofs only in formalisms diicult to understand even for experienced mathematicians. EEort has been made to reconstruct natural deduction (ND) proofs from such machine generated proofs. Although the single steps in ND proofs are easy to understand, the entire proof is usually at a low level of abstraction, containing to...
متن کاملIndexical translation of tail-recursive functions
We show that a very general form of Lucid (and RLucid) tail-recursive function can be transformed into an indexical equivalent. We show also that the standard indexical translations of the wvr and upon functions can be considered to be particular cases of the general situation. We give full proofs of the results, taking advantage of the clean semantics of Lucid.
متن کاملAssertion level proof planning with compiled strategies
The objective of this thesis is to ease the formalization of proofs by being able to verify as well as to automatically construct abstract human-style proofs. This is achieved by lifting the logical basis to the abstract assertion level, which has been identified as a style of reasoning that can be found in textbooks. A case study shows that automatic reasoning procedures benefit from the abstr...
متن کاملNoninterference Proofs through Flow Analysis
This note proves noninterference results (NI) for the secrecy analyses for LA and LAM presented in [1], using the inductive information ow analysis. This ow analysis is related to the secrecy typing in [1] in that, while the latter ensures safety of information ow, the former extracts ow of information. The presentation and study of ow analysis is restricted to its use in NI proofs: further stu...
متن کامل