Formal Methods in System Design

, Volume 4, Issue 1, pp 5–31

A proof of the nonrestoring division algorithm and its implementation on an ALU

Authors

  • D. Verkest
    • IMEC
  • L. Claesen
    • IMEC
  • H. De Man
    • IMEC
Article

DOI: 10.1007/BF01383955

Cite this article as:
Verkest, D., Claesen, L. & De Man, H. Form Method Syst Des (1994) 4: 5. doi:10.1007/BF01383955

Abstract

This article describes a proof of the functional correctness of a nonrestoring division algorithm and its implementation on an ALU. The first part of the proof deals with the correctness of the division algorithm with respect to a specification of division on the integer level. The second part is concerned with the correctness of the actual implementation, which is proven by checking several refinements of the algorithm. All the proofs have been mechanically checked with the Boyer-Moore theorem-proving system, in some cases making use of the interactive proof checker for the system.

Keywords

nonrestoring division algorithmcorrectnessALU implementationBoyer-Moore theoremproving system

Copyright information

© Kluwer Academic Publishers 1994