Program verification using abstract interpretation involves the symbolic calculation of fixpoints over lattices. Integral to these fixpoint calculations is widening, an operation that trades precision for guarantees of termination. Abstract interpretation often works with lattices of convex sets of points in n-dimensional space, represented by sets of linear inequalities. When the form of these inequalities is restricted these are known as weakly relational domains. This paper addresses weakly relational domains, the detail of their representation and the way in which widening is applied, including study of how the closure operators used in weakly relational domains interact with widening, and considers how sequences of constraints might be widened. Satisfiability checking for numeric constraints is one tool used in this work.
Canonical Forms and Widening for Two Variables Per Inequality Systems. // Bulletin of Materials Science. – 2026. – DOI: 10.1007/s11786-025-00612-6. – URL: https://link.springer.com/article/10.1007/s11786-025-00612-6
(2026). Canonical Forms and Widening for Two Variables Per Inequality Systems. Bulletin of Materials Science. https://doi.org/10.1007/s11786-025-00612-6
“Canonical Forms and Widening for Two Variables Per Inequality Systems.” Bulletin of Materials Science, 2026. doi:10.1007/s11786-025-00612-6.
@article{article34447,
title = {Canonical Forms and Widening for Two Variables Per Inequality Systems},
journal = {Bulletin of Materials Science},
year = {2026},
doi = {10.1007/s11786-025-00612-6},
url = {https://link.springer.com/article/10.1007/s11786-025-00612-6}
}
A multivariate polynomial $f$ is decomposable if $f$ is a composition $f=u\circ h$, where $u$ is a univariate polynomial of degree greater than one and $h$ is a multivariate polynomial. We consider the problem of computing the nearest...
Cancer is a major cause of mortality, yet the mechanisms governing its growth, progression, and elimination remain incompletely understood. Mathematical modeling not only clarifies these complex processes but also provides clinicians...
Residue number systems based on pairwise relatively prime moduli are a powerful tool for accelerating integer computations via the Chinese Remainder Theorem. We study a structured family of moduli of the form $2^{n} - 2^{k} + 1$,...
This work is devoted to the symbolic computation of centralizers of ordinary differential operators (ODOs), in the ring of differential operators. Starting with an operator $L$ of order $n$ and the order $\mathfrak{m}$ of a non-trivial...
In this work, we address the problem of expressing sequences of $d$-orthogonal polynomials in terms of either orthogonal polynomials or the canonical basis. We derive a general recurrence relation that enables the symbolic recursive...