Automatic discovery of linear restraints among variables of a program
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Compiler Analysis of the Value Ranges for Variables
IEEE Transactions on Software Engineering
Exploiting sparsity in polyhedral analysis
SAS'05 Proceedings of the 12th international conference on Static Analysis
Comparing completeness properties of static analyses and their logics
APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems
| Hi-index | 0.00 |
The task of summarizing memory regions becomes increasingly important in the analysis of data structures and the analysis of recursive functions. Calculating summaries of memory regions containing several abstract variables becomes quite subtle when using relational abstract domains. We address this challenge using two principal operations, fold and expand, that calculate such summaries for any numeric relational domain and argue optimality. We thereby generalize an earlier approach in the literature that was geared towards memory cells modelled by a single abstract variable.