52 citations · 146 across the 41 of their papers we have counts for
Showing 2009Show all
2 papers · 1 filter
cs.DS2009★ 3 cited
Computing Least Fixed Points of Probabilistic Systems of Polynomials
Javier Esparza, Andreas Gaiser, Stefan Kiefer
We study systems of equations of the form X1 = f1(X1, ..., Xn), ..., Xn = fn(X1, ..., Xn), where each fi is a polynomial with nonnegative coefficients that add up to 1. The least n…
cs.DS2009
Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains
Morten Kühnrich, Stefan Schwoon, Jiří Srba +1
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…