6
This file is meant for running the proof of the simplified bakery
7
implementation. We decompose our proof into a number of books. Each of the
8
books should certify in ACL2 V2.6. The result is a proof of the bakery
9
implementation being refinement upto finite stuttering to a simplified model.
10
The model is simple enough for it to be obvious that it has all the properties
11
we need. The proof is now a guarantee that the implementation guarantees the
14
Note: We designate all the final theorems and the functions they involve with a
15
capital DEFTHM and DEFUN respectively, so that they are easy to identify.
17
The theorems we prove are summarized in final-theorems.lisp. This book should
18
be a proof that the implementation is a stuttering bisimulation of the
21
Where applicable, (in fact in all the theorems other than >>-stutter2,) we
22
prove the corresponding version of the theorem without fairness assumptions. It
23
turns out that the fairness is required only in the theorem >>-stutter2, and I
24
hope this fact becomes evident in the proof.
28
(set-inhibit-output-lst '(proof-tree prove))
32
(certify-book "total-order")
35
(certify-book "apply-total-order")
38
(certify-book "records")
41
(certify-book "variables")
44
(certify-book "measures")
47
(certify-book "fairenv")
50
(certify-book "lexicographic")
53
(certify-book "programs")
56
(certify-book "properties-of-sets")
59
(certify-book "properties")
62
(certify-book "initial-state")
65
(certify-book "labels")
68
(certify-book "stutter1-match")
71
(certify-book "pos=1+temp")
74
(certify-book "lexicographic-pos")
77
(certify-book "stutter2")
80
(certify-book "inv-sufficient")
83
(certify-book "inv-persists")
86
(certify-book "final-theorems")
89
(set-inhibit-output-lst '(proof-tree))