论文信息 - On Legality Assertions in Euclid

On Legality Assertions in Euclid

The design of the programming language Euclid requires that a compiler for the language produce legality assertions to aid in verification of programs written in the language. This paper analyzes the legality assertions that must be produced and discusses the impact that this requirement has on the implementation of the language.

David B. Wortman

[1] David B. Wortman,et al. Static and Dynamic Characteristics of XPL Programs , 1975, Computer.

[2] David Gries,et al. Compiler Construction for Digital Computers , 1971 .

[3] Donald E. Knuth,et al. An empirical study of FORTRAN programs , 1971, Softw. Pract. Exp..

[4] J. Welsh. Economic range checks in pascal , 1978, Softw. Pract. Exp..

[5] Butler W. Lampson,et al. Notes on the design of Euclid , 1977, Language Design for Reliable Software.

[6] Richard C. Holt,et al. The Euclid Language: a progress report , 1978, ACM Annual Conference.

[7] Patrick Cousot,et al. Static determination of dynamic properties of programs , 1976 .

[8] J. J. Horning,et al. Report on the programming language Euclid , 1977, SIGP.

[9] Patrick Cousot,et al. Static determination of dynamic properties of generalized type unions , 1977, Language Design for Reliable Software.

[10] William H. Harrison. A New Strategy for Code Generation - the General-Purpose Optimizing Compiler , 1979, IEEE Trans. Software Eng..

[11] Nicolas Halbwachs,et al. Automatic discovery of linear restraints among variables of a program , 1978, POPL.

[12] William H. Harrison,et al. Compiler Analysis of the Value Ranges for Variables , 1977, IEEE Transactions on Software Engineering.