Axiomatic Basis for Computer Programming

By L. Osho, F. Ogwueleka, Oluwafemi Osho. 2013

993 citations recorded by the source corpus.

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.

Subfields: Artificial Intelligence, Computational Theory and Mathematics, Model Architectures, Program Analysis & Verification

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Marc Brockschmidt
  2. Yoshua Bengio
  3. Daniel Kifer
  4. Percy Liang
  5. Mohit Bansal
  6. Quoc V. Le
  7. Ruslan Salakhutdinov
  8. Justin Hsu

In Computational Theory and Mathematics

  1. Srinath T. V. Setty
  2. Jon Howell
  3. Bryan Parno
  4. Gilles Barthe
  5. Muzammil Shahbaz
  6. Shin Yoo
  7. Mark Harman
  8. Aaron Roth

In Model Architectures

  1. Shin Yoo
  2. Daniel Tarlow
  3. Earl T. Barr
  4. Bernhard Beckert
  5. Richard S. Zemel
  6. Marc Brockschmidt
  7. Jonathan Huang
  8. Suman Sekhar Jana

In Program Analysis & Verification

  1. Srinath T. V. Setty
  2. Marc Brockschmidt
  3. Bryan Parno
  4. Jon Howell
  5. Shin Yoo
  6. Gilles Barthe
  7. Mark Harman
  8. Daniel Tarlow

Citations in the corpus