Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.entcs.2012.10.009 | Electr. Notes Theor. Comput. Sci. |
Keywords | Field | DocType |
summarized dimensions revisited,single abstract variable,recursive function,earlier approach,principal operation,numeric relational domain,abstract variable,memory region,memory cell,data structure,relational abstract domain,summarization | Automatic summarization,Data mining,Data analysis,Abstract interpretation,Computer science,Theoretical computer science,Recursive functions | Journal |
Volume | ISSN | Citations |
288, | 1571-0661 | 3 |
PageRank | References | Authors |
0.40 | 6 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Holger Siegel | 1 | 11 | 1.92 |
| Axel Simon | 2 | 168 | 13.32 |