Pathwidth and treewidth are standard and well-studied graph sparsity parameters which
intuitively model the degree to which a given graph resembles a path or a tree, respectively …

This paper presents a program analysis method that generates program summaries
involving polynomial arithmetic. Our approach builds on prior techniques that use solvable …

Deciding termination is a fundamental problem in the analysis of probabilistic imperative
programs. We consider the qualitative and quantitative probabilistic termination problems for …

This paper presents a theory of non-linear integer/real arithmetic and algorithms for
reasoning about this theory. The theory can be conceived of as an extension of linear …

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 …

Algebraic Program Analysis (APA) is a ubiquitous framework that has been employed as a
unifying model for various problems in data-flow analysis, termination analysis, invariant …

Termination analyses investigate the termination behavior of programs, intending to detect
nontermination, which is known to cause a variety of program bugs (eg hanging programs …

Checking satisfiability of formulae in the theory of linear arithmetic has far reaching
applications, including program verification and synthesis. Many satisfiability solvers excel at …

We introduce a novel approach to the automated termination analysis of computer
programs: we use neural networks to represent ranking functions. Ranking functions map …

Rust aims to be a safe programming language applicable to systems programming
applications. In particular, its type system has strong guardrails to prevent a variety of issues …