Paper Info
Title
Generics and verification in Ada
Abstract
This paper explores the restrictions a mechanism in the style of the Ada generics facility would have to satisfy in order to be amenable to existing verification techniques. “Generic verification” is defined and defended as the appropriate goal for any such facility. Criteria are developed for generic verification to be possible and then Ada is evaluated with respect to these criteria. An example of the application of these techniques to an Ada unit is presented to show that generic verification is possible at least on a subclass of Ada generic units. Finally some potential applications of verified generic units are presented.
Year
DOI
Venue
1980
10.1145/800004.807942
SIGPLAN '80 Proceedings of the ACM-SIGPLAN symposium on The ADA programming language
Keywords
DocType
Volume
ada,intermediate language,satisfiability
Conference
15
Issue
ISSN
ISBN
11
0362-1340
0-89791-030-3
Citations 
PageRank 
References 
2
0.45
7
Authors
2
Name
Order
Citations
PageRank
William D. Young133166.64
Donald I. Good2126132.14