Titlebook: Computer-Aided Reasoning; ACL2 Case Studies Matt Kaufmann,Panagiotis Manolios,J. Strother Moor Book 2000 Springer Science+Business Media Ne

食草

Verification of a Simple Pipelined Machine Modelriant conditions about executed instructions. The author used a similar approach to verify a more realistic pipelined machine. This chapter serves as an introduction to the verification of pipelined machines.

鉗子

pineal-gland

Introductionsystems and their desired properties are modeled with formulas in a mathematical language. That language has an associated mechanized reasoning tool, called ACL2, which is used to prove that these properties hold. With these techniques it is possible to describe components clearly and reliably, perm

assent

interpose

大喘氣

Modular Proof: The Fundamental Theorem of Calculusment process and to assist in proof presentation. An application is presented: a formalization and proof of the Fundamental Theorem of Calculus. An unusual characteristic of this application is the use of non-standard analysis, which however is not a prerequisite either for this chapter or for the u

Mediocre

critique

上下連貫

Verification of a Simple Pipelined Machine Modelnd its specification which executes instructions sequentially. To study this problem, we define a simple three-stage pipelined machine in ACL2. We prove that this pipelined machine returns the same result as its specification machine. In order to ease the proof, we define an intermediate abstraction

Veneer