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
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
|
; Copyright (C) 2019 Centaur Technology
;
; Contact:
; Centaur Technology Formal Verification Group
; 7600-C N. Capital of Texas Highway, Suite 300, Austin, TX 78731, USA.
; http://www.centtech.com/
;
; License: (An MIT/X11-style license)
;
; Permission is hereby granted, free of charge, to any person obtaining a
; copy of this software and associated documentation files (the "Software"),
; to deal in the Software without restriction, including without limitation
; the rights to use, copy, modify, merge, publish, distribute, sublicense,
; and/or sell copies of the Software, and to permit persons to whom the
; Software is furnished to do so, subject to the following conditions:
;
; The above copyright notice and this permission notice shall be included in
; all copies or substantial portions of the Software.
;
; THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
; IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
; FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
; AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
; LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
; FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
; DEALINGS IN THE SOFTWARE.
;
; Original author: Sol Swords <sswords@centtech.com>
; Updated by: Mertcan Temel (8/29/2019)
(in-package "CMR")
(include-book "std/util/bstar" :dir :system)
(include-book "std/util/define" :dir :system)
(include-book "tools/templates" :dir :system)
(include-book "std/lists/list-defuns" :dir :system)
(include-book "clause-processors/meta-extract-user" :dir :system)
(defun function-deps (fn wrld)
(b* ((body (getpropc fn 'acl2::unnormalized-body nil wrld)))
(acl2::all-fnnames body)))
(defun function-deps-lst (fns wrld acc)
(if (atom fns)
acc
(b* ((body (getpropc (car fns) 'acl2::unnormalized-body nil wrld)))
(function-deps-lst (cdr fns) wrld (acl2::all-fnnames1 nil body acc)))))
(mutual-recursion
(defun collect-toposort-function-deps (fn wrld seen toposort)
(declare (xargs :mode :program))
(b* (((when (member-eq fn seen))
(mv seen toposort))
(clique (or (getpropc fn 'acl2::recursivep nil wrld) (list fn)))
(deps (function-deps-lst clique wrld nil))
(seen (append clique seen))
((mv seen toposort)
(collect-toposort-function-deps-list deps wrld seen toposort)))
(mv seen (append clique toposort))))
(defun collect-toposort-function-deps-list (fns wrld seen toposort)
(b* (((when (atom fns)) (mv seen toposort))
((mv seen toposort) (collect-toposort-function-deps (car fns) wrld seen toposort)))
(collect-toposort-function-deps-list (cdr fns) wrld seen toposort))))
(defun formula-check-tests (formulas state)
(declare (xargs :stobjs state :mode :program))
(if (atom formulas)
nil
(cons `(equal (meta-extract-formula ',(car formulas) state)
',(meta-extract-formula (car formulas) state))
(formula-check-tests (cdr formulas) state))))
(defun def-formula-checker-fn (name formulas state)
(declare (xargs :stobjs state :mode :program))
`(define ,name (state)
:returns (ok)
(and . ,(formula-check-tests formulas state))
///
(table formula-checkers ',name ',formulas)))
(defmacro def-formula-checker (name formulas)
`(make-event
(def-formula-checker-fn ',name ',formulas state)))
(defun formula-checks-lemmas (name formulas state)
(declare (xargs :stobjs state :mode :program))
(if (atom formulas)
nil
(cons `(defthm ,(intern-in-package-of-symbol
(concatenate 'string "META-EXTRACT-FORMULA-" (symbol-name (car formulas))
"-WHEN-" (symbol-name name))
name)
(implies (,name state)
(equal (meta-extract-formula ',(car formulas) state)
',(meta-extract-formula (car formulas) state)))
:hints(("Goal" :in-theory (enable ,name))))
(formula-checks-lemmas name (cdr formulas) state))))
(defun def-formula-checker-lemmas-fn (name formulas state)
(declare (xargs :stobjs state :mode :program))
`(defsection ,(intern-in-package-of-symbol
(concatenate 'string (symbol-name name) "-LEMMAS")
name)
. ,(formula-checks-lemmas name formulas state)))
(defmacro def-formula-checker-lemmas (name formulas)
`(make-event
(def-formula-checker-lemmas-fn ',name ',formulas state)))
(defun formals-subsubsts (formals)
(declare (xargs :mode :program))
(if (atom formals)
nil
(cons (acl2::make-tmplsubst :atoms `((<formal> . ,(car formals))))
(formals-subsubsts (cdr formals)))))
(defun def-formula-check-definition-thm-fn-aux (name-lst evl flags
formula-check switch-hyps wrld)
(declare (xargs :mode :program))
(cond
((atom name-lst)
(mv nil nil nil))
(t
(b* ((name (car name-lst))
(formals (acl2::formals name wrld))
((mv rest-lemma rest-hint rest-defthm)
(def-formula-check-definition-thm-fn-aux
(cdr name-lst) evl flags formula-check switch-hyps wrld))
(flag (if flags `(:flag ,(cdr (assoc-equal name flags))) nil))
((list lemma hint defthm)
(acl2::template-subst
`((defthmd <evl>-of-<name>-lemma
(implies ,(if switch-hyps
'(and (<evl>-meta-extract-global-facts)
(<formula-check> state))
'(and (<formula-check> state)
(<evl>-meta-extract-global-facts)))
(equal (<evl> '(<name> . <formals>)
(list (:@proj <formals> (cons '<formal> <formal>))))
(<name> . <formals>)))
,@flag)
(:instance <evl>-meta-extract-formula
(acl2::name '<name>)
(acl2::a
(list (:@proj <formals> (cons '<formal> <formal>))))
(acl2::st state))
(defthm <evl>-of-<name>-when-<formula-check>
(implies (and (<formula-check> state)
(<evl>-meta-extract-global-facts))
(equal (<evl> (list '<name> . <formals>) env)
(<name> (:@proj <formals>
(<evl> <formal> env)))))
:hints(("Goal" :use ((:instance <evl>-of-<name>-lemma
(:@proj <formals> (<formal> (<evl> <formal> env)))))
:in-theory (enable <evl>-of-fncall-args)))))
:str-alist `(("<NAME>" . ,(symbol-name name))
("<EVL>" . ,(symbol-name evl))
("<FORMULA-CHECK>" . ,(symbol-name formula-check)))
:atom-alist `((<name> . ,name)
(<evl> . ,evl)
(<formula-check> . ,formula-check)
(<formals> . ,formals))
:subsubsts `((<formals> . ,(formals-subsubsts formals)))
:pkg-sym formula-check)))
(mv (cons lemma rest-lemma)
(cons hint rest-hint)
(cons defthm rest-defthm))))))
(defun def-formula-check-definition-thm-fn (name evl formula-check switch-hyps wrld)
(declare (xargs :mode :program))
(b* ((recursivep (fgetprop name 'acl2::recursivep nil wrld))
(formals (acl2::formals name wrld)))
(acl2::template-subst
(cond
((equal recursivep nil)
'(defthm <evl>-of-<name>-when-<formula-check>
(implies (:@ :switch-hyps
(and (<evl>-meta-extract-global-facts)
(<formula-check> state)))
(:@ (not :switch-hyps)
(and (<formula-check> state)
(<evl>-meta-extract-global-facts)))
(equal (<evl> (list '<name> . <formals>) env)
(<name> (:@proj <formals>
(<evl> <formal> env)))))
:hints(("Goal" :in-theory (enable <evl>-of-fncall-args <name>)
:use ((:instance <evl>-meta-extract-formula
(acl2::name '<name>)
(acl2::a (list (:@proj <formals>
(CONS '<formal> (<evl> <formal> env)))))
(acl2::st state)))))))
((equal (len recursivep) 1)
'(encapsulate nil
(local (defthmd <evl>-of-<name>-lemma
(implies (and (<formula-check> state)
(<evl>-meta-extract-global-facts))
(equal (<evl> '(<name> . <formals>)
(list (:@proj <formals> (cons '<formal> <formal>))))
(<name> . <formals>)))
:hints(("Goal" :in-theory (enable <name>)
:induct (<name> . <formals>)
:do-not-induct t)
'(:use ((:instance <evl>-meta-extract-formula
(acl2::name '<name>)
(acl2::a
(list (:@proj <formals> (cons '<formal> <formal>))))
(acl2::st state)))
:do-not-induct t
:in-theory (e/d (<evl>-of-fncall-args <name>)
(<evl>-meta-extract-formula))))))
(defthm <evl>-of-<name>-when-<formula-check>
(implies (:@ :switch-hyps
(and (<evl>-meta-extract-global-facts)
(<formula-check> state)))
(:@ (not :switch-hyps)
(and (<formula-check> state)
(<evl>-meta-extract-global-facts)))
(equal (<evl> (list '<name> . <formals>) env)
(<name> (:@proj <formals>
(<evl> <formal> env)))))
:hints(("Goal"
:do-not-induct t
:use ((:instance <evl>-of-<name>-lemma
(:@proj <formals> (<formal> (<evl> <formal> env)))))
:in-theory (enable <evl>-of-fncall-args))))))
(t
(b* ((flag-fns (table-alist 'flag::flag-fns wrld))
(entry (assoc-equal (car recursivep) flag-fns))
(- (if entry nil
(hard-error 'def-formula-checks
"You need to have make-flag for ~p0 ~%"
(list (cons #\0 recursivep)))))
(flags (nth 2 entry))
(macro-name (nth 3 entry))
((mv lemmas lemma-hints defthms)
(def-formula-check-definition-thm-fn-aux
recursivep evl flags formula-check switch-hyps wrld)))
`(encapsulate
nil
(local
(,macro-name
,@lemmas
:hints (("Goal"
:do-not-induct t
:in-theory (e/d ,recursivep ()))
'(:use ,lemma-hints
:in-theory (e/d (<evl>-of-fncall-args
. ,recursivep) ())
:do-not-induct t))))
,@defthms))))
:str-alist `(("<NAME>" . ,(symbol-name name))
("<EVL>" . ,(symbol-name evl))
("<FORMULA-CHECK>" . ,(symbol-name formula-check)))
:atom-alist `((<name> . ,name)
(<evl> . ,evl)
(<formula-check> . ,formula-check)
(<formals> . ,formals))
:subsubsts `((<formals> . ,(formals-subsubsts formals)))
:features (and switch-hyps '(:switch-hyps))
:pkg-sym formula-check)))
(defmacro def-formula-check-definition-thm (name evl formula-check &optional switch-hyps)
`(make-event
(def-formula-check-definition-thm-fn ',name ',evl ',formula-check ',switch-hyps (w state))))
(defun def-formula-checks-definition-thm-list-fn (x evl name switch-hyps)
(if (atom x)
nil
(cons `(def-formula-check-definition-thm ,(car x) ,evl ,name ,switch-hyps)
(def-formula-checks-definition-thm-list-fn (cdr x) evl name switch-hyps))))
(defmacro def-formula-checks-definition-thm-list (x evl name &optional switch-hyps)
`(make-event
(cons 'progn (def-formula-checks-definition-thm-list-fn ,x ',evl ',name ',switch-hyps))))
(defun filter-defined-functions (fns wrld)
(if (atom fns)
nil
(if (fgetprop (car fns) 'acl2::def-bodies nil wrld)
(cons (car fns) (filter-defined-functions (cdr fns) wrld))
(filter-defined-functions (cdr fns) wrld))))
(defun def-formula-checks-fn (name fns evl evl-base-fns switch-hyps wrld)
(declare (xargs :mode :program))
(b* ((evl-base-fns (if evl-base-fns evl-base-fns
(cdr (assoc-equal 'evl-base-fns
(table-alist 'formula-checks-eval wrld)))))
(evl (if evl evl (cdr (assoc-equal 'evl (table-alist 'formula-checks-eval wrld)))))
((mv ?seen deps) (collect-toposort-function-deps-list fns wrld evl-base-fns nil))
(deps (acl2::rev deps))
;; BOZO. Someday we could deal with constrained functions more
;; generally. For now, we hope that any constrained functions that fns
;; depend on will end up being irrelevant.
(defined-deps (filter-defined-functions deps wrld)))
`(encapsulate
nil
(local
(in-theory (disable ,@defined-deps)))
(local
(in-theory (enable assoc-equal)))
(def-formula-checker ,name ,defined-deps)
(local (def-formula-checker-lemmas ,name ,defined-deps))
(def-formula-checks-definition-thm-list ',defined-deps ,evl ,name ,switch-hyps))))
(defmacro def-formula-checks (name fns &key (evl 'nil) (evl-base-fns 'nil) (switch-hyps 'nil))
`(make-event
(def-formula-checks-fn ',name ',fns ',evl ,evl-base-fns ,switch-hyps (w state))))
(defmacro def-formula-checks-default-evl (evl evl-base-fns)
`(progn
(table formula-checks-eval
'evl ',evl)
(table formula-checks-eval
'evl-base-fns ,evl-base-fns)))
#|
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;; EXAMPLE USE
;; Let's define the base function set to create the evaluator.
(defconst
*ex-evl-base-fns*
'(acl2-numberp binary-* binary-+
unary-- unary-/ < char-code characterp
code-char complex complex-rationalp
coerce consp denominator imagpart
integerp intern-in-package-of-symbol
numerator rationalp realpart
stringp symbol-name symbol-package-name
symbolp
equal not if iff
return-last synp cons car cdr
typespec-check implies))
;; Create the evaluator. It has to be created with :namedp t.
(make-event
`(defevaluator ex-evl ex-evl-list
,(b* ((w (w state))) (loop$ for x in *ex-evl-base-fns*
collect (cons x (acl2::formals x w))))
:namedp t))
;; Create meta-extract
(acl2::def-meta-extract ex-evl ex-evl-list)
;; Option 1 to create def-formula-checks
(def-formula-checks
example-formula-checks-1
(subsetp-equal
assoc-equal)
:evl ex-evl
:evl-base-fns *ex-evl-base-fns*)
;; Option 2: You can set the evaluator to be the default to be used by def-formula-checks
(def-formula-checks-default-evl
ex-evl ;;evaluator name
*ex-evl-base-fns*) ;;base functions of the evaluator.
(include-book "std/lists/rev" :dir :system)
(encapsulate
nil
;; Sometimes some rewrite rules may cause def-formula-checks to fail. So we disable them.
(local
(in-theory (disable
acl2::revappend-removal
acl2::rev-when-not-consp
acl2::rev-of-cons)))
(def-formula-checks
example-formula-checks-2
(acl2::rev)))
;; revappend is a function used by rev. Under these hypotheses, now ex-evl
;; recognize revappend.
;; Note that (example-formula-checks-2 state) is executable and can be called
;; in meta-rule/clause-processor functions.
(defthm ex-evl-rev-test
(implies (and (ex-evl-meta-extract-global-facts)
(example-formula-checks-2 state))
(equal (ex-evl `(revappend ,x ,y) a)
(revappend (ex-evl x a)
(ex-evl y a)))))
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
||#
|
