Compactly representing first-order structures for static analysis

R. Manevich, G. Ramalingam, J. Field, D. Goyal, M. Sagiv

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

16 Scopus citations

Abstract

A fundamental bottleneck in applying sophisticated static analyses to large programs is the space consumed by abstract program states. This is particularly true when analyzing programs that make extensive use of heap-allocated data. The TVLA (Three-Valued Logic Analysis) program analysis and verification system models dynamic allocation precisely by representing program states as first-order structures. In such a representation, a finite collection of predicates is used to define states; the predicates range over a universe of individuals that may evolve—expand and contract—during analysis. Evolving first-order structures can be used to encode a wide variety of analyses, including most analyses whose abstract states are represented by directed graphs or maps. This paper addresses the problem of space consumption in such analyses by describing and evaluating two novel structure representation techniques. One technique uses ordered binary decision diagrams (OB-DDs); the other uses a variant of a functional map data structure. Using a suite of benchmark analysis problems, we systematically compare the new representations with TVLA's existing state representation. The results show that both the OBDD and functional implementations reduce space consumption in TVLA by a factor of 4 to 10 relative to the current TVLA state representation, without compromising analysis time. In addition to TVLA, we believe that our results are applicable to many program analysis systems that represent states as graphs, maps, or other structures of similar complexity.

Original languageEnglish
Title of host publicationStatic Analysis - 9th International Symposium, SAS 2002 Madrid, Spain, September 17-20, 2002 Proceedings
EditorsManuel V. Hermenegildo, German Puebla
PublisherSpringer Verlag
Pages196-212
Number of pages17
ISBN (Print)3540442359
DOIs
StatePublished - 1 Jan 2002
Externally publishedYes
Event9th International Static Analysis Symposium, SAS 2002 - Madrid, Spain
Duration: 17 Sep 200220 Sep 2002

Publication series

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

Conference

Conference9th International Static Analysis Symposium, SAS 2002
Country/TerritorySpain
CityMadrid
Period17/09/0220/09/02

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Compactly representing first-order structures for static analysis'. Together they form a unique fingerprint.

Cite this