Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains

Details Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains

2009-01-05

arxiv.org/abs/0901.0501v2

Computer Science

Data Structures and Algorithms

technical report for a FOSSACS'09 publication

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-35077