Underapproximation of procedure summaries for integer programs
From MaRDI portal
Publication:5326329
Abstract: We show how to underapproximate the procedure summaries of recursive programs over the integers using off-the-shelf analyzers for non-recursive programs. The novelty of our approach is that the non-recursive program we compute may capture unboundedly many behaviors of the original recursive program for which stack usage cannot be bounded. Moreover, we identify a class of recursive programs on which our method terminates and returns the precise summary relations without underapproximation. Doing so, we generalize a similar result for non-recursive programs to the recursive case. Finally, we present experimental results of an implementation of our method applied on a number of examples.
Recommendations
Cited in
(6)- Programming Languages and Systems
- scientific article; zbMATH DE number 7439739 (Why is no real title available?)
- Interprocedural reachability for flat integer programs
- Solving non-linear Horn clauses using a linear Horn clause solver
- A calculus for modular loop acceleration
- Predicate pairing for program verification
This page was built for publication: Underapproximation of procedure summaries for integer programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5326329)