Results 1 
2 of
2
Virtual Theories
 In Proceedings of the 8th International Workshop on Higher Order Logic Theorem Proving and Its Applications, Lecture Notes in Computer Science
, 1995
"... . Proof is a programming activity. Consequently programming environments which support proof in the large are required. We describe an environment which supports one area of proofinthelarge: that of theory management. We present the notion of virtual theories. They give the illusion of multiple a ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
. Proof is a programming activity. Consequently programming environments which support proof in the large are required. We describe an environment which supports one area of proofinthelarge: that of theory management. We present the notion of virtual theories. They give the illusion of multiple active theories allowing the user to switch between different theories at will, proving theorems and making definitions in each. The system ensures that proofs only use resources that are available in the environment of the current virtual theory. The code has been implemented on top of the HOL90 system. A side effect is that a version of autoloading is obtained for HOL90. A more radical feature that is obtained is the autoloading of tools. The system has been tested on part of a real hardware verification proof. Who controls the past controls the future, Who controls the present controls the past. George Orwell, Nineteen EightyFour 1 Introduction Interactive, machinechecked proof is ess...
The Importance of Proof Maintenance and Reengineering
 In Proc. Int. Workshop on Higher Order Logic Theorem Proving and Its Applications
, 1995
"... Our work on the verification of real hardware designs using HOL has resulted in very large proof scripts. Consequently, problems were encountered that are not an issue in smaller verification efforts. In particular, we have found that the maintainability of proofs is of paramount importance. There a ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Our work on the verification of real hardware designs using HOL has resulted in very large proof scripts. Consequently, problems were encountered that are not an issue in smaller verification efforts. In particular, we have found that the maintainability of proofs is of paramount importance. There are many reasons why proof scripts in LCF style theorem provers may be reused. This can be in order to maintain and understand old proofs as well as to speed the creation of new ones. Consequently, proofs should be written in styles that ease their maintainability and make them easier to reuse. Furthermore, proof tools and interfaces should be designed with proof reuse as well as proof creation in mind. Many of the problems could be prevented from occurring in the first place with suitable support. 1 Introduction The recent Fairisle switching fabric verification project [3] entailed using HOL [5] to verify real hardware designs. The resulting proofs consist of several hundred theories, the s...