English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We present a logical framework for the verification of relational propertiesin imperative programs. Our work is motivated by relational properties whichcome from security applications and often require reasoning about formulas withquantifier-alternations. Our framework reduces verification of relationalproperties of imperative programs to a validity problem into trace logic, anexpressive instance of first-order predicate logic. Trace logic draws itsexpressiveness from its syntax, which allows expressing properties overcomputation traces. Its axiomatization supports fine-grained reasoning aboutintermediate steps in program execution, notably loop iterations. We present analgorithm to encode the semantics of programs as well as their relationalproperties in trace logic, and then show how first-order theorem proving can beused to reason about the resulting trace logic formulas. Our work isimplemented in the tool Rapid and evaluated with examples coming from thesecurity field.

Verifying Relational Properties using Trace Logic