Results 1  10
of
82
HOLBoogie  An Interactive Prover for the Boogie ProgramVerifier
"... Boogie is a program verification condition generator for an imperative core language. It has frontends for the programming languages C# and C enriched by annotations in firstorder logic. Its verification conditions — constructed via a wp calculus from these annotations — are usually transferred to ..."
Abstract

Cited by 17 (2 self)
 Add to MetaCart
to automated theorem provers such as Simplify or Z3. In this paper, however, we present a proofenvironment, HOLBoogie, that combines Boogie with the interactive theorem prover Isabelle/HOL. In particular, we present specific techniques combining automated and interactive proof methods for codeverification. We
HOLBoogie  An interactive proverbackend for the Verifiying C Compiler
"... Boogie is a verification condition generator for an imperative core language. It has frontends for the programming languages C# and C enriched by annotations in firstorder logic, i. e. pre and postconditions, assertions, and loop invariants. Moreover, concepts like ghost fields, ghost variables, ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
the expansion of languagespecific modeling constructs in terms of a theory describing memory and elementary operations on it; this theory is called a machine/memory model. In this paper, we present a proof environment, HOLBoogie, that combines Boogie with the interactive theorem prover Isabelle/HOL, for a
NonDeterministic Exponential Time has TwoProver Interactive Protocols
"... We determine the exact power of twoprover interactive proof systems introduced by BenOr, Goldwasser, Kilian, and Wigderson (1988). In this system, two allpowerful noncommunicating provers convince a randomizing polynomial time verifier in polynomial time that the input z belongs to the language ..."
Abstract

Cited by 416 (37 self)
 Add to MetaCart
We determine the exact power of twoprover interactive proof systems introduced by BenOr, Goldwasser, Kilian, and Wigderson (1988). In this system, two allpowerful noncommunicating provers convince a randomizing polynomial time verifier in polynomial time that the input z belongs
This is Boogie 2
, 2008
"... Boogie is an intermediate verification language, designed to make the prescription of verification conditions natural and convenient. It serves as a common intermediate representation for static program verifiers of various source languages, and it abstracts over the interfaces to various theorem p ..."
Abstract

Cited by 37 (5 self)
 Add to MetaCart
Boogie is an intermediate verification language, designed to make the prescription of verification conditions natural and convenient. It serves as a common intermediate representation for static program verifiers of various source languages, and it abstracts over the interfaces to various theorem
BoogiePL: A typed procedural language for checking objectoriented programs
, 2005
"... ... and program verification. The language is a simple coarsely typed imperative language with procedures and arrays, plus support for introducing mathematical functions and declaring properties of these functions. BoogiePL can be used to represent programs written in an imperative source language ( ..."
Abstract

Cited by 99 (8 self)
 Add to MetaCart
serves as a programmingnotation front end to theorem provers. BoogiePL is accepted as input to Boogie, the Spec# static program verifier.
A Boogie Case Study: Project Description
, 2006
"... This is the project description for a semester thesis I plan to do in the summer semester 2006 at the ETH Zurich under the guidance of Prof. Peter Müller. Is about gaining insight in modern research in the areas of code verification and correctness. I will use a part of the Mono libraries for a Boog ..."
Abstract
 Add to MetaCart
program verifier, Boogie, that generates logical verification conditions from a Spec # program. These are run through an theorem prover that analyzes these verification conditions to prove the correctness of a program. Mono [1] is an opensource implementation of the.NET platform that allows
Embedding imperative synchronous languages in interactive theorem provers
 In International Conference on Application of Concurrency to System Design (ICACSD 2001
, 2001
"... We present a new way to define the semantics of imperative synchronous languages by means of separating the control and the data flow. The control flow is defined by predicates that describe entering conditions, conditions for internal moves, and termination conditions. The data flow is based on t ..."
Abstract

Cited by 37 (26 self)
 Add to MetaCart
on the extraction of guarded commands. This definition principle can be applied to any imperative synchronous language like Esterel or some statechart variants. Following this definition principle, we have embedded our languageQuartz (an Esterel variant) in the interactive theorem prover HOL. We use
The Boogie 2 Type System: Design and Verification Condition Generation
"... Intermediate languages are a paradigm to separate concerns in software verification systems when bridging the gap between (realworld) programming languages and the logics understood by theorem provers. While such intermediate languages traditionally only offer rather simple type systems, this paper ..."
Abstract
 Add to MetaCart
argues that it is both advantageous and feasible to integrate richer type systems with features like (higherranked) polymorphism and quantification over types. As a concrete solution, the paper presents the type system of the Boogie 2 language, which is used in several program verifiers. The paper gives
KeYmaera: A hybrid theorem prover for hybrid systems
 IJCAR. VOLUME 5195 OF LNCS
, 2008
"... KeYmaera is a hybrid verification tool for hybrid systems that combines deductive, real algebraic, and computer algebraic prover technologies. It is an automated and interactive theorem prover for a natural specification and verification logic for hybrid systems. KeYmaera supports differential dyn ..."
Abstract

Cited by 56 (24 self)
 Add to MetaCart
KeYmaera is a hybrid verification tool for hybrid systems that combines deductive, real algebraic, and computer algebraic prover technologies. It is an automated and interactive theorem prover for a natural specification and verification logic for hybrid systems. KeYmaera supports differential
On the power of entangled quantum provers
, 2006
"... We show that the value of a general twoprover quantum game cannot be computed by a semidefinite program of polynomial size (unless P=NP), a method that has been successful in more restricted quantum games. More precisely, we show that proof of membership in the NPcomplete problem GAP3DMATCHING c ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
MATCHING can be obtained by a 2prover, 1round quantum interactive proof system where the provers share entanglement, with perfect completeness and soundness s = 1 − 2−O(n), and such that the space of the verifier and the size of the messages are O(log n). This implies that QMIP ∗ log n,1,1−2−O(n) � P unless
Results 1  10
of
82