A compositional natural semantics and Hoare logic for low-level languages

Saabas, Ando; Uustalu, Tarmo

doi:10.1016/j.tcs.2006.12.020

Cited by 22 publications

(40 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This is technically difficult for assembly because handling of jumps results in non-standard logics that are either complex [TA06] or verbose [SU07]. When used directly, these logics are thus less practical than standard Hoare logic for While programs (i.e., imperative programs built out of while-loops).…”

Section: Verification Of Functional Correctness Of Assemblymentioning

confidence: 99%

“…When used directly, these logics are thus less practical than standard Hoare logic for While programs (i.e., imperative programs built out of while-loops). Yet, here, we choose to formalize the proof-carrying code framework of [SU07] because it provides not only a compositional operational semantics and Hoare logic for assembly with jumps, but also shows that derivations for this non-standard operational semantics and Hoare logic can be obtained by compilation from operational semantics and Hoare logic for While programs. In other words, it becomes possible to work with While programs while still being able to recover proofs in Hoare logic for assembly with jumps.…”

Section: Verification Of Functional Correctness Of Assemblymentioning

confidence: 99%

“…In this section, we formalize the proof-carrying code framework of [SU07] in a generic way as a Coq module parametrized by a formalization of Hoare logic for While programs. This latter formalization of Hoare logic itself abstracts the implementation of states, the language of assertions, and the underlying set of one-step, non-branching instructions.…”

Section: Verification Of Functional Correctness Of Assemblymentioning

confidence: 99%

“…Here, we explain in particular how we deal with arbitrary jumps in assembly. Concretely, we provide a formalization of the proof-carrying code framework of [SU07], that allows us to verify assembly with jumps through standard Hoare logic proofs.…”

Section: Introductionmentioning

confidence: 99%

“…In Sect. 4, we explain our formalization of the proof-carrying code framework of [SU07], that facilitates formal proof of functional correctness of assembly code. In Sect.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Certifying assembly with formal security proofs: The case of BBS

Affeldt

Nowak

Yamada

2012

Science of Computer Programming

View full text Add to dashboard Cite

With today's dissemination of embedded systems manipulating sensitive data, it has become important to equip low-level programs with strong security guarantees. Unfortunately, security proofs as done by cryptographers are about algorithms, not about concrete implementations running on hardware. In this article, we show how to perform security proofs to guarantee the security of assembly language implementations of cryptographic primitives. Our approach is based on a framework in the Coq proof assistant that integrates correctness proofs of assembly programs with game-playing proofs of provable security. We demonstrate the usability of our approach using the Blum-Blum-Shub pseudorandom number generator, for which a MIPS implementation for smartcards is shown cryptographically secure.

show abstract

Section: Verification Of Functional Correctness Of Assemblymentioning

confidence: 99%

Section: Verification Of Functional Correctness Of Assemblymentioning

confidence: 99%

Section: Verification Of Functional Correctness Of Assemblymentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

“…In Sect. 4, we explain our formalization of the proof-carrying code framework of [SU07], that facilitates formal proof of functional correctness of assembly code. In Sect.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Certifying assembly with formal security proofs: The case of BBS

Affeldt

Nowak

Yamada

2012

Science of Computer Programming

View full text Add to dashboard Cite

show abstract

Modular, Correct Compilation with Automatic Soundness Proofs

Steinhöfel

Hähnle

2018

Leveraging Applications of Formal Methods, Verification and Validation. Modeling

View full text Add to dashboard Cite

Hoare-Style Logic for Unstructured Programs

Lundberg

Guanciale

Lindner

et al. 2020

Software Engineering and Formal Methods

View full text Add to dashboard Cite

Enabling Hoare-style reasoning for low-level code is attractive since it opens the way to regain structure and modularity in a domain where structure is essentially absent. The field, however, has not yet arrived at a fully satisfactory solution, in the sense of avoiding restrictions on control flow (important for compiler optimization), controlling access to intermediate program points (important for modularity), and supporting total correctness. Proposals in the literature support some of these properties, but a solution that meets them all is yet to be found. We introduce the novel Hoare-style program logic LA, which interprets postconditions relative to program points when these are first encountered. The logic can support both partial and total correctness, derive contracts for arbitrary control flow, and allows one to freely choose decomposition strategy during verification while avoiding step-indexed approximations and global invariants. The logic can be instantiated for a variety of concrete instruction set architectures and intermediate languages. The rules of LA have been verified in the interactive theorem prover HOL4 and integrated with the toolbox HolBA for semi-automated program verification, making it applicable to the ARMv6 and ARMv8 instruction sets.

show abstract

A compositional natural semantics and Hoare logic for low-level languages

Cited by 22 publications

References 8 publications

Certifying assembly with formal security proofs: The case of BBS

Certifying assembly with formal security proofs: The case of BBS

Modular, Correct Compilation with Automatic Soundness Proofs

Hoare-Style Logic for Unstructured Programs

Contact Info

Product

Resources

About