Summarized Dimensions Revisited

Siegel, Holger; Simon, Axel

doi:10.1016/j.entcs.2012.10.009

Cited by 4 publications

(12 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The key insight is that this relational information can be precisely inferred using a relational fold and expand [19] that we adapted to Boolean functions. Using these operations, our shape analysis has the ability to infer new shape invariants automatically.…”

Section: Resultsmentioning

confidence: 99%

“…Note that the points-to sets of A and B now contain the same set of addresses, so that each flag associated with B can be merged with the respective flag of A. Merging and duplication of flags is based on fold and expand which is defined as follows [19]: …”

Section: Summarizing Nodesmentioning

confidence: 99%

“…The contribution of our work lies in describing how to perform summarization and materialization of nodes using sets of two-valued interpretations. Specifically, the insight in this paper is that invariant relations between neighboring nodes can be inferred during summarization using a relational fold operation that was recently defined for numeric domains [19]. A symmetric expand operation duplicates these relations when a summary cell is materialized back into two heap cells, one of which is a concrete non-summary cell.…”

Section: Introductionmentioning

confidence: 99%

“…-a shape representation using points-to relations qualified by {0, 1}-vectors, thus substituting the common approach of representing heaps using a logic with simple transformers operating on a single graph and a numeric state -a shape analysis for which transformers are easy to derive since they never operate on summary nodes and thus directly follow the concrete transformers -the use of relational fold and expand operators [19] to summarize and materialize heap cells, allowing for a highly precise inference of new shapes; indeed, we can synthesize the strongest invariant when summarizing two heap cells -the observation that only two extra properties suffice to distinguish common classes of data structures [21] as long as these are tracked with high precision; allowing us to verify programs operating on lists, trees and graphs…”

Section: Introductionmentioning

confidence: 99%

“…1b). To this end, our analysis uses the points-to graph to determine which edges to overlay and then applies a relational fold operation from [19] in order to summarize the corresponding dimensions. As a result, the dimensions f xA , f yA , f yB , f yC , f AB , f BC corresponding to Fig.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

FESA: Fold- and Expand-Based Shape Analysis

Siegel

Simon

2013

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. A static shape analysis is presented that can prove the absence of NULL-and dangling pointer dereferences in standard algorithms on lists, trees and graphs. It is conceptually simpler than other analyses that use symbolically represented logic to describe the heap. Instead, it represents the heap as a single graph and a Boolean formula. The key idea is to summarize two nodes by calculating their common points-to information, which is done using the recently proposed fold and expand operations. The force of this approach is that both, fold and expand , retain relational information between points-to edges, thereby essentially inferring new shape invariants. We show that highly precise shape invariants can be inferred using off-the-shelf SAT-solvers. Cheaper approximations may augment standard points-to analysis used in compiler optimisations.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Summarizing Nodesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

FESA: Fold- and Expand-Based Shape Analysis

Siegel

Simon

2013

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

Abstraction of Optional Numerical Values

Liu

Rival

2015

Programming Languages and Systems

View full text Add to dashboard Cite

From Array Domains to Abstract Interpretation Under Store-Buffer-Based Memory Models

Suzanne

Miné

2016

Static Analysis

View full text Add to dashboard Cite

We address the problem of verifying concurrent programs under store-buffer-based weakly consistent memory models, such as TSO or PSO. Using the abstract interpretation framework, we adapt existing domains for arrays to model store buffers and obtain a sound abstraction of program states (including the case of programs with infinite state space) parameterised by a numerical domain. Whereas the usual method for this kind of programs implements a program transformation to come back to an analysis under a sequentially consistent model, the novelty of our work consists in applying abstract interpretation directly on the source program, setting a clean foundation for special dedicated domains keeping information difficult to express with program transformations. We demonstrate the precision of this method on a few examples, targetting the TSO model and incidentally being also sound for PSO due to some specific abstraction choice. We discuss an application to fence removal and show that our implementation is usually able to remove as many or more fences, with respect to the state of the art, on concurrent algorithms designed for sequential consistency while still remaining precise enough to verify them.

show abstract

Summarized Dimensions Revisited

Cited by 4 publications

References 6 publications

FESA: Fold- and Expand-Based Shape Analysis

FESA: Fold- and Expand-Based Shape Analysis

Abstraction of Optional Numerical Values

From Array Domains to Abstract Interpretation Under Store-Buffer-Based Memory Models

Contact Info

Product

Resources

About