Semi-Proving: An Integrated Method for Program Proving, Testing, and Debugging
نویسندگان
چکیده
منابع مشابه
Proving and Debugging Set-Based Specifications
We present a technique to prove invariants of model-based specifications in a fragment of set theory. Proof obligations containing set theory constructs are translated to first-order logic with equality augmented with (an extension of) the theory of arrays with extensionality. The idea underlying the translation is that sets are represented by their characteristic function which, in turn, is en...
متن کاملSymbolic Execution Merges Construction, Debugging and Proving
There is naturally an interest in any technology which promises to assist us in producing correct programs. Some efforts attempt to insure correct programs by making their construction simpler. Some efforts are oriented toward increasing the effectiveness of testing to make the programs appear to perform as required. Other efforts are directed to prove the correctness of the resulting program. ...
متن کاملProving Inter-Program Properties
We develop foundations for proving properties relating two programs. Our formalization is based on a suitably adapted notion of program invariant for a single program. First, we give an abstract formulation of the theory of program invariants based on the notion of assertion function: a function that assigns assertions to program points. Then, we develop this abstract notion further so that it ...
متن کاملAn Integrated Approach to Proving Liveness
We present a framework for the proof of liveness with three main features: (a) it considers nondeterministic/concurrent programs whose transitions can be governed by a given scheduler, (b) it is highly automated, often requiring no user input, and (c) it is integrated with program verification methods for safety properties, upon which liveness often depends. The framework is essentially a metho...
متن کاملProving program refinements and transformations
In this thesis we develop a theory of program refinement and equivalence which can be used to develop practical tools for program development, analysis and modification. The theory is based on the use of general specifications and an imperative kernel language. We use weakest preconditions, expressed as formulae in infinitary logic to prove refinement and equivalence between programs. The kerne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Software Engineering
سال: 2011
ISSN: 0098-5589,1939-3520,2326-3881
DOI: 10.1109/tse.2010.23