A Class of Polynomially Solvable Range Constraints for Interval Analysis without Widenings and Narrowings, TACAS 2004, pp.280-295, 2004. ,
DOI : 10.1007/978-3-540-24730-2_23
Polynomial Precise Interval Analysis Revisited, EA 2009, pp.422-437, 2009. ,
DOI : 10.1007/978-3-540-74061-2_12
URL : https://hal.archives-ouvertes.fr/hal-00414750
A Policy Iteration Algorithm for Computing Fixed Points in Static Analysis of Programs, CAV 2005, pp.462-475, 2005. ,
DOI : 10.1007/11513988_46
Precise Relational Invariants Through Strategy Iteration, CSL 2007, pp.23-40, 2007. ,
DOI : 10.1007/978-3-540-74915-8_6
Verification of real-time systems using linear relation analysis, Formal Methods in System Design, vol.11, 1997. ,
Comparing the Galois connection and widening/narrowing approaches to abstract interpretation, PLILP 1992, pp.269-295, 1992. ,
DOI : 10.1007/3-540-55844-6_142
The octagon abstract domain, Higher-Order and Symbolic Computation, 2006. ,
Precise widening operators for convex polyhedra, In: Science of Computer Programming (SCP), vol.58, 2005. ,
Simple and Precise Widenings for H-Polyhedra, APLAS 2010, pp.139-155, 2010. ,
DOI : 10.1007/978-3-642-17164-2_11
Combining Widening and Acceleration in Linear Relation Analysis, SAS 2006, pp.144-160, 2006. ,
DOI : 10.1007/11823230_10
URL : https://hal.archives-ouvertes.fr/hal-00189614
Guided Static Analysis, SAS 2007, pp.349-365, 2007. ,
DOI : 10.1007/978-3-540-74061-2_22
Why does astrée scale up? Formal Methods in System Design, p.35, 2009. ,
Widening with Thresholds for Programs with Complex Control Graphs, 2011. ,
DOI : 10.1007/978-3-642-24372-1_38
URL : https://hal.archives-ouvertes.fr/inria-00606961
Efficient chaotic iteration strategies with widenings, FMP&TA 1993, pp.128-141, 1993. ,
DOI : 10.1007/BFb0039704
A heuristics for inferring thresholds ,
The bddapron logico-numerical abstract domains library ,
The ConcurInterproc interprocedural analyzer for concurrent programs ,
Combination of Abstractions in the ASTR??E Static Analyzer, ASIAN 2006, pp.272-300, 2008. ,
DOI : 10.1007/978-3-540-24725-8_2