Non-disjunctive numerical domain for array predicate abstraction

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We present a numerical abstract domain to infer invariants on (a possibly unbounded number of) consecutive array elements using array predicates. It is able to represent and compute affine equality relations over the predicate parameters and the program variables, without using disjunctions or heuristics. It is the cornerstone of a sound static analysis of one- and two-dimensional array manipulation algorithms. The implementation shows very good performance on representative benchmarks. Our approach is sufficiently robust to handle programs traversing arrays and matrices in various ways.

Original languageEnglish
Title of host publicationProgramming Languages and Systems - 17th European Symposium on Programming, ESOP 2008 - Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Proceedings
Pages163-177
Number of pages15
DOIs
Publication statusPublished - 21 Jul 2008
Externally publishedYes
Event17th European Symposium on Programming, ESOP 2008 - Budapest, Hungary
Duration: 29 Mar 20086 Apr 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4960 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference17th European Symposium on Programming, ESOP 2008
Country/TerritoryHungary
CityBudapest
Period29/03/086/04/08

Fingerprint

Dive into the research topics of 'Non-disjunctive numerical domain for array predicate abstraction'. Together they form a unique fingerprint.

Cite this