Push-Down Automata with Gap-Order Constraints

We consider push-down automata with data (Pdad) that operate on variables ranging over the set of natural numbers. The conditions on variables are defined via gap-order constraint. Gap-order constraints allow to compare variables for equality, or to check that the gap between the values of two variables exceeds a given natural number. The messages inside the stack are equipped with values that are natural numbers reflecting their “values”. When a message is pushed to the stack, its value may be defined by a variable in the program. When a message is popped, its value may be copied to a variable. Thus, we obtain a system that is infinite in two dimensions, namely we have a stack that may contain an unbounded number of messages each of which is equipped with a natural number. We present an algorithm for solving the control state reachability problem for Pdad based on two steps. We first provide a translation to the corresponding problem for context-free grammars with data (Cfgd). Then, we use ideas from the framework of well quasi-orderings in order to obtain an algorithm for solving the reachability problem for Cfgds.

[1]  Mihalis Yannakakis,et al.  Graph-theoretic methods in database theory , 1990, PODS.

[2]  Giorgio Delzanno,et al.  Constraint-Based Analysis of Broadcast Protocols , 1999, CSL.

[3]  Javier Esparza,et al.  A BDD-Based Model Checker for Recursive Programs , 2001, CAV.

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

[5]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[6]  Kousha Etessami,et al.  Algorithmic Verification of Recursive Probabilistic State Machines , 2005, TACAS.

[7]  Parosh Aziz Abdulla,et al.  Well (and Better) Quasi-Ordered Transition Systems , 2010, The Bulletin of Symbolic Logic.

[8]  Stefan Schwoon,et al.  Model checking pushdown systems , 2002 .

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

[10]  Parosh Aziz Abdulla,et al.  Dense-Timed Pushdown Automata , 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

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

[12]  Giorgio Delzanno,et al.  Constraint-Based Verification of Parameterized Cache Coherence Protocols , 2003, Formal Methods Syst. Des..

[13]  Alberto Marcone,et al.  Foundations of BQO theory , 1994 .

[14]  Giorgio Delzanno,et al.  Constraint-Based Verification of Client-Server Protocols , 2001, CP.

[15]  Thomas Schwentick,et al.  On the Complexity of Equational Horn Clauses , 2005, CADE.

[16]  Jurriaan Rot,et al.  Pushdown System Representation for Unbounded Object Creation , 2010 .

[17]  Parosh Aziz Abdulla,et al.  A classification of the expressive power of well-structured transition systems , 2011, Inf. Comput..

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

[19]  Giorgio Delzanno.  Automatic Verification of Parameterized Cache Coherence Protocols , 2000, CAV.

[20]  Giorgio Delzanno,et al.  Model Checking in CLP , 1999, TACAS.

[21]  Parosh Aziz Abdulla,et al.  General decidability theorems for infinite-state systems , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[22]  Thomas W. Reps,et al.  Program analysis via graph reachability , 1997, Inf. Softw. Technol..

[23]  Parosh Aziz Abdulla,et al.  Timed Lossy Channel Systems , 2012, FSTTCS.

[24]  Javier Esparza,et al.  Reachability Analysis of Pushdown Automata: Application to Model-Checking , 1997, CONCUR.

[25]  Giorgio Delzanno,et al.  Automatic Verification of Time Sensitive Cryptographic Protocols , 2004, TACAS.

[26]  Mohamed Faouzi Atig,et al.  Approximating Petri Net Reachability Along Context-free Traces , 2011, FSTTCS.

[27]  Giorgio Delzanno,et al.  A lightweight regular model checking approach for parameterized systems , 2012, International Journal on Software Tools for Technology Transfer.

[28]  Sophie Pinchinat,et al.  Verification of gap-order constraint abstractions of counter systems , 2014, Theor. Comput. Sci..

[29]  Javier Esparza,et al.  Efficient Algorithms for Model Checking Pushdown Systems , 2000, CAV.

[30]  Parosh Aziz Abdulla,et al.  The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems , 2012, LATA.

[31]  Sophie Pinchinat,et al.  Verification of gap-order constraint abstractions of counter systems , 2012, Theor. Comput. Sci..

[32]  P.A. Abdulla,et al.  Better is better than well: on efficient verification of infinite-state systems , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).

[33]  Parosh Aziz Abdulla,et al.  Parameterized Verification of Infinite-State Processes with Global Conditions , 2007, CAV.

[34]  Somesh Jha,et al.  Weighted pushdown systems and their application to interprocedural dataflow analysis , 2005, Sci. Comput. Program..

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

[36]  J. Esparza,et al.  Model checking probabilistic pushdown automata , 2004, LICS 2004.