1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
|
<html>
<head><title>Proving_Theorems_about_Models.html -- ACL2 Version 3.1</title></head>
<body text=#000000 bgcolor="#FFFFFF">
<h2>Proving Theorems about Models</h2>
<p>
But ACL2 is a <b>logic</B>. We can <b>prove theorems about the model</B>.<p>
<p>
<img src=computing-machine-xxy.gif><p>
<p>
<pre>
<b>Theorem. MC 'mult is a multiplier</B>
(implies (and (natp x)
(natp y))
(equal (lookup 'z (mc (s 'mult x y) (mclk x)))
(* x y))).
</pre>
<p>
This theorem says that a certain program running on the <b>mc</B> machine
will correctly multiply <b>any two natural numbers</B>.<p>
It is a statement about an <b>infinite</B> number of test cases!<p>
We know it is true about the model because we <b>proved</B> it.<p>
<a href="What_is_Required_of_the_User_lparen_Q_rparen_.html"><img src=flying.gif></a>
<br><br><br><a href="acl2-doc.html"><img src="llogo.gif"></a> <a href="acl2-doc-index.html"><img src="index.gif"></a>
</body>
</html>
|
