DeepAI AI Chat
Log In Sign Up

Loop Summarization with Rational Vector Addition Systems (extended version)

by   Jake Silverman, et al.

This paper presents a technique for computing numerical loop summaries. The method works first synthesizing a rational vector addition system with resets (Q-VASR) that simulates the action of an input loop, and then using the (polytime computable) reachability relation of Q-VASRs to over-approximate the behavior of the loop. The key technical problem solved in this paper is to synthesize a Q-VASR that is a best abstraction of a loop in the sense that (1) it simulates the loop and (2) it is simulated by any other Q-VASR that simulates the loop. As a result, our loop summarization scheme has predictable precision. We implement the summarization algorithm and show experimentally that it is precise and performant.


page 1

page 2

page 3

page 4


Uncertainty-Aware Abstractive Summarization

We propose a novel approach to summarization based on Bayesian deep lear...

Random Algorithms for the Loop Cutset Problem

We show how to find a minimum loop cutset in a Bayesian network with hig...

Approximate Summaries for Why and Why-not Provenance (Extended Version)

Why and why-not provenance have been studied extensively in recent years...

Randomized Algorithms for the Loop Cutset Problem

We show how to find a minimum weight loop cutset in a Bayesian network w...

De(con)struction of the lazy-F loop: improving performance of Smith Waterman alignment

Striped variation of the Smith-Waterman algorithm is known as extremely ...

A Complete Approach to Loop Verification with Invariants and Summaries

Loop invariants characterize the partial result computed by a loop so fa...

Regular Path Clauses and Their Application in Solving Loops

A well-established approach to reasoning about loops during program anal...