Modular verification of Ada generics☆
References (30)
Some definitional suggestions for automata theory
J. Comput. Syst. Sci.
(1967)Soundness and completeness of an axiom system for program verification
SIAM J. Comput.
(1978)Programming language constructs for which it is impossible to obtain good Hoare axiom systems
J. ACM
(1979)- et al.
Behavioral equivalence relations induced by programming logics
(1983) - et al.
Verification of procedures with procedure-type parameters
Acta inform.
(1982) - et al.
Generics and verification in Ada
- et al.
Modular verification of concurrent programs
Sound and complete Hoare-like calculi based on copy rules
Acta inform.
(1981)
Semantics of programming languages for modular verification
Complementary definitions of programming language semantics
A complete axiomatic system for proving assertions about recursive and non-recursive programs
A good Hoare axiom system for an algol-like language
The semantics of local storage, or what makes the fre-list free?
Cited by (0)
- ☆
This research was partially supported by the National Science Foundation under grant CCR-8802312.
Copyright © 1991 Published by Elsevier Ltd.