Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains

DMCA

Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Morten Kühnrich , Stefan Schwoon , Stefan Kiefer , Technische Universität München

Venue:	in "Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures
Citations:	3 - 1 self

BibTeX

@INPROCEEDINGS{Kühnrich_interproceduraldataflow,
    author = {Morten Kühnrich and Stefan Schwoon and Stefan Kiefer and Technische Universität München},
    title = {Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains},
    booktitle = {in "Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures},
    year = {}
}

OpenURL

Abstract

Abstract. We study generalized fixed-point equations over idempotent semirings and provide an efficient algorithm for the detection whether a sequence of Kleene’s iterations stabilizes after a finite number of steps. Previously known approaches considered only bounded semirings where there are no infinite descending chains. The main novelty of our work is that we deal with semirings without the boundedness restriction. Our study is motivated by several applications from interprocedural dataflow analysis. We demonstrate how the reachability problem for weighted pushdown automata can be reduced to solving equations in the framework mentioned above and we describe a few applications to demonstrate its usability. 1

Keyphrases

infinite descending chain interprocedural dataflow analysis weight domain several application weighted pushdown automaton bounded semirings main novelty idempotent semirings fixed-point equation reachability problem boundedness restriction efficient algorithm finite number kleene iteration

DMCA