R. L. London. Correctness of two compilers for a Lisp subset. Technical Report CS240, Computer Science Dept, Stanford University, October 1971. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
On the Search for Tractable Ways of Reasoning about Programs - Jones (2001) (8 citations) (Correct)
....of the research; it is not necessarily a value judgement on the work to collect together in this section some of the papers which have had less in uence sometimes just because of an accident of timing etc. Ralph London produced a string of early papers [Lon64, Lon70c, Lon70a, Lon70b, Lon70d, Lon71] on veri cation topics. One early avenue of research into programs involved proofs about the equivalence of schemas which are like owcharts with uninterpreted operations in their boxes. The majority of the results are about (un)decidability. Early papers by Russian (e.g. Yan58] and Japanese ....
R. L. London. Correctness of two compilers for a Lisp subset. Technical Report CS240, Computer Science Dept, Stanford University, October 1971.
A Verified Implementation of an Applicative Language with Dynamic .. - Flatau (1992) (5 citations) (Correct)
....Their target machine has an unbounded stack, infinite precision, an unbounded number of registers and the operations of the target machine are the same as the expression language. Their compiler implements a simple constant folding optimization. Technical Report #83 January 6, 1993 5 London [18] proves by hand the correctness of two versions of a compiler for a subset of Lisp. The second version contains more optimizations than the first. Morris [24] uses algebraic semantics to specify and partially prove by hand a simple compiler for an Algol like language. Cohn [11] use Edinburgh LCF ....
R.L. London. Correctness of two compilers for a lisp subset. Technical Report AIM-151, Stanford Univerity Artificial Intelligence Laboratory, October 1971.
The Early Search for Tractable Ways of Reasoning About Programs - Jones (2003) (Correct)
No context found.
R. L. London. Correctness of two compilers for a Lisp subset. Technical Report CS240, Computer Science Dept, Stanford University, October 1971.
A Verified Code Generator For A Subset Of Gypsy - Young (1988) (14 citations) (Correct)
No context found.
R.L. London. Correctness of Two Compilers for a Lisp Subset. Technical Report AIM-151, Stanford Univerity Artificial Intelligence Laboratory, October, 1971. 865
Formal Methods - Selected Historical References - Jones, McCauley (1992) (1 citation) (Correct)
No context found.
R. L. London. Correctness of two compilers for a Lisp subset. Technical Report CS240, Computer Science Dept, Stanford University, October 1971.
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