Arrow Research search
Back to Highlights

Highlights 2021

Porous invariants

Conference Abstract SESSION 10B: Verification II Logic in Computer Science · Theoretical Computer Science

Abstract

We introduce the notion of porous invariants for multipath (or branching/nondeterministic) affine loops over the integers; that is, invariants defined using Presburger arithmetic/semi-linear sets and subclasses. These invariants are not necessarily convex, and can in fact contain infinitely many ‘holes’. Nevertheless, we show that in many cases such invariants can be automatically synthesised, and moreover can be used to settle (non-)reachability questions for various interesting classes of affine loops and target sets. Joint work with Engel Lefaucheux, Joël Ouaknine, and James Worrell

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
Highlights of Logic, Games and Automata
Archive span
2013-2025
Indexed papers
1236
Paper id
966152900892674398