Formal Verification of Ada Programs

Reusable software components

“…However, the more recent work, including some related to Alphard (Shaw, 1981), Modula-2 (Ernst et al, 1982), Ada/ANNA (Luckham et al, 1987), and Larch/Ada with an interesting subset of Ada (Guaspari et al, 1990), bears directly on the verification of reusable components. It follows the general lines of decade-earlier efforts but concentrates on modularity of proofs and programs and on examples comparable to those envisioned as implementations of non-trivial reusable components.…”

Formal methods for extensions to CAS

“…Each has been designed to investigate various aspects of imperative programming such as inheritance [23] and concurrency [21] as well as different development methodologies such as specification browsing [5] and interactive program verification [15]. The syntax and use of BISL specifications is essentially the same in all languages.…”

“…One exception is Larch/Ada [15] which uses a syntax-directed editor called Penelope [15] for the interactive development and verification of Larch/Ada programs. Another exception is Larch/C [10] for which the LcLint [10] static program checker has been written.…”

A brief summary of VSPEC

“…Then, first order predicates define component behavior using a traditional axiomatic style. Larch Interface Languages exist for a variety of programming languages, including C [8,9], C++ [10] and Ada [11].…”