Using Forward Reachability Analysis for Verification of Lossy Channel Systems, Formal Methods in System Design, vol.25, issue.1, pp.39-65, 2004. ,
DOI : 10.1023/B:FORM.0000033962.51898.1a
FAST: Fast Acceleration of Symbolic Transition Systems, Computer-Aided Verification (CAV), pp.118-121, 2003. ,
DOI : 10.1007/978-3-540-45069-6_12
URL : https://hal.archives-ouvertes.fr/hal-00084185
Flat Acceleration in Symbolic Model Checking, ATVA), pp.474-488, 2005. ,
DOI : 10.1007/11562948_35
URL : https://hal.archives-ouvertes.fr/hal-00346302
Symbolic verification of communication protocols with infinite state spaces using QDDs, Formal Methods in System Design, vol.14, pp.237-255, 1997. ,
DOI : 10.1007/3-540-61474-5_53
LUSTRE: a declarative language for realtime programming, Principles of Programming Languages (POPL), pp.178-188, 1987. ,
Abstract interpretation, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '77, pp.238-252, 1977. ,
DOI : 10.1145/512950.512973
URL : https://hal.archives-ouvertes.fr/inria-00528590
Abstract interpretation and application to logic programs, The Journal of Logic Programming, vol.13, issue.2-3, pp.103-179, 1992. ,
DOI : 10.1016/0743-1066(92)90030-7
URL : http://doi.org/10.1016/0743-1066(92)90030-7
Comparing the Galois connection and widening/narrowing approaches to abstract interpretation, PLILP'92, pp.269-295, 1992. ,
DOI : 10.1007/3-540-55844-6_142
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-97, 1978. ,
DOI : 10.1145/512760.512770
Computational Geometry: Algorithms and Applications, 2008. ,
How to Compose Presburger-Accelerations: Applications to Broadcast Protocols, Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pp.145-156, 2002. ,
DOI : 10.1007/3-540-36206-1_14
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.9119
Proving safety properties of infinite state systems by compilation into Presburger arithmetic, Conference on Concurrency Theory (CONCUR), pp.213-227, 1997. ,
DOI : 10.1007/3-540-63141-0_15
The ASPIC tool: Accelerated Symbolic Polyhedral Invariant Computation ,
Accélération abstraite pour l'amélioration de la précision en Analyse des Relations Linéaires, Thèse de doctorat, 2007. ,
Combining Widening and Acceleration in Linear Relation Analysis, Static Analysis Symposium (SAS), pp.144-160, 2006. ,
DOI : 10.1007/11823230_10
URL : https://hal.archives-ouvertes.fr/hal-00189614
Synchronous Observers and the Verification of Reactive Systems, Methodology and Software Technology (AMAST), pp.83-96, 1993. ,
DOI : 10.1007/978-1-4471-3227-1_8
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
Dynamic partitioning in linear relation analysis. application to the verification of reactive systems, Formal Methods in System Design, vol.23, issue.1, pp.5-37, 2003. ,
DOI : 10.1023/A:1024480913162
Symbolic Test Selection Based on Approximate Analysis, Tools and Algorithms for the Construction and Analysis of Systems (TACAS), pp.349-364, 2005. ,
DOI : 10.1007/978-3-540-31980-1_23
URL : https://hal.archives-ouvertes.fr/inria-00564617
Partial Evaluation and Automatic Program Generation, 1993. ,
Algorithmique de la vérification des systèmessystèmesà compteurs ? Approximation et accélération ? Implémentation dans l'outil FAST, Thèse de doctorat, 2003. ,