Pith. sign in

REVIEW

A Partial-Order Approach to Array Content Analysis

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1408.1754 v1 pith:F42ZGJDK submitted 2014-08-08 cs.PL

classification cs.PL
keywords arrayanalysiscontentabstractdomainapproacharbitraryavoiding
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We present a parametric abstract domain for array content analysis. The method maintains invariants for contiguous regions of the array, similar to the methods of Gopan, Reps and Sagiv, and of Halbwachs and Peron. However, it introduces a novel concept of an array content graph, avoiding the need for an up-front factorial partitioning step. The resulting analysis can be used with arbitrary numeric relational abstract domains; we evaluate the domain on a range of array manipulating program fragments.

Discussion (0). Sign in to comment.

Pith tools