Work

Axiomatic Basis for Computer Programming

Year: 2013

Type: article

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.

Source: Universal Journal of Computational Mathematics

DOI: 10.13189/ujcmj.2013.010301

Authors: Lauretta O. Osho, Francisca Ogwueleka, Oluwafemi Osho

Institutions: Federal University of Technology Minna, Federal University Wukari

Language: English

Topic: Logic, programming, and type systems

Subfield: Software

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

OpenAlex ID: W2097704387

FWCI: 3.907

Cites: 14

Cited by: 67

Related to: 10