A Modal Logic for Termgraph Rewriting

Details A Modal Logic for Termgraph Rewriting A Modal Logic for Termgraph Rewriting

2010-03-23

arxiv.org/abs/1003.4369v1

Computer Science

Logic in Computer Science

Scientific paper

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.).

Affiliated with

Also associated with

No associations

Rating

A Modal Logic for Termgraph Rewriting does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Modal Logic for Termgraph Rewriting, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Modal Logic for Termgraph Rewriting will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-211193