Work

From Polynomial Invariants to Linear Loops

Year: 2023

Type: conference-paper

Abstract: Loop invariants are software properties that hold before and after every iteration of a loop. As such, invariants provide inductive arguments that are key in automating the verification of program loops. The problem of generating loop invariants; in particular, invariants described by polynomial relations (so called polynomial invariants), is therefore one of the hardest problems in software verification. In this paper we advocate an alternative solution to invariant generation. Rather than inferring invariants from loops, we synthesise loops from invariants. As such, we generate loops that satisfy a given set of polynomials; in other words, our synthesised loops are correct by construction.

Source: International Symposium on Symbolic and Algebraic Computation

DOI: 10.1145/3597066.3597109

Authors: George Kenison, Laura Kovács, Anton Varonka

Institution: TU Wien

Language: English

Topic: Logic, programming, and type systems

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Funders: Vienna Science and Technology Fund, Technische Universität Wien, Horizon 2020 Framework Programme, European Research Council

Awards: G1291787790, G2251107624, ProbInG: Distribution Recovery for Invariant Generation of Probabilistic Programs, G8596729496