Specifying pointer structures by graph reduction

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3062, Issue , 2004, Pages 30-44

  Bakewell, Adam ^a   Plump, Detlef ^a   Runciman, Colin ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

SPECIFICATIONS;

BALANCED TREES; CLOSURE PROPERTY; EMPTY GRAPH; GRAPH LANGUAGES; GRAPH REDUCTION; POINTER STRUCTURES; PRACTICAL INVESTIGATIONS; RED BLACK TREE;

COMPUTATIONAL LINGUISTICS;

EID: 35048830160     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-25959-6_3     Document Type: Article

References (18)

1. Safe Pointers by Graph Transformation, project webpage. http://www-users.cs.york.ac.uk/~ajb/spgt/.
2. A Bakewell, D Plump, and C Runciman. Specifying pointer structures by graph reduction. Technical Report YCS-2003-367, Department of Computer Science, University of York, 2003. Available from [1].
3. A Bakewell, D Plump, and C Runciman. Checking the shape safety of pointer manipulations. In Proc. 7th International Seminar on Relational Methods in Computer Science (RelMiCS 7), LNCS. Springer-Verlag, 2004.
4. R Bardohl, M Minas, A Schürr, and G Taentzer. Handbook of Graph Grammars and Computing by Graph Transformation, volume 2, chapter Application of Graph Transformation to Visual Languages, pages 105-180. World Scientific, 1999.
5. M Benedikt, T Reps, and M Sagiv. A decidable logic for describing linked data structures. In Proc. European Symposium on Programming Languages and Systems (ESOP '99), volume 1576 of LNCS, pages 2-19. Springer-Verlag, 1999.
6. T H Cormen, C E Leiserson, and R L Rivest. Introduction to algorithms. MIT Press, 1990.
7. F Drewes, B Hoffmann, and M Minas. Context-exploiting shapes for diagram transformation. Machine Graphics and Vision, 12(1):117-132, 2003.
8. P Fradet and D Le Métayer. Shape types. In Proc. Principles of Programming Languages (POPL '97), pages 27-39. ACM Press, 1997.
9. P Fradet and D Le Métayer. Structured Gamma. Science of Computer Programming, 31(2-3):263-289, 1998.
10. A Habel, J Müller, and D Plump. Double-pushout graph transformation revisited. Math. Struct. in Comp. Science, 11:637-688, 2001.
11. A Habel and D Plump. Relabelling in graph transformation. In Proc. International Conference on Graph Transformation (ICGT 2002), volume 2505 of LNCS, pages 135-147. Springer-Verlag, 2002.
12. L J Hendren, J Hummel, and A Nicolau. Abstractions for recursive pointer data structures: Improving the analysis and transformation of imperative programs. In Proc. ACM SIGPLAN '92 Conference on Programming Langauge Design and Implementation (PLDI '92), pages 249-260. ACM Press, 1992.
13. R Hinze. Functional Pearl: Perfect trees and bit-reversal permutations. Journal of Functional Programming, 10(3):305-317, May 2000.
14. N Klarlund and M I Schwartzbach. Graph types. In Proc. Principles of Programming Languages (POPL '93), pages 196-205. ACM Press, 1993.
15. V Kuncak, P Lam, and M Rinard. Role analysis. In Proc. Principles of Programming Languages (POPL '02), pages 17-32. ACM Press, 2002.
16. A Møller and M I Schwartzbach. The pointer assertion logic engine. In Proc. ACM SIGPLAN '01 Conference on Programming Langauge Design and Implementation (PLDI '01). ACM Press, 2001.
17. D Plump. Hypergraph rewriting: Critical pairs and undecidability of confluence. In M R Sleep, M J Plasmeijer, and M C van Eekelen, editors, Term Graph Rewriting: Theory and Practice, chapter 15, pages 201-213. John Wiley & Sons Ltd, 1993.
18. T Uesu. A system of graph grammars which generates all recursively enumerable sets of labelled graphs. Tsukuba J. Math., 2:11-26, 1978.