Semantic Scholar
Open Access
2013
1002 sitasi
Axiomatic Basis for Computer Programming
L. Osho
F. Ogwueleka
Oluwafemi Osho
Abstrak
This paper considers a formal method, known as axiomatic semantics, used to prove the correctness of a computer program. This formal method extracts, using some proof rules, the mathematical verification conditions from a computer program. The axioms of program flow, including, sequential flow, iteration, and alternation flows are presented. Using the axiomatic basis the completeness of two variants of integer multiplication program is proved. Results show that computer programs can actually be verified sufficiently for correctness without necessarily testing them, or more practically put, to complement their testing.
Topik & Kata Kunci
Penulis (3)
L
L. Osho
F
F. Ogwueleka
O
Oluwafemi Osho
Akses Cepat
Informasi Jurnal
- Tahun Terbit
- 2013
- Bahasa
- en
- Total Sitasi
- 1002×
- Sumber Database
- Semantic Scholar
- DOI
- 10.13189/UJCMJ.2013.010301
- Akses
- Open Access ✓