Abstract not found

In this paper we present a first order classical metatheory, called MT, with the following properties: (1) tactics are terms of the language of MT (we call these tactics, Logic Tactics); (2) there exists a mapping between Logic Tactics and the tactics developed as programs within the GETFOL theorem prover (we call these tactics, Program Tactics). MT is expressive enough to represent the most interesting tacticals, i.e. then, orelse, try, progress and repeat. repeat allows us to express Logic Tactics which correspond to Program Tactics which may not terminate. This work is part of a larger project which aims at the development and mechanization of a metatheory which can be used to reason about, extend and, possibly, modify the code implementing Program Tactics and the GETFOL basic inference rules.

Abstract not found

System-level requirements-based testing is an important task in software development, providing evidence that each requirement has been satis#ed. 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 de#nitions of coverage criteria. Second, there is a surprising lack of automation in deriving system-level requirements-based tests. Researchinto solutions for these problems has led to the formulation of the discipline of speci#cation-based test derivation presented in this dissertation. This discipline, which is based on predicate logic, provides a scienti#c foundation for objective de#nitions of coverage criteria and algorithms for partially automating test derivation. This dissertation de#nes 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 speci#cations, whichcan include existent...

What facilities should an interactive verification system provide? We take the pragmatic view that the particular logic underlying a proof system is not as important as the support that is provided. Although a plethora of logics have been implemented, we think that there is a common kernel of support that a proof system ought to provide. Towards this end, we give detailed suggestions for verification support in three major areas: formalization, proof, and interface. Although our perspective comes from experience with highly expressive logics such as set theory, higher order logic, and type theory, we think our analyses apply more generally. Introduction Currently, theorem provers are used in the verification of both hardware and software [GM93, ORS92, BM90, HRS90, FFMH92], the formalization of informal mathematical proofs [FGT90, CH85, Pau90b], the teaching of logic[AMC84], and as tools of mathematical and metamathematical research [WWM + 90, CAB + 86]. 1 In this paper we describ...