Formal language, grammar and set-constraint-based program analysis by abstract interpretation

Patrick Cousot, Radhia Cousot

Research output: Contribution to conferencePaperpeer-review

Abstract

Grammar-based programs analyses are static analysis techniques that have traditionally been seen as quite different from abstract-interpretation-based analyses, due to their apparent non-iterative nature. There are decidable kinds of analysis that cannot be computed using abstract interpretation (even with widening and narrowing). An example of this is the set-based analysis considered in this work. It is shown that grammar and set-constraint-based program analyses are similar abstract interpretations with iterative fixpoint computation using either a widening or a finitary grammar/set-constraints transformer or even a finite domain for each particular program.

Original languageEnglish (US)
Pages170-181
Number of pages12
DOIs
StatePublished - 1995
EventConference Record of Conference on Functional Programming Languages and Computer Architecture - La Jolla, CA, USA
Duration: Jun 25 1995Jun 28 1995

Other

OtherConference Record of Conference on Functional Programming Languages and Computer Architecture
CityLa Jolla, CA, USA
Period6/25/956/28/95

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Formal language, grammar and set-constraint-based program analysis by abstract interpretation'. Together they form a unique fingerprint.

Cite this