Results 1 
6 of
6
Importing mathematics from hol into Nuprl
 Theorem Proving in Higher Order Logics (TPHOLs 1996), volume 1125 of LNCS
, 1996
"... Abstract. Nuprl and HOL are both tacticbased interactive theorem provers for higherorder logic, and both have been used in many substantial applications over the last decade. However, the HOL community has accumulated a much larger collection of formalized mathematics of the kind useful for hardwa ..."
Abstract

Cited by 27 (2 self)
 Add to MetaCart
Abstract. Nuprl and HOL are both tacticbased interactive theorem provers for higherorder logic, and both have been used in many substantial applications over the last decade. However, the HOL community has accumulated a much larger collection of formalized mathematics of the kind useful for hardware and software veri cation. This collection would be of great bene t in applying Nuprl to veri cation problems of real practical interest. This paper describes a connection we have implemented between HOL and Nuprl that gives Nuprl e ective access to mathematics formalized in HOL. In designing this connection, we had to overcome a number of problems related to di erences in the logics, logical infrastructures and stylistic conventions of Nuprl and HOL. 1
DECLARE: A Prototype Declarative Proof System for Higher Order Logic
, 1997
"... This report describes DECLARE, a prototype implementation of a declarative proof system for simple higher order logic. The purpose of DECLARE is to explore mechanisms of specification and proof that may be incorporated into other theorem provers. It has been developed to aid with reasoning about ope ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
This report describes DECLARE, a prototype implementation of a declarative proof system for simple higher order logic. The purpose of DECLARE is to explore mechanisms of specification and proof that may be incorporated into other theorem provers. It has been developed to aid with reasoning about operational descriptions of systems and languages. Proofs in DECLARE are expressed as proof outlines, in a language that approximates written mathematics. The proof language includes specialised constructs for (co)inductive types and relations. The system includes an abstract/article mechanism that provides a way of isolating the process of formalization from what results, and simultaneously allow the efficient separate processing of work units. After describing the system we discuss our approach to two subsidiary issues: automation and the interactive environment provided to the user. 1 Introduction This technical report describes DECLARE, a prototype implementation of a declarative proof sy...
Reachability Verification for Hybrid Automata
 HSCC 98: HYBRID SYSTEMSâ€”COMPUTATION AND CONTROL, LECTURE NOTES IN COMPUTER SCIENCE 1386
, 1998
"... We study the reachability problem for hybrid automata. Automatic approaches, which attempt to construct the reachable region by symbolic execution, often do not terminate. In these cases, we require the user to guess the reachable region, and we use a theorem prover (Pvs) to verify the guess. We cl ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
We study the reachability problem for hybrid automata. Automatic approaches, which attempt to construct the reachable region by symbolic execution, often do not terminate. In these cases, we require the user to guess the reachable region, and we use a theorem prover (Pvs) to verify the guess. We classify hybrid automata according to the theory in which their reachable region can be defined finitely. This is the theory in which the prover needs to operate in order to verify the guess. The approach is interesting, because an appropriate guess can often be deduced by extrapolating from the first few steps of symbolic execution.
Developing strategies for specialized theorem proving about untimes, timed, and hybrid I/O automata
 In STRATA 2003
, 2003
"... Abstract. In this paper we discuss how weintend to develop a specialized theorem proving environment for the Hybrid I/O Automata (HIOA) framework [7] over the PVS [11] theorem prover, and some of the issues involved. In particular, we describe approaches to using PVS that allow and encourage the dev ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
Abstract. In this paper we discuss how weintend to develop a specialized theorem proving environment for the Hybrid I/O Automata (HIOA) framework [7] over the PVS [11] theorem prover, and some of the issues involved. In particular, we describe approaches to using PVS that allow and encourage the development of useful proof strategies, and note some desired PVS features that would further help us to do so for our HIOA environment. 1
A Discipline of SpecificationBased Test Derivation
, 1998
"... Systemlevel requirementsbased testing is an important task in software development, providing evidence that each requirement has been satisfied. There are two major problems with how these tests are derived. First, the notion of coverage is subjective, i.e., there is a lack of objective definition ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Systemlevel requirementsbased testing is an important task in software development, providing evidence that each requirement has been satisfied. There are two major problems with how these tests are derived. First, the notion of coverage is subjective, i.e., there is a lack of objective definitions of coverage criteria. Second, there is a surprising lack of automation in deriving systemlevel requirementsbased tests. Research into solutions for these problems has led to the formulation of the discipline of specificationbased test derivation presented in this dissertation. This discipline, which is based on predicate logic, provides a scientific foundation for objective definitions of coverage criteria and algorithms for partially automating test derivation. This dissertation defines some fundamental coverage criteria as examples. A general test frame generation process illustrates a general application of the discipline to a broad range of formal specifications, which can include existent...