Verification of Array, Record, and Pointer Operations in Pascal
ACM Transactions on Programming Languages and Systems (TOPLAS)
Ada exception handling: an axiomatic approach
ACM Transactions on Programming Languages and Systems (TOPLAS)
Derivation of Invariant Assertions During Program Development by Transformation
ACM Transactions on Programming Languages and Systems (TOPLAS)
An axiomatic basis for computer programming
Communications of the ACM
Stanford Pascal Verifier user manual
Stanford Pascal Verifier user manual
A practical method of documenting and verifying Ada programs with packages
SIGPLAN '80 Proceedings of the ACM-SIGPLAN symposium on Ada programming language
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
Specification and Analysis of System Architecture Using Rapide
IEEE Transactions on Software Engineering - Special issue on software architecture
Concurrent Error Detection Using Watchdog Processors-A Survey
IEEE Transactions on Computers
PDL/Ada—a design language based on Ada
ACM '81 Proceedings of the ACM '81 conference
Ada packages and the user's conceptual model
ACM SIGAda Ada Letters
Consistency checking in Ada and Anna: a transformational approach
ACM SIGAda Ada Letters
PDL/Ada: a design language based on Ada
ACM SIGAda Ada Letters
| Hi-index | 0.00 |
ANNA is a proposal to extend Ada to include facilities for formally specifying the intended behaviour of Ada programs (or portions thereof) at all stages of program development. ANNA programs are Ada programs with formal comments. Formal comments in ANNA consist of virtual Ada text and annotations. The syntax and semantics of different kinds of annotations are defined: declarative annotations (for variables, subtypes, subprograms, and packages), statement annotations, exception annotations, and visibility annotations. ANNA includes a small number of predefined attributes which may appear only in annotations, e.g., access type collections.The lexical structure of ANNA is designed so that the extensions of Ada appear as Ada comments. ANNA programs are therefore acceptable by Ada translators. The semantics of annotations are defined in terms of Ada concepts, in particular many annotations are generalization of the constraint concept. It is therefore a simple step for the Ada programmer to use ANNA to give formal specifications of programs.ANNA is intended to provide a formal framework within which different theories of formal specification may be applied to Ada. Our proposal omits tasking for the time being.