The SLAM Toolkit, Proc. of CAV'01, 2001. ,
DOI : 10.1007/3-540-44585-4_25
Variance Analyses from Invariance Analyses, Proc. of POPL'07, 2007. ,
DOI : 10.1145/1190215.1190249
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.131.3856
Programs with Lists are Counter Automata, Proc. of CAV'06, 2006. ,
DOI : 10.1007/s10703-011-0111-7
URL : https://hal.archives-ouvertes.fr/hal-00722398
Abstract Regular Tree Model Checking, ENTCS, vol.149, pp.37-48, 2006. ,
DOI : 10.1016/j.entcs.2005.11.015
URL : https://hal.archives-ouvertes.fr/hal-00156828
Abstract Regular Tree Model Checking of Complex Dynamic Data Structures, Proc. of SAS'06, 2006. ,
DOI : 10.1007/11823230_5
URL : https://hal.archives-ouvertes.fr/hal-00150139
Flat Parametric Counter Automata, Proc. of ICALP'06, 2006. ,
DOI : 10.1007/11787006_49
URL : https://hal.archives-ouvertes.fr/hal-00361293
The Polyranking Principle, Proc. of ICALP'05, 2005. ,
DOI : 10.1007/11523468_109
Ef?cient Veri?cation of Sequential and Concurrent C Programs. Formal Methods in System Design, pp.2-3129, 2004. ,
DOI : 10.1023/b:form.0000040026.56959.91
Counterexample-Guided Abstraction Re?nement, Proc. of CAV'00, LNCS 1855, 2000. ,
DOI : 10.1109/time.2003.1214874
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.407
Multiple counters automata, safety analysis and presburger arithmetic, Proc. of CAV'98, 1998. ,
DOI : 10.1007/BFb0028751
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.6334
Abstraction Re?nement for Termination, Proc. of SAS'05, 2005. ,
DOI : 10.1007/11547662_8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.220.9226
Termination Proofs for Systems Code, Proc. of PLDI'06, 2006. ,
DOI : 10.1145/1133255.1134029
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.166.164
Terminator: Beyond Safety, Proc. of CAV'06, 2006. ,
DOI : 10.1007/11817963_37
Introduction to Algorithms, 1990. ,
Automatic Veri?cation of Parameterized Data Structures, Proc. of TACAS'06, 2006. ,
DOI : 10.1007/11691372_2
Automatic Termination Proofs for Programs with Shape-shifting Heaps, Proc. of CAV'06, 2006. ,
Proving Termination of Tree Manipulating Programs. Verimag, TR ,
URL : https://hal.archives-ouvertes.fr/hal-01418916
Software Veri?cation with Blast, Proc. of 10th SPIN Workshop, LNCS 2648, 2003. ,
DOI : 10.1007/3-540-44829-2_17
Automated Veri?cation of the Deutsch-Schorr-Waite Tree-Traversal Algorithm, Proc. of SAS'06, 2006. ,
The Pointer Assertion Logic Engine, Proc. of PLDI'01, 2001. ,
Separation logic: a logic for shared mutable data structures, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science, 2002. ,
DOI : 10.1109/LICS.2002.1029817
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.5322
The ARMC tool ,
Parametric Shape Analysis via 3-valued Logic, TOPLAS, vol.24, issue.3, 2002. ,
DOI : 10.1145/514188.514190
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.3161
Verifying Temporal Heap Properties Speci?ed via Evolution Logic, Proc. of ESOP'03, LNCS 2618, 2003. ,
DOI : 10.1093/jigpal/jzl009
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.8307