Comparing the galois connection and widening/narrowing approaches to abstract interpretation

Patrick Cousot, Radhia Cousot

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

Abstract

The use of infinite abstract domains with widening and narrowing for accelerating the convergence of abstract interpretations is shown to be more powerful than the Galois connection approach restricted to finite lattices (or lattices satisfying the chain condition).

Original languageEnglish (US)
Title of host publicationProgramming Language Implementation and Logic Programming - 4th International Symposium, PLILP 1992, Proceedings
EditorsMaurice Bruynooghe, Martin Wirsing
PublisherSpringer Verlag
Pages269-295
Number of pages27
ISBN (Print)9783540558446
StatePublished - Jan 1 1992
Event4th International Symposium on Programming Language Implementation and Logic Programming, PLILP 1992 - Leuven, Belgium
Duration: Aug 26 1992Aug 28 1992

Publication series

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

Other

Other4th International Symposium on Programming Language Implementation and Logic Programming, PLILP 1992
CountryBelgium
CityLeuven
Period8/26/928/28/92

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Cousot, P., & Cousot, R. (1992). Comparing the galois connection and widening/narrowing approaches to abstract interpretation. In M. Bruynooghe, & M. Wirsing (Eds.), Programming Language Implementation and Logic Programming - 4th International Symposium, PLILP 1992, Proceedings (pp. 269-295). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 631 LNCS). Springer Verlag.