Skip to content
naulon
Not checkedNot checked for notices yet.

Understanding Counterexamples for Relational Properties with DIbugger

Mihai Herda, Michael Kirsten, Etienne Brunner and 6 more

Electronic Proceedings in Theoretical Computer Science · 2019

doi:10.4204/eptcs.296.4 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Software verification is a tedious process that involves the analysis of multiple failed verification attempts, and adjustments of the program or specification. This is especially the case for complex requirements, e.g., regarding security or fairness, when one needs to compare multiple related runs of the same software. Verification tools often provide counterexamples consisting of program inputs when a proof attempt fails, however it is often not clear why the reported counterexample leads to a violation of the checked property. In this paper, we enhance this aspect of the software verification process by providing DIbugger, a tool for analyzing counterexamples of relational properties, allowing the user to debug multiple related programs simultaneously.

Abstract licence: CC BY-NC-ND

References13

    13 more references, whose wording the paper’s licence keeps private.

    Reads

    Read by people on this page

    None yet.

    Checked or read by AI through naulon

    None yet.

    A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

    Are you an author?

    Is this your paper?

    Claim it to add your note and be paid when agents cite it. Free.