Verifying relational properties using trace logic
Paper i proceeding, 2019

We present a logical framework for the verification of relational properties in imperative programs. Our frame-work reduces verification of relational properties of imperative programs to a validity problem in trace logic, an expressive instance of first-order predicate logic. Trace logic draws its expressiveness from its syntax, which allows expressing properties over computation traces. Its axiomatization supports fine-grained reasoning about intermediate steps in program execution, notably loop iterations. We present an algorithm to encode the semantics of programs as well as their relational properties in trace logic, and then show how first-order theorem proving can be used to reason about the resulting trace logic formulas. Our work is implemented in the tool RAPID and evaluated with examples coming from the security field.

Standards

Programming

Cognition

Interference

Tools

Security

Semantics

Författare

Gilles Barthes

IMDEA Software Institute

Max Planck Institute for Security and Privacy

Renate Eilers

Technische Universität Wien

Pamina Georgiou

Technische Universität Wien

B. Gleiss

Technische Universität Wien

Laura Kovacs

Chalmers, Data- och informationsteknik, Formella metoder

Technische Universität Wien

Matteo Maffei

Technische Universität Wien

Proceedings of the 19th Conference on Formal Methods in Computer-Aided Design, FMCAD 2019

170-178 8894277

19th Conference on Formal Methods in Computer-Aided Design, FMCAD 2019
San Jose, USA,

Ämneskategorier

Filosofi

Datavetenskap (datalogi)

Datorsystem

DOI

10.23919/FMCAD.2019.8894277

Mer information

Senast uppdaterat

2020-07-01