Trace-based Deductive Verification

Bubel, RichardTechnical University of Darmstadt, Darmstadt, Germany (författare)

QC 20230831
Contracts specifying a procedure’s behavior in terms of pre- and postconditions are essential for scalable software verification, but cannot express any constraints on the events occurring during execution of the procedure. This necessitates to annotate code with intermediate assertions, preventing full specification abstraction. We propose a logic over symbolic traces able to specify recursive procedures in a modular manner that refers to specified programs only in terms of events. We also provide a deduction system based on symbolic execution and induction that we prove to be sound relative to a trace semantics. Our work generalizes contract-based to trace-based deductive verification by extending the notion of state-based contracts to trace-based contracts.

Gurov, Dilian,1964-KTH,Teoretisk datalogi, TCS(Swepub:kth)u1jmacmb (författare)
Hahnle, ReinerTechnical University of Darmstadt, Darmstadt, Germany (författare)
Scaletta, MarcoTechnical University of Darmstadt, Darmstadt, Germany (författare)
Technical University of Darmstadt, Darmstadt, GermanyTeoretisk datalogi, TCS (creator_code:org_t)

Ingår i:Proceedings of 24th International Conference on Logic for Programming, Artificial Intelligence and Reasoning: EasyChair, s. 73-95

Av författaren/redakt...: Bubel, Richard; Gurov, Dilian, 1 ...; Hahnle, Reiner; Scaletta, Marco

Om ämnet

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.