Results 1  10
of
742
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
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
A Sound Framework for Untrusted VerificationCondition Generators
"... We propose a framework called configurable proofcarrying code, which allows the untrusted producer of mobile code to provide the bulk of the code verifier used by a code receiver to check the safety of the received code. The resulting system is both more flexible and also more trustworthy than a sta ..."
Abstract
 Add to MetaCart
We propose a framework called configurable proofcarrying code, which allows the untrusted producer of mobile code to provide the bulk of the code verifier used by a code receiver to check the safety of the received code. The resulting system is both more flexible and also more trustworthy than a standard proofcarrying code system, because only a small part of the verifier needs to be trusted, while the remaining part can be configured freely to suit the safety policy on one hand, and the structure of the mobile code on the other hand. In this paper we describe formally the protocol that the untrusted verifier must follow in the interaction with the trusted infrastructure. We present a proof of the soundness of the system, and we give preliminary evidence that the architecture is expressive enough to delegate to the untrusted verifier even the handling of loop invariants, indirect jumps and calling conventions. 1.
A certified multiprover verification condition generator
, 2011
"... Deductionbased software verification tools have reached a maturity allowing them to be used in industrial context where a very high level of assurance is required. This raises the question of the level of confidence we can grant to the tools themselves. We present a certified implementation of a ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
verification condition generator. An originality is its genericity with respect to the logical context, which allows us to produce proof obligations for a large class of theorem provers. This implementation is conducted within the Coq proof assistant, and is crafted so that it can be extracted into a
Verification Condition Generation via Theorem Proving
 Proceedings of the 13th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2006), Vol. 4246 of LNCS
, 2006
"... Abstract. We present a method to convert (i) an operational semantics for a given machine language, and (ii) an offtheshelf theorem prover, into a high assurance verification condition generator (VCG). Given a program annotated with assertions at cutpoints, we show how to use the theorem prover di ..."
Abstract

Cited by 15 (4 self)
 Add to MetaCart
Abstract. We present a method to convert (i) an operational semantics for a given machine language, and (ii) an offtheshelf theorem prover, into a high assurance verification condition generator (VCG). Given a program annotated with assertions at cutpoints, we show how to use the theorem prover
Building verification condition generators by compositional extensions
, 2004
"... This paper describes a technique that combines algebraic specifications and monads to build derivative verification condition generators (VCGs) by extending a base VCG. Extensions are compositional and can be stacked while the base VCG is left unchanged. The technique can be used to build a set of w ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
This paper describes a technique that combines algebraic specifications and monads to build derivative verification condition generators (VCGs) by extending a base VCG. Extensions are compositional and can be stacked while the base VCG is left unchanged. The technique can be used to build a set
Practical Verification Condition Generation for a Bytecode Language
, 2015
"... Automatic program verifiers typically generate verification conditions from the program and discharge them with an automated theorem prover. An important consideration is the manner in which program code and invariants are expressed. We have developed a bytecode language (similar, in spirit, to Java ..."
Abstract
 Add to MetaCart
Automatic program verifiers typically generate verification conditions from the program and discharge them with an automated theorem prover. An important consideration is the manner in which program code and invariants are expressed. We have developed a bytecode language (similar, in spirit
Verification condition generation for conditional information flow
 Kansas State Univ
, 2007
"... We formulate an intraprocedural information flow analysis algorithm for sequential, heap manipulating programs. We prove correctness of the algorithm, and argue that it can be used to verify some naturally occurring examples in which information flow is conditional on some Hoarelike state predicate ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
with verification conditions. To process heap manipulations and while loops, the algorithm must additionally be supplied “object flow invariants ” as well as “loop flow invariants ” which are themselves twostate, and possibly conditional. 1
The Design and Algorithms of a Verification Condition Generator
"... iv Acknowledgments In October 2005, Joe Kiniry picked me up from Dublin Airport. The same week, he showed me ESC/Java and asked me to start fixing its bugs. To do so, I had to learn about Hoare triples, guarded commands, and a few other things: He taught me by throwing at me the right problems. He a ..."
Abstract
 Add to MetaCart
iv Acknowledgments In October 2005, Joe Kiniry picked me up from Dublin Airport. The same week, he showed me ESC/Java and asked me to start fixing its bugs. To do so, I had to learn about Hoare triples, guarded commands, and a few other things: He taught me by throwing at me the right problems. He also provided a good environment for research, by building from scratch in UCD a group focused on applied formal methods. Joe helped me as a friend when I had difficulties in my personal life. I tend to spend most of my time learning, rather than doing. However, in the summer of 2007 the reverse was true. The cause was the epidemic enthusiasm of Michał Moskal, who visited our group. For the rest of the four years that I spent in Dublin, Mikoláˇs Janota was the main target of my technical ramblings,
Results 1  10
of
742