Rewriting systems with data a framework for reasoning about systems with unbounded structures over infinite data domains

  • Authors:

  • Ahmed Bouajjani;Peter Habermehl1;Yan Jurski;Mihaela Sighireanu

  • Affiliations:

  • LIAFA, CNRS & U. Paris 7, Paris 05, France;LIAFA, CNRS & U. Paris 7, Paris 05 and LSV, CNRS & ENS Cachan, Cachan, France;LIAFA, CNRS & U. Paris 7, Paris 05, France;LIAFA, CNRS & U. Paris 7, Paris 05, France

  • Venue:
  • FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

We introduce a uniform framework for reasoning about infinite-state systems with unbounded control structures and unbounded data domains. Our framework is based on constrained rewriting systems on words over an infinite alphabet. We consider several rewriting semantics: factor, prefix, and multiset rewriting. Constraints are expressed in a logic on such words which is parametrized by a first-order theory on the considered data domain. We show that our framework is suitable for reasoning about various classes of systems such as recursive sequential programs, multithreaded programs, parametrized and dynamic networks of processes, etc. Then, we provide generic results (1) for the decidability of the satisfiability problem of the fragment ∃*∀* of this logic provided that the underlying logic on data is decidable, and (2) for proving inductive invariance and for carrying out Hoare style reasoning within this fragment. We also show that the reachability problem is decidable for a class of prefix rewriting systems with integer data.