Derivation of Veriication Rules for C from Operational Deenitions
نویسنده
چکیده
While a low-level, operational deenition of a language's semantics is a straightforward way of specifying the behaviour of programs written in that language, it is not necessarily very suitable for formal activities such as program veriication. This is clearly the case with languages such as C, where the language deenition is complicated by much tedious detail. However, the work described here demonstrates that a necessarily complicated semantics for C can still be used as the basis for the generation of \axiomatic" style rules. These can then be used to support veriication work in a way that is both familiar and not overly complex.
منابع مشابه
A Package for Inductive Relation Deenitions in Hol
This paper describes a set of theorem proving tools based on a new derived principle of deenition in HOL, namely the introduction of relations inductively deened by a set of rules. Such inductive deenitions abound in computer science. Example application areas include reasoning about structured operational semantics, type judgements, transition relations for process algebras, reduction relation...
متن کاملInterpreter Verification for a Functional Language
Starting from a denotational and a term-rewriting based operational semantics (an interpreter) for a small functional language, we present a correctness proof of the interpreter w.r.t. the denotational semantics. The complete proof has been formalized in the logic LCF and checked with the theorem prover Isabelle. Based on this proof, conclusions for mechanical theorem proving in general are dra...
متن کاملSecure mechanical verification of mutually recursive procedures
The veriication of programs that contain mutually recursive procedures is a diicult task, and one which has not been satisfactorily addressed in the literature. Published proof rules have been later discovered to be unsound. Veriication Condition Generator (VCG) tools have been eeective in partially automating the veriication of programs, but in the past these VCG tools have in general not them...
متن کاملAsynchronous Parallel Programming in Pei
This paper presents a transformational approach for the derivation of asynchronous parallel programs. Transformation rules are based on a theory, called Pei. This theory includes the deenitions of problems , programs and transformation rules. It is founded on the simple mathematical concepts of multiset and of an equivalence between their representations as data elds. Program transformations ar...
متن کاملAsm-based Mechanized Veriication of Compiler Back-ends
We describe an approach to mechanically prove the correct-ness of BURS speciications and show how such a tool can be connected with BURS based back-end generators 9]. The proofs are based on the operational semantics of both source and target system languages spec-iied by means of Abstract State Machines 14]. In 27] we decomposed the correctness condition based on these operational semantics in...
متن کامل