Speeding Up Logico-Numerical Strategy Iteration - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

Speeding Up Logico-Numerical Strategy Iteration

Résumé

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 a combination of strategy iteration and 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.

Dates et versions

hal-04597249 , version 1 (02-06-2024)

Identifiants

Citer

David Monniaux, Peter Schrammel. Speeding Up Logico-Numerical Strategy Iteration. Static analysis, Sep 2014, Munich, Germany. pp.253-267, ⟨10.1007/978-3-319-10936-7_16⟩. ⟨hal-04597249⟩
9 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More