Modern programmable blockchains have built-in support for smart contracts, ie ‍programs
that are stored on the blockchain and whose state is subject to consensus. After a smart …

The template-based approach to invariant generation is a parametric and relatively
complete methodology for inferring loop invariants. The relative completeness ensures the …

Constraint-solving-based program invariant synthesis involves taking a parametric template,
encoding the invariant conditions, and attempting to solve the constraints to obtain a valid …

Invariant generation is a critical task in program verification. Literature highlights Farkas'
Lemma as a principal sound and complete framework for proactively generating tight …

Invariant generation is the classical problem that aims at automated generation of assertions
that over-approximates the set of reachable program states in a program. We consider the …

In this work, we consider two sets I and O of bounded integer variables, modeling the inputs
and outputs of a program. Given a specification Post, which is a Boolean combination of …

Invariant relations are used to analyze while loops; while their primary application is to
derive the function of a loop, they can also be used to derive loop invariants, weakest …

In this work, we propose a novel approach to generate affine disjunctive invariants via
Farkas' Lemma. By observing that disjunctive invariants often arise from the conditional …

Invariant generation is the classical problem of automatically generating logical assertions
that over-approximates the set of reachable program states in a program. We consider the …