Program derivation
In computer science, program derivation is the derivation a program from its specification, by mathematical means.
~ ~ ~ ~ ~ ~ ~ ~ ~ ~
To derive a program means to write a formal specification, which is usually non-executable, and then apply mathematically correct rules in order to obtain an executable program. The program thus obtained is then proved correct by construction.
~ ~ ~ ~ ~ ~ ~ ~ ~ ~
The approach usually taken in Formal verification is to first write a program, and then provide a proof that it conforms to a given specification. The main problems with this are that
Related Topics:
Formal verification - Proof - Specification
~ ~ ~ ~ ~ ~ ~ ~ ~ ~
- the resulting proof is long and cumbersome
- no insight is given as to how the program was developed; it appears "like a rabbit out of a hat"
- keeping proofs short, by development of appropriate mathematical notations
- discovering the program by manipulation of the specification
Program derivation tries to remedy these shortcomings by
~ ~ ~ ~ ~ ~ ~ ~ ~ ~
Terms that are roughly synonymous with program derivation are: transformational programming, algorithmics, deductive programming.
~ ~ ~ ~ ~ ~ ~ ~ ~ ~
~ Table of Content ~
| ► | Introduction |
| ► | See also |
| ► | References |
~ What's Hot ~
~ Community ~
| ► | History Forum Come and discuss about History, Civilizations, Historical Events and Figures |
| ► | History Web-Ring A community of sites, blogs and forums dedicated to History. Do not hesitate to submit your site. |
and are licensed under the GNU Free Documentation License.
Lexicon - Privacy Policy - Spiritus-Temporis.com ©2005.