The Logic of Computer Programming
保存先:
| 出版年: | IEEE Transactions on Software Engineering vol. 4, no. 3 (May 1978), p. 199 |
|---|---|
| 第一著者: | |
| その他の著者: | |
| 出版事項: |
IEEE Computer Society
|
| 主題: | |
| オンライン･アクセス: | Citation/Abstract Full Text - PDF |
| タグ: |
タグなし, このレコードへの初めてのタグを付けませんか!
|
| 抄録: | Techniques derived from mathematical logic provide an alternative to conventional methodologies for constructing, debugging, and optimizing computer programs. These techniques will lead to the automation of several facets of the programming process. It is impossible to prove mathematically that a program is free from errors, but mathematical logic can be effective in detecting bugs in programs and in imparting greater confidence in program correctness. Mathematical logic has been applied to several areas of the programming process, including: 1. correctness - proving that a given program produces the intended results, 2. termination - proving that a given program will eventually stop, 3. transformation - changing a program into an equivalent one, often to improve its efficiency (optimization), and 4. development - constructing a program to meet a given specification. The techniques may be applied with the assistance of a computer. Figure. |
|---|---|
| ISSN: | 0098-5589 1939-3520 |
| DOI: | 10.1109/TSE.1978.231499 |
| ソース: | ABI/INFORM Global |