; Copyright (C) 2009 Northeastern University

; This program is free software; you can redistribute it and/or modify
; it under the terms of the GNU General Public License as published by
; the Free Software Foundation; either version 2 of the License, or
; (at your option) any later version.

; This program is distributed in the hope that it will be useful,
; but WITHOUT ANY WARRANTY; without even the implied warranty of
; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
; GNU General Public License for more details.

; You should have received a copy of the GNU General Public License
; along with this program; if not, write to the Free Software
; Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.

; Written by: Panagiotis Manolios who can be reached as follows.

; Email: pete@ccs.neu.edu

; Postal Mail:
; Pete Manolios 
; College of Computer and Information Science
; Northeastern University 
; 360 Huntington Avenue 
; Boston, Massachusetts 02115 U.S.A.

This directory contains the supporting materials for the
following paper.

Refinement and Theorem Proving
Panagiotis Manolios.
International School on Formal Methods for the Design of
Computer, Communication, and Software Systems: Hardware
Verification, 2006. Springer Verlag 

To certify these proof scripts, run the following command:

  acl2 <certify.lsp >out

where acl2 is the name of your ACL2 executable.  This may take
some time (20 minutes).  Alternatively, you can start ACL2 and
load the file certify.lsp.  

This is version 2, dated Jun 11 2009. The file defun-weak-sk.lisp
was modified to work with ACL2 version 3.5.  If there are
problems with later versions of ACL2, contact the author.
