Results 1 - 10
of
2,803
Differential Assertion Checking
"... Previous version of a program can be a powerful enabler for program analysis by defining new relative specifications and making the results of current program analysis more relevant. In this paper, we describe the approach of differential assertion checking (DAC) for comparing different versions of ..."
Abstract
-
Cited by 10 (2 self)
- Add to MetaCart
Previous version of a program can be a powerful enabler for program analysis by defining new relative specifications and making the results of current program analysis more relevant. In this paper, we describe the approach of differential assertion checking (DAC) for comparing different versions
Model Checking Java Programs Using Java PathFinder
, 1998
"... . This paper describes a translator called Java PathFinder (Jpf), from Java to Promela, the modeling language of the Spin model checker. Jpf translates a given Java program into a Promela model, which then can be model checked using Spin. The Java program may contain assertions, which are translated ..."
Abstract
-
Cited by 386 (32 self)
- Add to MetaCart
. This paper describes a translator called Java PathFinder (Jpf), from Java to Promela, the modeling language of the Spin model checker. Jpf translates a given Java program into a Promela model, which then can be model checked using Spin. The Java program may contain assertions, which
Simple On-the-fly Automatic Verification of Linear Temporal Logic
, 1995
"... We present a tableau-based algorithm for obtaining an automaton from a temporal logic formula. The algorithm is geared towards being used in model checking in an "on-the-fly" fashion, that is the automaton can be constructed simultaneously with, and guided by, the generation of the model. ..."
Abstract
-
Cited by 327 (29 self)
- Add to MetaCart
We present a tableau-based algorithm for obtaining an automaton from a temporal logic formula. The algorithm is geared towards being used in model checking in an "on-the-fly" fashion, that is the automaton can be constructed simultaneously with, and guided by, the generation of the model
Modular Automatic Assertion Checking with Separation Logic
, 2005
"... Separation logic is a program logic for reasoning about programs that manipulate pointer data structures. We describe a tool, Smallfoot, for checking certain lightweight separation logic specifications. The assertions describe the shapes of data structures rather than their detailed contents, and th ..."
Abstract
-
Cited by 163 (6 self)
- Add to MetaCart
Separation logic is a program logic for reasoning about programs that manipulate pointer data structures. We describe a tool, Smallfoot, for checking certain lightweight separation logic specifications. The assertions describe the shapes of data structures rather than their detailed contents
Conformal deformation of a Riemannian metric to constant curvature
- J. Diff. Geome
, 1984
"... A well-known open question in differential geometry is the question of whether a given compact Riemannian manifold is necessarily conformally equivalent to one of constant scalar curvature. This problem is known as the Yamabe problem because it was formulated by Yamabe [8] in 1960, While Yamabe&apos ..."
Abstract
-
Cited by 308 (0 self)
- Add to MetaCart
A well-known open question in differential geometry is the question of whether a given compact Riemannian manifold is necessarily conformally equivalent to one of constant scalar curvature. This problem is known as the Yamabe problem because it was formulated by Yamabe [8] in 1960, While Yamabe
A Unified Framework for Hybrid Control: Model and Optimal Control Theory
- IEEE TRANSACTIONS ON AUTOMATIC CONTROL
, 1998
"... Complex natural and engineered systems typically possess a hierarchical structure, characterized by continuousvariable dynamics at the lowest level and logical decision-making at the highest. Virtually all control systems today---from flight control to the factory floor---perform computer-coded chec ..."
Abstract
-
Cited by 305 (9 self)
- Add to MetaCart
-coded checks and issue logical as well as continuous-variable control commands. The interaction of these different types of dynamics and information leads to a challenging set of "hybrid" control problems. We propose a very general framework that systematizes the notion of a hybrid system, combining
The Pointer Assertion Logic Engine
- Proc. ACM PLDI
, 2001
"... We present a new framework for verifying partial specifications of programs in order to catch type and memory errors and check data structure invariants. Our technique can verify a large class of data structures, namely all those that can be expressed as graph types. Earlier versions were restricted ..."
Abstract
-
Cited by 156 (3 self)
- Add to MetaCart
We present a new framework for verifying partial specifications of programs in order to catch type and memory errors and check data structure invariants. Our technique can verify a large class of data structures, namely all those that can be expressed as graph types. Earlier versions were
Symbolic model checking with rich assertional languages
- Theoretical Computer Science
, 1997
"... Abstract. The paper shows that, by an appropriate choice of a rich assertional language, it is possible to extend the utility of symbolic model checking beyond the realm of bdd-represented nite-state systems into the domain of in nite-state systems, leading to a powerful technique for uniform veri c ..."
Abstract
-
Cited by 120 (4 self)
- Add to MetaCart
Abstract. The paper shows that, by an appropriate choice of a rich assertional language, it is possible to extend the utility of symbolic model checking beyond the realm of bdd-represented nite-state systems into the domain of in nite-state systems, leading to a powerful technique for uniform veri
A practical approach to programming with assertions
- IEEE Transactions on Software Engineering
, 1995
"... Abstract- Embedded assertions have been recognized as a potentially powerful tool for automatic runtime detection of software faults during debugging, testing, maintenance and even production versions of software systems. Yet despite the richness of the notations and the maturity of the techniques a ..."
Abstract
-
Cited by 165 (2 self)
- Add to MetaCart
in developing a method of programming with assertions. Index Terms-Anna, APP, assertions, C, consistency checking, formal specifications, formal methods, programming environ-
The Asymptotic Elasticity of Utility Functions and Optimal Investment in Incomplete Markets
- Annals of Applied Probability
, 1997
"... . The paper studies the problem of maximizing the expected utility of terminal wealth in the framework of a general incomplete semimartingale model of a financial market. We show that the necessary and sufficient condition on a utility function for the validity of several key assertions of the theor ..."
Abstract
-
Cited by 264 (19 self)
- Add to MetaCart
. The paper studies the problem of maximizing the expected utility of terminal wealth in the framework of a general incomplete semimartingale model of a financial market. We show that the necessary and sufficient condition on a utility function for the validity of several key assertions
Results 1 - 10
of
2,803