Some verification problems in Pascal-like languages

Authors:
Joseph V. Giordano
Affiliations:
TRW DSSG, Redondo Beach, California
Venue:
ACM SIGSOFT Software Engineering Notes
Year:
1980

Citing 9
Cited 0

Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom Systems

Journal of the ACM (JACM)
Verification of Array, Record, and Pointer Operations in Pascal

ACM Transactions on Programming Languages and Systems (TOPLAS)
An axiomatic basis for computer programming

Communications of the ACM
Complementary Definitions of Programming Language Semantics

Complementary Definitions of Programming Language Semantics
Gypsy: A language for specification and implementation of verifiable programs

Proceedings of an ACM conference on Language design for reliable software
Notes on the design of Euclid

Proceedings of an ACM conference on Language design for reliable software
Preliminary Ada reference manual

ACM SIGPLAN Notices - Preliminary Ada reference manual
Rationale for the design of the Ada programming language

ACM SIGPLAN Notices - Rationale for the deisgn of the Ada programming language
Report on the programming language Euclid

ACM SIGPLAN Notices

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper discusses the design of programming languages suitable for program verification, considering in particular Pascal, Euclid, Gypsy, and Ada. Basing our discussion on programming capabilities found in Pascal, we evaluate (a) how well each language solves or reduces verification problems such as name visibility, aliasing, relative completeness, side effects and (b) how the language's treatment of these verification problems impacts other language design concerns.