Enforcing termination of interprocedural analysis

Stefan Schulze Frielinghaus, Helmut Seidl, Ralf Vogler

Publikation: Beitrag in Buch/Bericht/KonferenzbandKonferenzbeitragBegutachtung

5 Zitate (Scopus)

Abstract

Interprocedural analysis by means of partial tabulation of summary functions may not terminate when the same procedure is analyzed for infinitely many abstract calling contexts or when the abstract domain has infinite strictly ascending chains. As a remedy, we present a novel local solver for general abstract equation systems, be they monotonic or not, and prove that this solver fails to terminate only when infinitely many variables are encountered. We clarify in which sense the computed results are sound. Moreover, we show that interprocedural analysis performed by this novel local solver, is guaranteed to terminate for all non-recursive programs — irrespective of whether the complete lattice is infinite or has infinite strictly ascending or descending chains.

OriginalspracheEnglisch
TitelStatic Analysis - 23rd International Symposium, SAS 2016, Proceedings
Redakteure/-innenXavier Rival
Herausgeber (Verlag)Springer Verlag
Seiten447-468
Seitenumfang22
ISBN (Print)9783662534120
DOIs
PublikationsstatusVeröffentlicht - 2016
Veranstaltung23rd International Symposium on Static Analysis, SAS 2016 - Edinburgh, Großbritannien/Vereinigtes Königreich
Dauer: 8 Sept. 201610 Sept. 2016

Publikationsreihe

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

Konferenz

Konferenz23rd International Symposium on Static Analysis, SAS 2016
Land/GebietGroßbritannien/Vereinigtes Königreich
OrtEdinburgh
Zeitraum8/09/1610/09/16

Fingerprint

Untersuchen Sie die Forschungsthemen von „Enforcing termination of interprocedural analysis“. Zusammen bilden sie einen einzigartigen Fingerprint.

Dieses zitieren