An environment for Ada software development based on formal specification
ACM SIGAda Ada Letters
Surveyors' forum: runtime checking and debugging of formally specified programs
ACM Computing Surveys (CSUR)
Run-time consistency checking of algebraic specifications
TAV4 Proceedings of the symposium on Testing, analysis, and verification
Towards a method of programming with assertions
ICSE '92 Proceedings of the 14th international conference on Software engineering
A Practical Approach to Programming With Assertions
IEEE Transactions on Software Engineering
Tool support for formal methods
ICSE '91 Proceedings of the 13th international conference on Software engineering
Hi-index | 0.00 |
We present in this report a complete description of a methodology for transformation of Anna (Annotated Ada) programs to executable self-checking Ada programs. The methodology covers a subset of Anna which allows annotation of scalar types and objects. The allowed annotations include subtype annotations, subprogram annotations, result annotations, object annotations, out annotations and statement annotations. Except for package state expressions and quantified expressions, the full expression language of Anna is allowed in the subset. The transformation of annotations to executable checking functions is thoroughly illustrated through informal textual description, universal checking function templates and several transformation examples. We also describe the transformer and related software tools used to transform Anna programs. In conclusion, we describe validation of the transformer and some methods of making the transformation and runtime checking processes more efficient.