A Modal Logic for Termgraph Rewriting - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2010

A Modal Logic for Termgraph Rewriting

Résumé

We propose a modal logic tailored to describe graph transformations and discuss some of its properties. We focus on a particular class of graphs called termgraphs. They are first-order terms augmented with sharing and cycles. Termgraphs allow one to describe classical data-structures (possibly with pointers) such as doubly-linked lists, circular lists etc. We show how the proposed logic can faithfully describe (i) termgraphs as well as (ii) the application of a termgraph rewrite rule (i.e. matching and replacement) and (iii) the computation of normal forms with respect to a given rewrite system. We also show how the proposed logic, which is more expressive than propositional dynamic logic, can be used to specify shapes of classical data-structures (e.g. binary trees, circular lists etc.).

Dates et versions

hal-00940869 , version 1 (03-02-2014)

Identifiants

Citer

Philippe Balbiani, Rachid Echahed, Andreas Herzig. A Modal Logic for Termgraph Rewriting. 2010. ⟨hal-00940869⟩
141 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More