Results 1  10
of
10
Applications of feasible path analysis to program testing
 In Proceedings of the 1994 ACM SIGSOFT international symposium on Software testing and analysis (1994), ACM
"... ..."
Exploiting Specifications to Improve Program Performance
, 1994
"... Many approaches to programming emphasize the use of interfaces. The basic idea is to decompose programs into modules and to specify how each module's interface behaves. This makes it easier to reason about programs because one can rely on a module's speci#cation rather than examining its i ..."
Abstract

Cited by 19 (1 self)
 Add to MetaCart
(Show Context)
Many approaches to programming emphasize the use of interfaces. The basic idea is to decompose programs into modules and to specify how each module's interface behaves. This makes it easier to reason about programs because one can rely on a module's speci#cation rather than examining its implementation, which is more complicated.
Theorem Proving with Definitions
, 1989
"... This paper analyses a technique (called Gazing) for unfolding de nitions on the basis of a global plan built in an abstract space. Gazing's logical properties are studied inside a formal framework which relies on a more general theory of abstraction. Some experimental results con rming the theo ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
This paper analyses a technique (called Gazing) for unfolding de nitions on the basis of a global plan built in an abstract space. Gazing's logical properties are studied inside a formal framework which relies on a more general theory of abstraction. Some experimental results con rming the theoretical ones are also presented.
Towards the Generation of Efficient Code from Verified Programs
, 1984
"... An investigation was made of the characteristics of computer programming languages intended for the implementation of provably correct programs and of the characteristics of programs written in these languages. It was discovered that potential run time exceptions and the necessity of providing a rig ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
An investigation was made of the characteristics of computer programming languages intended for the implementation of provably correct programs and of the characteristics of programs written in these languages. It was discovered that potential run time exceptions and the necessity of providing a rigorously correct implementation of exception handlers so dominate the potential control paths of programs written in verifiable languages that the usual code optimization techniques are ineffective. It was further discovered that the call intensive control structures of these programs, necessitated by verification constraints, also thwart optimization and lead to inefficient code. It is shown that theorems can be derived at potential exception sites which, if true, guarantee that the exception condition will never arise permitting removal of the exception path from the programâ€™s flow graph. These theorems are proved using the automatic theorem prover which is part of the program verification system. Is is also shown that many of the routine calls contained in verifiable programs may be reduced in expense by converting parameters to global variables or eliminated completely by expanding the called routines at their call sites. Both the exception suppression and call reduction techniques reduce the complexity of the programâ€™s call graph and facilitate conventional optimizations. Several examples are presented and the potential improvements in code size resulting from the application of these techniques are discussed.
The Use of Abstraction in Automatic Inference
, 1989
"... Theorem Proving. In Proceedings of the 11th IJCAI. International Joint Conference on Artificial Intelligence, 1989. Also available as DAI Research Paper No 430, Dept. of Artificial Intelligence, Edinburgh. ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
Theorem Proving. In Proceedings of the 11th IJCAI. International Joint Conference on Artificial Intelligence, 1989. Also available as DAI Research Paper No 430, Dept. of Artificial Intelligence, Edinburgh.
Notational
, 1990
"... Informally, abstraction can be described as the process of mapping a representation of a problem onto a new representation. The aim of this paper is to propose the ~nings of a theory of reasoning with abstraction which captures and generalizes most previous work in the area. The theory allows us to ..."
Abstract
 Add to MetaCart
(Show Context)
Informally, abstraction can be described as the process of mapping a representation of a problem onto a new representation. The aim of this paper is to propose the ~nings of a theory of reasoning with abstraction which captures and generalizes most previous work in the area. The theory allows us to study the properties of abstraction mappings proof checker.
unknown title
"... This paper describes a new method for determining the validity of certain formulas from Presburger Arithmetic, namely those with only universally quantified variables. To do this the notion of a Presburger formula, is generalized slightly to that of a quasilinear formula. This so called "s ..."
Abstract
 Add to MetaCart
(Show Context)
This paper describes a new method for determining the validity of certain formulas from Presburger Arithmetic, namely those with only universally quantified variables. To do this the notion of a Presburger formula, is generalized slightly to that of a quasilinear formula. This so called &quot;suplnf &quot; method seems particularly suited for proving certain verification conditions that arise from program validation, especially those in which &quot;proof by cases &quot; is required. It also eliminates the need for proof by enumeration, inherent in some methods described earlier In the literature, which sometimes require a search through a large number of consecutive Integers. These algorithms have been programmed and used extensively as a part of an automatic theorem proving system.
Spaces
, 1992
"... Abstraction has been widely used in automated deduction; a major problem with its use is that the abstract space can be inconsistent even though the ground space is consistent. We show that, under certain very weak conditions true of practically all the abstractions used in the past (but true also ..."
Abstract
 Add to MetaCart
(Show Context)
Abstraction has been widely used in automated deduction; a major problem with its use is that the abstract space can be inconsistent even though the ground space is consistent. We show that, under certain very weak conditions true of practically all the abstractions used in the past (but true also of a much wider class of abstractions), this problem cannot be avoided.
Theorem Proving with Denitions
"... This paper analyses a technique (called Gazing) for unfolding denitions on the basis of a global plan built in an abstract space. Gazing's logical properties are studied inside a formal framework which relies on a more general theory of abstraction. Some experimental results conrming the theor ..."
Abstract
 Add to MetaCart
(Show Context)
This paper analyses a technique (called Gazing) for unfolding denitions on the basis of a global plan built in an abstract space. Gazing's logical properties are studied inside a formal framework which relies on a more general theory of abstraction. Some experimental results conrming the theoretical ones are also presented. 1