No abstract

Abstract. Reasoning about prograanming language semantics with an automated proof tool requires that the semantics definition be stated in a formalism that is suitable for the tool. This paper presents a method to transform a structured operational semantics (SOS) definition 8, given by a special form of deduction system, into a term rewriting system 7~. This system 7~ simulates $ very closely in that sense that the sets of possible configuration sequences are essentially the same. Since only standard unconditional rewrite rules are used, every theorem prover based on rewriting can be employed to implement this kind of semantics definitions, and so to reason about them.

This paper reports on provably correct compiler implementation in the ESPRIT basic research action 3104 ProCoS (Provably Correct Systems). A sharp distinction is drawn between correctness of the specification of a compiler and correctness of the actual implementation. The first covers semantical correctness of the code to be generated, whereas the second concerns correctness of the compiler program with respect to the specification. The compiler construction framework presented aims at minimizing the amount of handcoding during implementation and at reusing specification correctness arguments for proving the implementation correct. The classical technique of bootstrapping compilers is revisited with respect to implementation correctness.

No abstract

No abstract

No abstract

No abstract