Writing Larch interface language specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
ANNA: a language for annotating Ada programs
ANNA: a language for annotating Ada programs
Integration of program construction and verification: the PROSPECTRA methodology
Proc. of the CRAI Workshop on Software Factories and Ada on System development and Ada
The synthesizer generator: a system for constructing language-based editors
The synthesizer generator: a system for constructing language-based editors
Simplification by Cooperating Decision Procedures
ACM Transactions on Programming Languages and Systems (TOPLAS)
The Science of Programming
A Discipline of Programming
Towards reuse of verified Ada software
TRI-Ada '90 Proceedings of the conference on TRI-ADA '90
Representing abstract architectures with axiomatic specifications and activation conditions
ECBS'97 Proceedings of the 1997 international conference on Engineering of computer-based systems
| Hi-index | 0.00 |
We are investigating the practical application of formal verification methods to Ada programs. Our motivation is the usual one: formal mathematical proof that a program is correct reduces the reliance on ad hoc testing procedures for quality assurance. In addition, the wide availability of Ada compilers makes it possible that formally specified and verified software could be widely used, which would be desirable in itself and would also provide practical data about its costs and benefits.Our specific goals:To accommodate a rich subset of (sequential) Ada—including packages, side effects, access types, exception-raising, and exception-handling—convenient for writing efficient programs.To explore ways of making verification more tractable and therefore more practical by exploiting strategies of interactive, incremental development of program and proof. Experiments are conducted on a running system prototype called Penelope.To provide the verification system with a formal mathematical basis.