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

Ordeal

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 utility of the proof methodology presented herein.

justify

Symbolic Trajectory Evaluationentation and has been used in industrial settings to verify hardware designs. This study presents no new theoretical results in STE but formalizes the fundamental concepts so that they may be incorporated into a theorem proving environment such as ACL2. A simple example of its use is presented.

指數(shù)

Knuth’s Generalization of McCarthy’s 91 Functiony’s 91 function. This case study explores a largely successful attempt to use ACL2 to meet Knuth’s challenge. . numbers are dealt with by mechanically verifying results that are true, not only about the field of all . numbers, but also about every subfield of that field.

HUMP

crease

治愈

cipher

monogamy

https://doi.org/10.1007/b104927ibe the behavior (over time) of systems which continuously interact with their environment. Model-checking algorithms are used to decide if a finite-state system satisfies a temporal logic formula. Many temporal logics, ., and .* can be translated into the Mu-Calculus. In addition, the algorithm tha

IRK

https://doi.org/10.1007/b104927s, and allow hardware/software co-design. Writing such an executable model in ACL2 brings the additional benefit of formal analysis; however, much care is required to construct an ACL2 model that is both fast and analyzable. In this chapter, we develop techniques for the construction of high-speed f

厚臉皮