title = { Speeding Up Logico-Numerical Strategy Iteration },
    author = {Monniaux, David and Schrammel, Peter},
    year = {2014},
    booktitle = {Static Analysis - 21st International Symposium, {SAS} 2014, Munich, Germany, September 11-13, 2014. Proceedings},
    eprint = {1403.2319},
    pages = {253--267},
    publisher = {Springer},
    series = {Lecture Notes in Computer Science},
    volume = {8723},
    team = {PACSS},
    timestamp = {Thu, 13 Nov 2014 04:44:25 +0100}, biburl = {}, bibsource = {dblp computer science bibliography,}, entrysubtype = {intc}, eprinttype = {arXiv},
    abstract = {We introduce an efficient combination of polyhedral analysis and predicate partitioning. Template polyhedral analysis abstracts numerical variables inside a program by one polyhedron per control location, with a priori fixed directions for the faces. The strongest inductive invariant in such an abstract domain may be computed by upward strategy iteration. If the transition relation includes disjunctions and existential quantifiers (a succinct representation for an exponential set of paths), this invariant can be computed by a combination of strategy iteration and satisfiability modulo theory (SMT) solving. Unfortunately, the above approaches lead to unacceptable space and time costs if applied to a program whose control states have been partitioned according to predicates. We therefore propose a modification of the strategy iteration algorithm where the strategies are stored succinctly, and the linear programs to be solved at each iteration step are simplified according to an equivalence relation. We have implemented the technique in a prototype tool and we demonstrate on a series of examples that the approach performs significantly better than previous strategy iteration techniques.},


Contact | Site Map | Site powered by SPIP 4.2.13 + AHUNTSIC [CC License]

info visites 4005804