Verification of gap-order constraint abstractions of counter systems

[1]  Frank Plumpton Ramsey,et al.  On a Problem of Formal Logic , 1930 .

[2]  Marvin Minsky,et al.  Computation : finite and infinite machines , 2016 .

[3]  Richard J. Lipton,et al.  Exponential space complete problems for Petri nets and commutative semigroups (Preliminary Report) , 1976, STOC '76.

[4]  Amir Pnueli,et al.  The temporal logic of programs , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[5]  Oscar H. Ibarra,et al.  Reversal-Bounded Multicounter Machines and Their Decision Problems , 1978, JACM.

[6]  Joseph Y. Halpern,et al.  "Sometimes" and "not never" revisited: on branching versus linear time (preliminary report) , 1983, POPL '83.

[7]  Joseph Y. Halpern,et al.  “Sometimes” and “not never” revisited: on branching versus linear time temporal logic , 1986, JACM.

[8]  R. Alur,et al.  Automata For Modeling Real-Time Systems , 1990, ICALP.

[9]  Thomas A. Henzinger,et al.  The benefits of relaxing punctuality , 1991, PODC '91.

[10]  Peter Z. Revesz,et al.  A Closed-Form Evaluation for Datalog Queries with Integer (Gap)-Order Constraints , 1993, Theor. Comput. Sci..

[11]  Pierre Wolper,et al.  Reasoning About Infinite Computations , 1994, Inf. Comput..

[12]  Karlis Cerans,et al.  Deciding Properties of Integral Relational Automata , 1994, ICALP.

[13]  A. Bouajjani,et al.  On the verification problem of nonregular properties for nonregular processes , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[14]  Laurent Fribourg,et al.  Symbolic Verification with Gap-Order Constraints , 1996, LOPSTR.

[15]  Neil D. Jones,et al.  Computability and complexity - from a programming perspective , 1997, Foundations of computing series.

[16]  Hubert Comon-Lundh,et al.  Multiple Counters Automata, Safety Analysis and Presburger Arithmetic , 1998, CAV.

[17]  Bernard Boigelot.  Symbolic Methods for Exploring Infinite State Spaces , 1998 .

[18]  Orna Kupferman,et al.  An automata-theoretic approach to modular model checking , 2000, TOPL.

[19]  Véronique Cortier,et al.  Flatness Is Not a Weakness , 2000, CSL.

[20]  Alain Finkel,et al.  How to Compose Presburger-Accelerations: Applications to Broadcast Protocols , 2002, FSTTCS.

[21]  Ahmed Bouajjani,et al.  Programs with Lists Are Counter Automata , 2006, CAV.

[22]  P. Abdulla,et al.  On the Coverability Problem for Constrained Multiset Rewriting , 2008 .

[23]  Laura Bozzelli,et al.  Branching-Time Temporal Logic Extended with Qualitative Presburger Constraints , 2006, LPAR.

[24]  Valentin Goranko,et al.  Towards a Model-Checker for Counter Systems , 2006, ATVA.

[25]  Deepak D'Souza,et al.  An automata-theoretic approach to constraint LTL , 2002, Inf. Comput..

[26]  Amir M. Ben-Amram.  Size-change termination with difference constraints , 2008, TOPL.

[27]  Stéphane Demri,et al.  Verification of qualitative Z constraints , 2008, Theor. Comput. Sci..

[28]  Elvira Albert,et al.  Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis , 2008, SAS.

[29]  Marius Bozga,et al.  Iterating Octagons , 2009, TACAS.

[30]  Parosh Aziz Abdulla,et al.  Approximated parameterized verification of infinite-state processes with global conditions , 2009, Formal Methods Syst. Des..

[31]  Amir M. Ben-Amram.  Size-Change Termination, Monotonicity Constraints and Ranking Functions , 2009, CAV.

[32]  Amir M. Ben-Amram.  Monotonicity Constraints for Termination in the Integer Domain , 2011, Log. Methods Comput. Sci..