Efficient implementation and optimization of run-time checking in PASCAL

Authors:
Charles N. Fischer;Richard J. LeBlanc
Affiliations:
Computer Sciences Department, University of Wisconsin, Madison, Wisconsin;Computer Sciences Department, University of Wisconsin, Madison, Wisconsin
Venue:
Proceedings of an ACM conference on Language design for reliable software
Year:
1977

Citing 7
Cited 1

High-level binding with low-level linkers

Communications of the ACM
A unified approach to global program optimization

POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
PASCAL user manual and report

PASCAL user manual and report
An assessment of the programming language PASCAL

Proceedings of the international conference on Reliable software
Reply to a paper by A. N. Habermann on the programming language Pascal

ACM SIGPLAN Notices
A mathematical theory of global program optimization (Prentice-Hall series in automatic computation)

A mathematical theory of global program optimization (Prentice-Hall series in automatic computation)
SIMULA 67 common base language, (Norwegian Computing Center. Publication)

SIMULA 67 common base language, (Norwegian Computing Center. Publication)

Extensions to PASCAL for separate compilation

ACM SIGPLAN Notices

Quantified Score

Hi-index	0.00

Visualization

Abstract

Complete run-time checking of programs is an essential tool for the development of reliable software. A number of features of the programming language PASCAL (arrays, subranges, pointers, record variants (discriminated type unions), formal procedures, etc.) can require some checking at run-time as well as during compilation. The problem of efficiently implementing such checking is considered. Language modifications to simplify such checking are suggested. The possibility of optimizing such checking is discussed.