A theory of problem domains and program correctness
A model of a problem domain is introduced comprising a set of variable names, a language describing computations on these variables, and an abstract machine specifying the semantics of the language. The model allows hierarchical definition of an implementation at a low level of a problem defined at a high level. Several modes of real analysis, including a realistic binary computer, are given in terms of well-defined mathematical constructs. A simple, high-level problem specification is used to describe the process of hierarchical definition and proof. The primary software tool proposed for use in proofs is an existing compiler deriving a system specification from that of its parts and interconnections. 9 refs.
- Research Organization:
- Argonne National Lab., IL (USA)
- DOE Contract Number:
- W-31109-ENG-38
- OSTI ID:
- 6200653
- Report Number(s):
- ANL/PPRNT-89-155; ON: DE89008451
- Resource Relation:
- Other Information: Portions of this document are illegible in microfiche products
- Country of Publication:
- United States
- Language:
- English
Similar Records
A theory of program correctness, and algorithms for proofs
Very high level concurrent programming