On unlimited types and reliability of Ada programs

Authors:
Albert Llamosí;Pere Botella;Fernando Orejas
Affiliations:
Universitat Politècnica de Catalunya, Barcelona, Spain;Universitat Politècnica de Catalunya, Barcelona, Spain;Universitat Politècnica de Catalunya, Barcelona, Spain
Venue:
ACM SIGAda Ada Letters
Year:
1984

Citing 6
Cited 2

A proof system for verifying composability of abstract implementation.

Proc. of the international symposium on Semantics of data types
On the Representation of Data Types

Proceedings of the International Colloquium on Formalization of Programming Concepts
Characterizing Composability of Abstract Implementations

Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
Programming with abstract data types

Proceedings of the ACM SIGPLAN symposium on Very high level languages
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

On Ada packages, types and task types

ACM SIGAda Ada Letters
Abstract data types are under full control with Ada 9X

TRI-Ada '94 Proceedings of the conference on TRI-Ada '94

Quantified Score

Hi-index	0.00

Visualization

Abstract

The decision to mix two such different concepts as assignment and test for equality in the same feature of Ada language is submitted to criticism. Its consequences on reliability and modifiability of programs are considered and some methodological conclusions are drawn out.