Relational Verification Using Product Programs

Barthe, Gilles; Crespo, Juan Manuel; Kunz, César

doi:10.1007/978-3-642-21437-0_17

Cited by 163 publications

(242 citation statements)

References 25 publications

(34 reference statements)

Supporting

Mentioning

238

Contrasting

Unclassified

Order By: Relevance

“…In previous work, we have used a notion of program products to formally verify the correctness of several program optimizations [4]. An important limitation of our previous notion of program products is that they are required to be representable syntactically as structured code.…”

Section: Translation Validationmentioning

confidence: 99%

“…Sections 3 and 4 introduce the notion of left product and show how they can be used to reduce relational verification to functional verification. Section 5 introduces full products, a symmetric variant of left products that is used to validate examples of translation validation that were not covered by [4]. Section 6 presents an overview of our implementation.…”

Section: Introductionmentioning

confidence: 99%

“…Moreover, the construction of product programs has been confined to structured and deterministic programs written in a single language. This article introduces asymmetric (left or right) product programs, which generalize symmetric products from [20,4], and allow showing abstraction/refinement properties, which are typically of the form: for all execution of the first program, there is a related execution of the second program. Furthermore, asymmetric product are based on a flowgraph representation of programs, which provides significant advantages over previous works.…”

Section: Introductionmentioning

confidence: 99%

“…Product programs [20,4] provide a means to reduce verification of relational Hoare logic quadruples to verification of standard Hoare triples. Informally, the product program construction transforms two programs P 1 and P 2 into a single program P that soundly abstracts the behavior of P 1 and P 2 , so that relational verification over P 1 and P 2 can be reduced to verification of P .…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Beyond 2-Safety: Asymmetric Product Programs for Relational Program Verification

Barthe

Crespo

Kunz

2013

Logical Foundations of Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. Relational Hoare Logic is a generalization of Hoare logic that allows reasoning about executions of two programs, or two executions of the same program. It can be used to verify that a program is robust or (information flow) secure, and that two programs are observationally equivalent. Product programs provide a means to reduce verification of relational judgments to the verification of a (standard) Hoare judgment, and open the possibility of applying standard verification tools to relational properties. However, previous notions of product programs are defined for deterministic and structured programs. Moreover, these notions are symmetric, and cannot be applied to properties such as refinement, which are asymmetric and involve universal quantification on the traces of the first program and existential quantification on the traces of the second program. Asymmetric products generalize previous notions of products in three directions: they are based on a control-flow graph representation of programs, they are applicable to non-deterministic languages, and they are by construction asymmetric. Thanks to these characteristics, asymmetric products allow to validate abstraction/refinement relations between two programs, and to prove the correctness of advanced loop optimizations that could not be handled by our previous work. We validate their effectiveness by applying a prototype implementation to verify representative examples from translation validation and predicate abstraction.

show abstract

Section: Translation Validationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Beyond 2-Safety: Asymmetric Product Programs for Relational Program Verification

Barthe

Crespo

Kunz

2013

Logical Foundations of Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…In earlier work [11], we presented an automated approach to regression verification based on invariant generation using Horn clauses. Many other approaches [2,16,31,32,39] exist to regression verification for imperative programming languages.…”

Section: Related Workmentioning

confidence: 99%

Regression Verification for Programmable Logic Controller Software

Beckert

Ulbrich

Vogel‐Heuser

et al. 2015

Formal Methods and Software Engineering

View full text Add to dashboard Cite

Abstract. Automated production systems are usually driven by Programmable Logic Controllers (PLCs). These systems are long-living -yet have to adapt to changing requirements over time. This paper presents a novel method for regression verification of PLC code, which allows one to prove that a new revision of the plant's software does not break existing intended behavior. Our main contribution is the design, implementation, and evaluation of a regression verification method for PLC code. We also clarify and define the notion of program equivalence for reactive PLC code. Core elements of our method are a translation of PLC code into the SMV input language for model checkers, the adaptation of the coupling invariants concept to reactive systems, and the implementation of a toolchain using a model checker supporting invariant generation. We have successfully evaluated our approach using the Pick-and-Place Unit benchmark case study.

show abstract

Regression verification: proving the equivalence of similar programs

Godlin

Strichman

2012

Software Testing Verif & Rel

View full text Add to dashboard Cite

SUMMARYProving the equivalence of successive, closely related versions of a program has the potential of being easier in practice than functional verification, although both problems are undecidable. There are three main reasons for this claim: (i) it circumvents the problem of specifying what the program should do; (ii) the problem can be naturally decomposed and hence is computationally easier; and (iii) there is an automatic invariant that enables to prove equivalence of loops and recursive functions in most practical cases. Theoretical and practical aspects of this problem are considered. Copyright © 2012 John Wiley & Sons, Ltd.

show abstract

Relational Verification Using Product Programs

Cited by 163 publications

References 25 publications

Beyond 2-Safety: Asymmetric Product Programs for Relational Program Verification

Beyond 2-Safety: Asymmetric Product Programs for Relational Program Verification

Regression Verification for Programmable Logic Controller Software

Regression verification: proving the equivalence of similar programs

Contact Info

Product

Resources

About