Data-Structure Rewriting

Details Data-Structure Rewriting Data-Structure Rewriting

2005-03-24

arxiv.org/abs/cs/0503065v1

Computer Science

Programming Languages

Scientific paper

We tackle the problem of data-structure rewriting including pointer redirections. We propose two basic rewrite steps: (i) Local Redirection and Replacement steps the aim of which is redirecting specific pointers determined by means of a pattern, as well as adding new information to an existing data ; and (ii) Global Redirection steps which are aimed to redirect all pointers targeting a node towards another one. We define these two rewriting steps following the double pushout approach. We define first the category of graphs we consider and then define rewrite rules as pairs of graph homomorphisms of the form "L <- K ->R". Unfortunately, inverse pushouts (complement pushouts) are not unique in our setting and pushouts do not always exist. Therefore, we define rewriting steps so that a rewrite rule can always be performed once a matching is found.

Affiliated with

Also associated with

No associations

Rating

Data-Structure 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 Data-Structure Rewriting, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Data-Structure Rewriting will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-586703