Parameterized Verification with Automatically Computed Inductive Assertions?, Proc. of CAV'01, 2001. ,
DOI : 10.1007/3-540-44585-4_19
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.23.7408
A Generic Framework for Reasoning About Dynamic Networks of Infinite-State Processes, Proc. of TACAS'07, 2007. ,
URL : https://hal.archives-ouvertes.fr/hal-00129014
Flat Parametric Counter Automata, Proc. of ICALP'06, 2006. ,
DOI : 10.1007/11787006_49
URL : https://hal.archives-ouvertes.fr/hal-00361293
What???s Decidable About Arrays?, Proc. of VMCAI'06, 2006. ,
DOI : 10.1007/11609773_28
Multiple counters automata, safety analysis and presburger arithmetic, Proc. of CAV'98, 1998. ,
DOI : 10.1007/BFb0028751
Decision procedures for extensions of the theory of arrays, Annals of Mathematics and Artificial Intelligence, vol.27, issue.1, 2007. ,
DOI : 10.1007/s10472-007-9078-x
URL : https://hal.archives-ouvertes.fr/inria-00576588
A Logic of Singly Indexed Arrays, 2008. ,
DOI : 10.1007/978-3-540-89439-1_39
URL : https://hal.archives-ouvertes.fr/hal-01418915
What Else Is Decidable about Integer Arrays?, Proc. of FOSSACS'08, 2008. ,
DOI : 10.1007/978-3-540-78499-9_33
URL : https://hal.archives-ouvertes.fr/hal-01418914
Presburger arithmetic with array segments, Information Processing Letters, vol.12, issue.2, 1981. ,
DOI : 10.1016/0020-0190(81)90007-7
A Program Verifier, 1969. ,
A Decision Procedure for the Correctness of a Class of Programs, Journal of the ACM, vol.28, issue.2, 1980. ,
DOI : 10.1145/322248.322250
Enumerable Sets are Diophantine, Journal of Sovietic Mathematics, vol.11, pp.354-358, 1970. ,
Towards a Mathematical Science of Computation, IFIP Congress, 1962. ,
DOI : 10.1007/978-94-011-1793-7_2
A decision procedure for an extensional theory of arrays, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science, 2001. ,
DOI : 10.1109/LICS.2001.932480
Verification Decidability of Presburger Array Programs, Journal of the ACM, vol.27, issue.1, 1980. ,
DOI : 10.1145/322169.322185