Executable assertions and separate compilation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1204, Issue , 1997, Pages 41-52

  John Gough, K ^a   Klaeren, Herbert ^b  

^a QUEENSLAND UNIVERSITY OF TECHNOLOGY   (Australia)

^b UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

Elimination of redundant checks; Executable assertions; Separate compilation; Value propagation

Indexed keywords

COMPUTATIONAL LINGUISTICS; OBJECT ORIENTED PROGRAMMING; SEPARATION;

COMPILE TIME; ELIMINATION OF REDUNDANT CHECKS; EXECUTABLE ASSERTIONS; EXTENSIBLE SYSTEMS; INTER-PROCEDURAL ANALYSIS; PROGRAMMING TECHNIQUE; SEPARATE COMPILATION;

STATIC ANALYSIS;

EID: 84957663790     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62599-2_29     Document Type: Conference Paper

References (13)

1. Diane Corney and John Gough. Type test elimination using typeflow analysis. In Jürg Gutknecht, editor, Proceedings Int. Confr. Programming Languages and System Architectures, volume 782 of Lecture Notes in Computer Science, pages 137-150. Springer Verlag, 1994.
2. Régis Crelier. Separate Compilation and Module Extension. PhD thesis, Swiss Federal Institute of Technology, Zürich, Switzerland, 1994. Diss. ETH No. 10650.
3. K John Gough and Herbert Klaeren. Eliminating range checks using static single assignment form. In Proceedings ACSC19, Melbourne, Australia. Australian Computer Science Society, 1996.
4. Rajiv Gupta. A fresh look at optimizing array bound checking. In Proc. ACM SIGPLAN'90 Gonfr. Programming Language Design and Implementation, volume 25(6) of SIGPLAN Notices, pages 272-282, 1990.
5. Rajiv Gupta. Optimizing array bound checks using flow analysis. ACM Letters on Programming Languages and Systems, 2(1-4):135-150, 1993.
6. ISO. Information Technology - Programming Languages - Modula-2. IS 10154-1- International Standards Organisation, June 1996.
7. Victoria Markstein, John Cocke, and Peter Markstein. Optimization of range checking. In Proc. of ACM '82 Symposium on Compiler Construction, pages 114-119, 1982.
8. Bertrand Meyer. Eiffel: The Language. Englewood Cliffs, 1991.
9. Bertrand Meyer. Applying "Design by Contract." IEEE Computer, 25(10):40-51, 1992.
10. QUT. Gardens Point Modula Home Page. http://www.fit.qut.edu.au/- CompSci/PLAS/GPM. Information on gardens point compilers, their availability, and documentation.
11. Rob Strom. Do programmers need seat belts? SIGPLAN Notices, 31(3):6-7, 1996.
12. N. Wirth and C. A. R. Hoare. A contribution to the development of Algol. Communications of the ACM, 9:413-431, 1966.
13. Niklaus Wirth. Programming in Modula-2. Springer, 3rd edition, 1985.