A control-flow normalization algorithm and its complexity, IEEE Transactions on Software Engineering, vol.18, issue.3, pp.237-251, 1992. ,
DOI : 10.1109/32.126773
A Modular Static Analysis Approach to Affine Loop Invariants Detection, Electronic Notes in Theoretical Computer Science, vol.267, issue.1, pp.3-16, 2010. ,
DOI : 10.1016/j.entcs.2010.09.002
URL : https://hal.archives-ouvertes.fr/hal-00586338
Computing the Transitive Closure of a Union of Affine Integer Tuple Relations, In COCOA, pp.98-109, 2009. ,
DOI : 10.1007/978-3-642-02026-1_9
URL : https://hal.archives-ouvertes.fr/hal-00575959
Path invariants, PLDI, pp.300-309, 2007. ,
DOI : 10.1145/1273442.1250769
Abstract, Journal of Functional Programming, vol.154, issue.04, pp.407-423, 1992. ,
DOI : 10.1017/S0956796800000496
Symbolic model checking of infinite state systems using presburger arithmetic, CAV, pp.400-411, 1997. ,
DOI : 10.1007/3-540-63166-6_39
Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm, SIAM Journal on Computing, vol.13, issue.3, pp.488-507, 1984. ,
DOI : 10.1137/0213031
Automatic discovery of linear restraints among variables of a program, Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '78, pp.84-96, 1978. ,
DOI : 10.1145/512760.512770
Accélération abstraite pour l'amélioration de la précision en Analyse des Relations Linéaires, 2007. ,
Combining Widening and Acceleration in Linear Relation Analysis, SAS, pp.144-160, 2006. ,
DOI : 10.1007/11823230_10
URL : https://hal.archives-ouvertes.fr/hal-00189614
SPEED: Symbolic Complexity Bound Analysis, CAV, pp.51-62, 2009. ,
DOI : 10.1007/978-3-642-02658-4_7
Control-flow refinement and progress invariants for bound analysis, PLDI, pp.375-385, 2009. ,
DOI : 10.1145/1543135.1542518
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.159.5169
Speed: precise and efficient static estimation of program computational complexity, POPL, pp.127-139, 2009. ,
The reachability-bound problem, PLDI, pp.292-304, 2010. ,
Détermination automatique de relations linéaires vérifiées par les variables d'un programme Institut National Polytechnique de Grenoble -INPG; Université Joseph-Fourier -Grenoble I, 03 1978, pp.2-985 ,
Linear relation analysis: Principles and recent progress, Presentation at Second French Compiler Research Meeting ,
Verification of real-time systems using linear relation analysis, Formal Methods in System Design, vol.11, issue.2, pp.157-185, 1997. ,
DOI : 10.1023/A:1008678014487
Rupak Majumdar, and Grégoire Sutre. Lazy abstraction, POPL, pp.58-70, 2002. ,
Semantical interprocedural parallelization: an overview of the PIPS project, ICS, pp.244-251, 1991. ,
URL : https://hal.archives-ouvertes.fr/hal-00984684
Partitionnement dynamique dans l'analyse de relations linéaires et application à la vérification de programmes synchrones, 2000. ,
Dynamic Partitioning in Analyses of Numerical Properties, SAS, pp.39-50, 1999. ,
DOI : 10.1007/3-540-48294-6_3
Implementing a cache consistency protocol, ISCA, pp.276-283, 1985. ,
DOI : 10.1145/327070.327237
Transitive closure of infinite graphs and its applications, LCPC, pp.126-140, 1995. ,
A new solution of Dijkstra's concurrent programming problem, Communications of the ACM, vol.17, issue.8, pp.453-455, 1974. ,
DOI : 10.1145/361082.361093
The trace partitioning abstract domain, ACM Transactions on Programming Languages and Systems, vol.29, issue.5, 2007. ,
DOI : 10.1145/1275497.1275501
Extending Abstract Acceleration Methods to Data-Flow Programs with Numerical Inputs, Electronic Notes in Theoretical Computer Science, vol.267, issue.1, pp.101-114, 2010. ,
DOI : 10.1016/j.entcs.2010.09.009
URL : https://hal.archives-ouvertes.fr/hal-00749914
Transitive Closures of Affine Integer Tuple Relations and Their Overapproximations, pp.3-2011 ,
DOI : 10.1007/978-3-642-02658-4_44
URL : https://hal.archives-ouvertes.fr/hal-00645221