Reduction to satisfiability of constrained Horn clauses (CHCs) is a widely studied approach
to automated program verification. Current CHC-based methods, however, do not work very …

Authors' addresses: Hari Govind VK, Department of Electrical and Computer Engineering,
University of Waterloo, Canada, hgvk94@ gmail. com; Sharon Shoham, Tel-Aviv University …

Hyperproperties specify the behavior of a system across multiple executions, and are an
important extension of regular temporal properties. So far, such properties have resisted …

First-order logic is a natural way of expressing properties of computation. It is traditionally
used in various program logics for expressing the correctness properties and certificates …

A representation invariant is a property that holds of all values of abstract type produced by a
module. Representation invariants play important roles in software engineering and …

Formal verification of smart contracts has become a hot topic in academic and industrial
research, given the growing value of assets managed by decentralized applications and the …

Inferring loop invariants is one of the most challenging problems in program verification. It is
highly desired to incorporate machine learning when inferring. This paper presents a …

This paper presents a technique for summarizing recursive procedures operating on integer
variables. The motivation of our work is to create more predictable program analyzers, and …

Functional programs typically interact with stateful libraries that hide state behind typed
abstractions. One particularly important class of applications are data structure …

We propose a method for synthesizing invariants that can help verify relational properties
over two programs or two different executions of a program. Applications of such invariants …