Name
Abstract | ||
|---|---|---|
We present practical algorithms for computing exact least solutions of equation systems over the reals with addition, multiplication by positive constants, minimum and maximum. The algorithms are based on strategy iteration. Our algorithms can, for instance, be used for the analysis of recursive stochastic games. In the present article we apply our techniques for computing abstract least fixpoint semantics of affine programs over the relational template polyhedra domain. In particular, we thus obtain practical algorithms for computing abstract least fixpoint semantics over the abstract domains of intervals, zones, and octagons. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1145/1961204.1961207 | ACM Trans. Program. Lang. Syst. |
Keywords | Field | DocType |
present article,abstract interpretation,equation system,strategy improvement algorithms,fixpoint semantics,strategy iteration,rational equation,abstract domain,practical algorithm,fixpoint equation systems,recursive stochastic game,relational template polyhedra domain,static program analysis,recursive stochastic games,affine program,positive constant | Affine transformation,Static program analysis,Computer science,Abstract interpretation,Polyhedron,Theoretical computer science,Multiplication,Fixed-point theorem,Recursion,Abstract machine | Journal |
Volume | Issue | ISSN |
33 | 3 | 0164-0925 |
Citations | PageRank | References |
17 | 0.67 | 26 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Thomas Martin Gawlitza | 1 | 88 | 6.37 |
| Helmut Seidl | 2 | 1468 | 103.61 |