X-Git-Url: https://svn.cri.ensmp.fr/git/linpy.git/blobdiff_plain/51e97eade63b2f4c7b500feb503436cc4a886e59..8254671f212705c1ea79353ee341c0363bd7cd10:/examples/nsad2010.py diff --git a/examples/nsad2010.py b/examples/nsad2010.py index f310f9d..4b73eef 100755 --- a/examples/nsad2010.py +++ b/examples/nsad2010.py @@ -1,23 +1,14 @@ #!/usr/bin/env python3 -""" - This file is part of Linpy. +# This is an implementation of the algorithm described in +# +# [ACI10] C. Ancourt, F. Coelho and F. Irigoin, A modular static analysis +# approach to affine loop invariants detection (2010), pp. 3 - 16, NSAD 2010. +# +# to compute the transitive closure of an affine transformer. A refined version +# of this algorithm is implemented in PIPS. - Linpy is free software: you can redistribute it and/or modify - it under the terms of the GNU General Public License as published by - the Free Software Foundation, either version 3 of the License, or - (at your option) any later version. - - Linpy is distributed in the hope that it will be useful, - but WITHOUT ANY WARRANTY; without even the implied warranty of - MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - GNU General Public License for more details. - - You should have received a copy of the GNU General Public License - along with Linpy. If not, see . -""" - -from pypol import * +from linpy import * class Transformer: @@ -56,10 +47,8 @@ class Transformer: if __name__ == '__main__': - i, iprime, j, jprime = symbols("i i' j j'") - transformer = Transformer(Eq(iprime, i + 2) & Eq(jprime, j + 1), - [i, j], [iprime, jprime]) + i0, i, j0, j = symbols('i0 i j0 j') + transformer = Transformer(Eq(i, i0 + 2) & Eq(j, j0 + 1), + [i0, j0], [i, j]) print('T =', transformer.polyhedron) print('T* =', transformer.star().polyhedron) - -# Copyright 2014 MINES ParisTech