Results 1  10
of
3,859
Verification Conditions Are Code
, 2000
"... . Formal methods for software verification and refinement almost all involve verification conditions. These are predicate calculus formulae generated, often automatically, from the program under development; proving the verification conditions establishes the correctness of the development. Surprisi ..."
Abstract
 Add to MetaCart
. Formal methods for software verification and refinement almost all involve verification conditions. These are predicate calculus formulae generated, often automatically, from the program under development; proving the verification conditions establishes the correctness of the development
Tracing the Origins of Verification Conditions
, 1996
"... The typical program verication system is a batch tool that accepts as input a program annotated with FloydHoare assertions, performs syntactic and semantic analysis on it, and generates a list of verification conditions that is subsequently submitted to a theorem prover. When a verification conditi ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
The typical program verication system is a batch tool that accepts as input a program annotated with FloydHoare assertions, performs syntactic and semantic analysis on it, and generates a list of verification conditions that is subsequently submitted to a theorem prover. When a verification
Verification Condition Splitting
, 2008
"... In a traditional approach to program verification, the correctness of each procedure of a given program is encoded as a logical formula called the verification condition. It is then up to a theorem prover, like an automatic SMT solver, to analyze the verification condition in the attempt to either e ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In a traditional approach to program verification, the correctness of each procedure of a given program is encoded as a logical formula called the verification condition. It is then up to a theorem prover, like an automatic SMT solver, to analyze the verification condition in the attempt to either
Explaining verification conditions
 in 12th International Conference on Algebraic Methodology and Software Technology (AMAST 2008
, 2008
"... Abstract. The Hoare approach to program verification relies on the construction and discharge of verification conditions (VCs) but offers no support to trace, analyze, and understand the VCs themselves. We describe a systematic extension of the Hoare rules by labels so that the calculus itself can b ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Abstract. The Hoare approach to program verification relies on the construction and discharge of verification conditions (VCs) but offers no support to trace, analyze, and understand the VCs themselves. We describe a systematic extension of the Hoare rules by labels so that the calculus itself can
Simplification of Boolean verification conditions
, 1999
"... The correctness problem for hardware and software systems can often be reduced to the validity problem for propositional or predicate logic. However, the size of the formulas to be validated grows faster than the size of the system under investigation, and the complexity of the validation procedure ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
of formulas and subformulas. They are based on the notions of interpolation and polarity, and allow to detect and discard provably irrelevant parts of boolean verification conditions. These criteria lead to a simplification and validation method, whose efficiency is investigated both theoretically
Avoiding Exponential Explosion: Generating Compact Verification Conditions
 SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES
, 2001
"... Current verification condition (VC) generation algorithms, such as weakest preconditions, yield a VC whose size may be exponential in the size of the code fragment being checked. This paper describes a twostage VC generation algorithm that generates compact VCs whose size is worstcase quadratic in ..."
Abstract

Cited by 123 (7 self)
 Add to MetaCart
Current verification condition (VC) generation algorithms, such as weakest preconditions, yield a VC whose size may be exponential in the size of the code fragment being checked. This paper describes a twostage VC generation algorithm that generates compact VCs whose size is worstcase quadratic
Structural abstraction of software verification conditions
 in Computer Aided Verification: 19th International Conference, CAV 2007, ser. LNCS
, 2007
"... Abstract. Precise software analysis and verification require tracking the exact path along which a statement is executed (pathsensitivity), the different contexts from which a function is called (contextsensitivity), and the bitaccurate operations performed. Previously, verification with such pre ..."
Abstract

Cited by 34 (5 self)
 Add to MetaCart
with such precision has been considered too inefficient to scale to large software. In this paper, we present a novel approach to solving such verification conditions, based on an automatic abstractioncheckingrefinement framework that exploits natural abstraction boundaries present in software. Experimental results
4. Verification Condition Generators..................................................5
, 1993
"... When considering the correctness of programs, the only absolute demonstration of quality is mathematical proof. Yet the complexity of these proofs makes them all but impossible both to construct and read, and the correctness of the proofs themselves come into question. We take an approach to the cre ..."
Abstract
 Add to MetaCart
to the creation of these proofs based on specifying an axiomatic semantics for the programming language, and using that semantics to automatically create a Verification Condition Generator, a program that takes a general program written in the language and creates the proof of that program, modulo a set
Verification condition generator for escjava2
, 2005
"... If you want to have a resume, read conclusion first This document describes the operation of the verification condition generator of escjava2. First we describe how we use the old code, that was designed to produce an unsorted proof (for Simplify), to create a new ast tree, strongly typed, that can ..."
Abstract
 Add to MetaCart
If you want to have a resume, read conclusion first This document describes the operation of the verification condition generator of escjava2. First we describe how we use the old code, that was designed to produce an unsorted proof (for Simplify), to create a new ast tree, strongly typed, that can
Results 1  10
of
3,859