Interprocedurally analyzing polynomial identities

Markus Müller-Olm, Michael Petter, Helmut Seidl

Publikation: Beitrag in Buch/Bericht/KonferenzbandKonferenzbeitragBegutachtung

13 Zitate (Scopus)

Abstract

Since programming languages are Turing complete, it is impossible to decide for all programs whether a given non-trivial semantic property is valid or not. The way-out chosen by abstract interpretation is to provide approximate methods which may fail to certify a program property on some programs. Precision of the analysis can be measured by providing classes of programs for which the analysis is complete, i.e., decides the property in question. Here, we consider analyses of polynomial identities between integer variables such as x 1 ·x2 -2x3 = 0. We describe current approaches and clarify their completeness properties. We also present an extension of our approach based on weakest precondition computations to programs with procedures and equality guards.

OriginalspracheEnglisch
TitelSTACS 2006
Untertitel23rd Annual Symposium on Theoretical Aspects of Computer Science, Proceedings
Herausgeber (Verlag)Springer Verlag
Seiten50-67
Seitenumfang18
ISBN (Print)3540323015, 9783540323013
DOIs
PublikationsstatusVeröffentlicht - 2006
VeranstaltungSTACS 2006: 23rd Annual Symposium on Theoretical Aspects of Computer Science, Proceedings - Marseille, Frankreich
Dauer: 23 Feb. 200625 Feb. 2006

Publikationsreihe

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

Konferenz

KonferenzSTACS 2006: 23rd Annual Symposium on Theoretical Aspects of Computer Science, Proceedings
Land/GebietFrankreich
OrtMarseille
Zeitraum23/02/0625/02/06

Fingerprint

Untersuchen Sie die Forschungsthemen von „Interprocedurally analyzing polynomial identities“. Zusammen bilden sie einen einzigartigen Fingerprint.

Dieses zitieren