Automatic synthesis of optimal invariant assertions: Mathematical foundations

Patrick Cousot, Radhia Cousot

Research output: Contribution to conferencePaper

Abstract

The problem of discovering invariant assertions of programs is explored in light of the fixpoint approach in the static analysis of programs, Cousot [1977a], Cousot[1977b].

Original languageEnglish (US)
Pages1-12
Number of pages12
DOIs
StatePublished - Aug 15 1977
EventSymposium on Artificial Intelligence and Programming Languages 1977 - Rochester, United States
Duration: Aug 15 1977Aug 17 1977

Other

OtherSymposium on Artificial Intelligence and Programming Languages 1977
CountryUnited States
CityRochester
Period8/15/778/17/77

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint Dive into the research topics of 'Automatic synthesis of optimal invariant assertions: Mathematical foundations'. Together they form a unique fingerprint.

  • Cite this

    Cousot, P., & Cousot, R. (1977). Automatic synthesis of optimal invariant assertions: Mathematical foundations. 1-12. Paper presented at Symposium on Artificial Intelligence and Programming Languages 1977, Rochester, United States. https://doi.org/10.1145/800228.806926