C. McGowan. An inductive proof technique for interpreter equivalence. In R. Rustin, editor, Formal Semantics of Programming Languages, pages 139-148. Prentice-Hall, 1972. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Structure-Preserving Binary Relations for Program Abstraction - Schmidt (2002) (1 citation) (Correct)
....Kripke structure [4, 12, 34, 37] A left total simulation ensures that every state in the concrete structure can be modelled in the abstract structure. Right totality ensures that there are no super uous abstract states. Simulations play a crucial role in equivalence proofs of interpreters [20]: Each execution step of interpreter, C, for a source programming language is mimicked by a (sequence of) execution steps of an interpreter, A, for the target programming language, and mathematical induction justi es that sequences of transitions taken by C can be mimicked by A. Coinductive ....
C. McGowan. An inductive proof technique for interpreter equivalence. In R. Rustin, editor, Formal Semantics of Programming Languages, pages 139-148. Prentice-Hall, 1972.
Binary Relations for Abstraction and Refinement - Schmidt (Correct)
....simulation iff for every c 2 6C , a 2 6A , if c R a, then I C (c) I A (a) and if c 0 c Property preserving simulations can be characterized similarly. Simulations played a crucial role in equivalence proofs of interpreters defined by operational semantics definitions [32], where each execution step of an interpreter, C, for a source programming language is mimicked by a (sequence of) execution steps of an interpreter, A, for the target programming language (and vice versa) Mathematical induction justifies that every finite sequence of transitions taken within C ....
C. McGowan. An inductive proof technique for interpreter equivalence. In R. Rustin, editor, Formal Semantics of Programming Languages, pages 139-- 148. Prentice-Hall, 1972.
Binary Relations for Abstraction and Refinement - Schmidt (2000) (Correct)
....IA (a) and if c Gamma c 0 ; then there exists a 0 2 Sigma A such that a Gamma a 0 and c 0 R a 0 : Property preserving simulations can be characterized similarly. Simulations played a crucial role in equivalence proofs of interpreters defined by operational semantics definitions [32], where each execution step of an interpreter, C, for a source programming language is mimicked by a (sequence of) execution steps of an interpreter, A, for the target programming language (and vice versa) Mathematical induction justifies that every finite sequence of transitions taken within C ....
C. McGowan. An inductive proof technique for interpreter equivalence. In R. Rustin, editor, Formal Semantics of Programming Languages, pages 139-- 148. Prentice-Hall, 1972.
A Verified Code Generator For A Subset Of Gypsy - Young (1988) (14 citations) (Correct)
....which establish an equivalence class of significantly different, practically important interpreters [Wegner 72a] McGowan [McGowan 71] proves the equivalence of three interpreters for lambda calculus and Berry [Berry 71] proves the equivalence of two models of block structure semantics. McGowan [McGowan 72] outlines a theory of interpreter equivalence theorems very similar to those we discussed in chapter 2. These writers also recognized the applicability of these proof techniques to compilers. The first attempt to prove compilation via an interpreter equivalence proof seems to be the proof of ....
C. McGowan. An Inductive Proof Technique for Interpreter Equivalence. Formal Semantics of Programming Languages. Prentice-Hall, Englewood Cliffs, N.J., 1972, pages 139-147.
Formal Methods - Selected Historical References - Jones, McCauley (1992) (1 citation) (Correct)
No context found.
C. L. McGowan. An inductive proof technique for interpreter equivalence. In [512], pages 139--148. 1972.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC