Abstract
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.
Highlights
Computer programming is consisted in the designing, writing, testing, debugging, and maintaining of the source code of computer programs
Programming occurs at the implementation phase of the software development life cycle (SDLC) [1]
An axiomatic method has the potency of providing basis for measuring the quality of a programming language [7]
Summary
At this phase, the software is verified to ascertain its capability to do what it is expected to do under all conditions. The software is verified to ascertain its capability to do what it is expected to do under all conditions It is at this stage that design and implementation flaws are supposed to be detected [5]. Testing incorporates debugging, which is the process of finding and removing errors (bugs) in a program [6]
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
