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

Patrick Cousot, Radhia Cousot

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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)
Title of host publicationConf Rec Conf Funct Program Lang Comput Archit
Editors Anon
PublisherACM
Pages170-181
Number of pages12
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

Fingerprint

Formal languages
Static analysis

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Cousot, P., & Cousot, R. (1995). Formal language, grammar and set-constraint-based program analysis by abstract interpretation. In Anon (Ed.), Conf Rec Conf Funct Program Lang Comput Archit (pp. 170-181). ACM.

Formal language, grammar and set-constraint-based program analysis by abstract interpretation. / Cousot, Patrick; Cousot, Radhia.

Conf Rec Conf Funct Program Lang Comput Archit. ed. / Anon. ACM, 1995. p. 170-181.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Cousot, P & Cousot, R 1995, Formal language, grammar and set-constraint-based program analysis by abstract interpretation. in Anon (ed.), Conf Rec Conf Funct Program Lang Comput Archit. ACM, pp. 170-181, Conference Record of Conference on Functional Programming Languages and Computer Architecture, La Jolla, CA, USA, 6/25/95.
Cousot P, Cousot R. Formal language, grammar and set-constraint-based program analysis by abstract interpretation. In Anon, editor, Conf Rec Conf Funct Program Lang Comput Archit. ACM. 1995. p. 170-181
Cousot, Patrick ; Cousot, Radhia. / Formal language, grammar and set-constraint-based program analysis by abstract interpretation. Conf Rec Conf Funct Program Lang Comput Archit. editor / Anon. ACM, 1995. pp. 170-181
@inproceedings{b53ee820aba4422cbe13620976ec59f1,
title = "Formal language, grammar and set-constraint-based program analysis by abstract interpretation",
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.",
author = "Patrick Cousot and Radhia Cousot",
year = "1995",
language = "English (US)",
pages = "170--181",
editor = "Anon",
booktitle = "Conf Rec Conf Funct Program Lang Comput Archit",
publisher = "ACM",

}

TY - GEN

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

AU - Cousot, Patrick

AU - Cousot, Radhia

PY - 1995

Y1 - 1995

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0029180092&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029180092&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0029180092

SP - 170

EP - 181

BT - Conf Rec Conf Funct Program Lang Comput Archit

A2 - Anon, null

PB - ACM

ER -