Abstract Graph Transformation

Electronic Notes in Theoretical Computer Science

Volumn 157, Issue 1 SPEC. ISS., 2006, Pages 39-59

  Rensink, Arend ^a   Distefano, Dino ^b  

^a UNIVERSITY OF TWENTE   (Netherlands)

^b QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Abstract Interpretation; Graph Transformation; Model Checking; Verification

Indexed keywords

ABSTRACTING; COMPUTATIONAL COMPLEXITY; COMPUTER SOFTWARE; LOGIC PROGRAMMING; SEMANTICS; SYNTACTICS;

ABSTRACT INTERPRETATION; GRAPH TRANSFORMATION; MODEL CHECKING; VERIFICATION;

GRAPH THEORY;

EID: 33646361554     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2006.01.022     Document Type: Article

References (25)

1. Baldan P., König B., and König B. A logic for analyzing abstractions of graph transformation systems. In: Cousot R. (Ed). Static Analysis. LNCS 2694 (2003) 255-272
2. Corradini, A., F.L. Dotti, L. Foss and L. Ribeiro, Translating java into graph transformation systems, in: Ehrig et al. [10], pp. 383-389
3. Corradini, A., U. Montanari, F. Rossi, H. Ehrig, R. Heckel and M. Löwe, Algebraic approaches to graph transformation, part I: Basic concepts and double pushout approach, in: Rozenberg [23] pp. 163-246
4. Cousot, P. and R. Cousot, Systematic design of program analysis frameworks, in Conference Record of the Sixth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (1979), pp. 269-282
5. Cousot P., and Cousot R. Refining model checking by abstract interpretation. Automated Software Engineering 6 (1999) 69-95
6. Depke R., Heckel R., and Küster J.M. Formal agent-oriented modeling with UML and graph transformation. Science of Computer Programming 44 (2002) 229-252
7. Distefano D., Katoen J.-P., and Rensink A. Who is pointing when to whom? On the automated verification of linked list structures. The 24th Conference on Foundations of Software Technology and Theoretical Computer Science. (FSTTCS). LNCS 3328 (2004) 250-262
8. Distefano D., Rensink A., and Katoen J.-P. Model checking birth and death. In: Baeza-Yates R.A., Montanari U., and Santoro N. (Eds). Foundations of Information Technology in the Era of Network and Mobile Computing. IFIP Conference Proceedings 223 (2002) 435-447
9. Dotti F.L., Foss L., Ribeiro L., and dos Santos O.M. Verification of distributed object-based systems. In: Najm E., Nestmann U., and Stevens P. (Eds). Formal Methods for Open Object-based Distributed Systems. LNCS 2884 (2003) 261-275
10. In: Ehrig H., Engels G., Parisi-Presicce F., and Rozenberg G. (Eds). International Conference on Graph Transformations. (ICGT). LNCS 3256 (2004), Springer
11. Habel A., Heckel R., and Taentzer G. Graph grammars with negative application conditions. Fundamenta Informaticae 26 (1996) 287-313
12. Jeannet B., Loginov A., Reps T.W., and Sagiv S. A relational approach to interprocedural shape analysis. In: Giacobazzi R. (Ed). Static Analysis: 11th International Symposium. (SAS). LNCS 3148 (2004) 246-264
13. Kuska S., Gogolla M., Kollmann R., and Kreowski H.-J. An integrated semantics for UML class, object and state diagrams based on graph transformation. In: Butler M., Petre L., and Sere K. (Eds). IFM 2002. LNCS 2235 (2002) 11-28
14. O'Hearn P., Reynolds J., and Yang H. Local reasoning about programs that alter data structures. In: Fribourg L. (Ed). CSL 2001. LNCS 2142 (2001) 1-19
15. Pollet I., Charlier B.L., and Cortesi A. Distinctness and sharing domains for static analysis of java programs. In: Knudsen J.L. (Ed). ECOOP 2001 - Object-Oriented Programming, 15th European Conference, Budapest, Hungary, June 18-22, 2001, Proceedings. LNCS 2072 (2001) 77-98
16. Rensink A. Canonical graph shapes. In: Schmidt D.A. (Ed). Programming Languages and Systems - European Symposium on Programming. (ESOP). LNCS 2986 (2004) 401-415
17. Rensink A. The GROOVE simulator: A tool for state space generation. In: Pfalz J., Nagl M., and Böhlen B. (Eds). Applications of Graph Transformations with Industrial Relevance. (AGTIVE). LNCS 3063 (2004) 479-485
18. Rensink, A., State space abstraction using shape graphs, in: ETAPS 2004 Workshop on Automatic Verification of Infinite-State Systems (AVIS), 2004, see http://www.cs.utwente.nl/~rensink/papers/avis2004.pdf (unpublished proceedings)
19. Rensink, A. and D. Distefano, Abstract graph transformation, CTIT Technical Report TR-CTIT-05-04, Department of Computer Science, University of Twente (2005)
20. Rensink, A., Á. Schmidt and D. Varró, Model checking graph transformations: A comparison of two approaches, in: Ehrig et al. [10], pp. 226-241
21. Reynolds J. Separation logic: A logic for shared mutable data structures. Seventeenth Annual IEEE Symposium on Logic in Computer Science (2002), IEEE
22. Rinetzky, N., J. Bauer, T.W. Reps, S. Sagiv and R. Wilhelm, A semantics for procedure local heaps and its abstractions., in: J. Palsberg and M. Abadi, editors, Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) (2005), pp. 296-309
23. In: Rozenberg G. (Ed). Handbook of Graph Grammars and Computing by Graph Transformation (1997), World Scientific, Singapore
24. Sagiv M., Reps T., and Wilhelm R. Solving shape-analysis problems in languages with destructive updating. ACM Transactions on Programming Languages and Systems 20 (1998) 1-50
25. Sagiv M., Reps T., and Wilhelm R. Parametric shape analysis via 3-valued logic. ACM Transactions on Programming Languages and Systems 24 (2002) 217-298