A Program Logic for Bytecode

Bannwart, Fabian; Müller, Péter

doi:10.1016/j.entcs.2005.02.026

Cited by 31 publications

(29 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…(σ, σ ) ∈ [[P ]], if ϕ σ then ψ σ . One can prove the validity of triples using a variant of Hoare logic [2], or working with a compositional flow logic [17]. However, the prominent means to prove that {ϕ} P {ψ} is valid is to exhibit a partial specification Φ : N φ s.t.…”

Section: Logical Validationmentioning

confidence: 99%

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

Barthe

Crespo

Kunz

2013

Logical Foundations of Computer Science

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: Logical Validationmentioning

confidence: 99%

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

Barthe

Crespo

Kunz

2013

Logical Foundations of Computer Science

View full text Add to dashboard Cite

show abstract

“…In the result, local validity refers to logical validity of the verification conditions resulting from a fully annotated program (see [4] for details). [4]), and (c) collapsing every annotation to an equivalent single assertion (see [1] for details).…”

Section: Description Of Inliningmentioning

confidence: 99%

Provably Correct Runtime Monitoring

Aktug

Dam

Gurov

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Runtime monitoring is an established technique for enforcing a wide range of program safety and security properties. We present a formalization of monitoring and monitor inlining, for the Java Virtual Machine. Monitors are security automata given in a special-purpose monitor specification language, ConSpec. The automata operate on finite or infinite strings of calls to a fixed API, allowing local dependencies on parameter values and heap content. We use a two-level class file annotation scheme to characterize two key properties: (i) that the program is correct with respect to the monitor as a constraint on allowed program behavior, and (ii) that the program has an instance of the given monitor embedded into it, which yields state changes at prescribed points according to the monitor's transition function. As our main application of these results we describe a concrete inliner, and use the annotation scheme to characterize its correctness. For this inliner, correctness of the level II annotations can be decided efficiently by a weakest precondition annotation checker, thus allowing on-device checking of inlining correctness in a proof-carrying code setting.

show abstract

“…Bannwart and Müller [2] have developed a Hoare-style logic a bytecode similar to Java Bytecode and CIL. This logic is based on Poetzsch-Heffter and Müller's logic [17,18], and it supports object-oriented features such as inheritance and dynamic binding.…”

Section: Soundness and Completenessmentioning

confidence: 99%

A Sound and Complete Program Logic for Eiffel

Nordio

Calcagno

Müller

et al. 2009

Objects, Components, Models and Patterns

Self Cite

View full text Add to dashboard Cite

Abstract. Object-oriented languages provide advantages such as reuse and modularity, but they also raise new challenges for program verification. Program logics have been developed for languages such as C# and Java. However, these logics do not cover the specifics of the Eiffel language. This paper presents a program logic for Eiffel that handles exceptions, once routines, and multiple inheritance. The logic is proven sound and complete w.r.t. an operational semantics. Lessons on language design learned from the experience are discussed.

show abstract

A Program Logic for Bytecode

Cited by 31 publications

References 6 publications

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

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

Provably Correct Runtime Monitoring

A Sound and Complete Program Logic for Eiffel

Contact Info

Product

Resources

About