ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Maximal Quantified Precondition Synthesis for Linear Array Loops

Sumanth Prabhu, S and Fedyukovich, G and D�Souza, D (2024) Maximal Quantified Precondition Synthesis for Linear Array Loops. In: UNSPECIFIED, pp. 245-274.

[img]
Preview
PDF
lec_not_com_sci_14577_2024.pdf - Published Version

Download (8MB) | Preview
Official URL: https://doi.org/10.1007/978-3-031-57267-8_10

Abstract

Precondition inference is an important problem with many applications in verification and testing. Finding preconditions can be tricky as programs often have loops and arrays, which necessitates finding quantified inductive invariants. However, existing techniques have limitations in finding such invariants, especially when preconditions are missing. Further, maximal (or weakest) preconditions are often required to maximize the usefulness of preconditions. So the inferred inductive invariants have to be adequately weak. To address these challenges, we present an approach for maximal quantified precondition inference using an infer-check-weaken framework. Preconditions and inductive invariants are inferred by a novel technique called range abduction, and then checked for maximality and weakened if required. Range abduction attempts to propagate the given quantified postcondition backwards and then strengthen or weaken it as needed to establish inductiveness. Weakening is done in a syntax-guided fashion. Our evaluation performed on a set of public benchmarks demonstrates that the technique significantly outperforms existing techniques in finding maximal preconditions and inductive invariants. © The Author(s) 2024.

Item Type: Conference Paper
Publication: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publisher: Springer Science and Business Media Deutschland GmbH
Additional Information: The copyright for this article belongs to author.
Keywords: Linear-array; Maximality; Novel techniques; Verification and testing; Weakest precondition, Artificial intelligence
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Date Deposited: 27 May 2024 06:23
Last Modified: 27 May 2024 06:23
URI: https://eprints.iisc.ac.in/id/eprint/85032

Actions (login required)

View Item View Item