Correctness of high-level transformation systems relative to nested conditions

Mathematical Structures in Computer Science

Volumn 19, Issue 2, 2009, Pages 245-296

  Habel, Annegret ^a   Pennemann, Karl Heinz ^a  

^a Faculty of Computer Science   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AS GRAPH; FIRST-ORDER GRAPHS; GRAPHICAL REPRESENTATIONS; HIGH-LEVEL TRANSFORMATIONS; NESTED GRAPHS; RULE APPLICATION; SATISFIABILITY; STRONGEST POSTCONDITIONS; TRANSFORMATION SYSTEMS; WEAKEST PRECONDITION;

GRAPHIC METHODS;

EID: 69749116786     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129508007202     Document Type: Article

References (35)

1. Adamek, J., Herrlich, H. and Strecker, G. (1990) Abstract and Concrete Categories, John Wiley.
2. Azab, K. and Habel, A. (2008) High-level programs and program conditions. In: Graph Transformations (ICGT 2008). To appear in Springer-Verlag Lecture Notes in Computer Science.
3. Azab, K., Habel, A., Pennemann, K.-H. and Zuckschwerdt, C. (2006) ENFORCe: A system for ensuring formal correctness of high-level programs. In: Proc. 3rd. Int. Workshop on Graph Based Tools (GraBaTs'06). Electronic Communications of the EASST 1.
4. Corradini, A., Montanari, U., Rossi, F., Ehrig, H., Heckel, R. and Lowe, M. (1997) Algebraic approaches to graph transformation. Part I: Basic concepts and double pushout approach. In: Handbook of Graph Grammars and Computing by Graph Transformation, volume 1, World Scientific 163-245.
5. Courcelle, B. (1990) Graph rewriting: An algebraic and logical approach. In Handbook of Theoretical Computer Science, volume B, Elsevier 193-242.
6. Courcelle, B. (1997) The expression of graph properties and graph transformations in monadic second-order logic. In: Handbook of Graph Grammars and Computing by Graph Transformation, volume 1, World Scientific 313-400.
7. Dijkstra, E. W. (1975) A Discipline of Programming, Prentice-Hall.
8. Dijkstra, E. W. and Scholten, C. S. (1989) Predicate Calculus and Program Semantics, Springer-Verlag.
9. Ehrig, H. (1979) Introduction to the algebraic theory of graph grammars. In: Graph-Grammars and Their Application to Computer Science and Biology. Springer-Verlag Lecture Notes in Computer Science 73 1-69.
10. Ehrig, H., Ehrig, K., Habel, A. and Pennemann, K.-H. (2006) Theory of constraints and application conditions: From graphs to high-level structures. Fundamenta Informaticae 74 (1) 135-166.
11. Ehrig, H., Ehrig, K., Prange, U. and Taentzer, G. (2006) Fundamentals of Algebraic Graph Transformation, EATCS Monographs of Theoretical Computer Science, Springer-Verlag.
12. Ehrig, H. and Habel, A. (1986) Graph grammars with application conditions. In: Rozenberg, G. and Salomaa, A. (eds.) The Book of L, Springer-Verlag 87-100.
13. Ehrig, H., Habel, A., Kreowski, H.-J. and Parisi-Presicce, F. (1991) Parallelism and concurrency in high level replacement systems. Mathematical Structures in Computer Science 1 361-404.
14. Ehrig, H., Habel, A., Padberg, J. and Prange, U. (2006) Adhesive high-level replacement systems: A new categorical framework for graph transformation. Fundamenta Informaticae 74 1-29.
15. Ehrig, H., Heckel, R., Korff, M., Lowe, M., Ribeiro, L., Wagner, A. and Corradini, A. (1997) Algebraic approaches to graph transformation. Part II: Single-pushout approach and comparison with double pushout approach. In: Handbook of Graph Grammars and Computing by Graph Transformation, volume 1, World Scientific 247-312.
16. European Telecommunications Standards Institute (1998) Digital cellular telecommunications system (Phase 2+); Handover procedures. Technical Specification, ETSI TS 100 527 V7.0.0 1999-2008 (GSM 03.09 version 7.0.0 Release 1998).
17. Habel, A., Heckel, R. and Taentzer, G. (1996) Graph grammars with negative application conditions. Fundamenta Informaticae 26 287-313.
18. Habel, A., Muller,̈ J. and Plump, D. (2001) Double-pushout graph transformation revisited. Mathematical Structures in Computer Science 11 (5) 637-688.
19. Habel, A. and Pennemann, K.-H. (2005) Nested constraints and application conditions for high-level structures. In: Formal Methods in Software and System Modeling. Springer-Verlag Lecture Notes in Computer Science 3393 293-308.
20. Habel, A. and Pennemann, K.-H. (2006) Satisfiability of high-level conditions. In: Graph Transformations (ICGT 2006). Springer-Verlag Lecture Notes in Computer Science 4178 430-444.
21. Habel, A., Pennemann, K.-H. and Rensink, A. (2006) Weakest preconditions for high-level programs. In: Graph Transformations (ICGT 2006). Springer-Verlag Lecture Notes in Computer Science 4178 445-460.
22. Heckel, R. and Wagner, A. (1995) Ensuring consistency of conditional graph grammars - a constructive approach. In: Proc. Workshop on Graph Rewriting and Computation (SEGRAGRA'95). Electronic Notes in Theoretical Computer Science 2 95-104. .
23. Koch, M., Mancini, L. V. and Parisi-Presicce, F. (2005) Graph-based specification of access control policies. Journal of Computer and System Sciences 71 1-33.
24. Koch, M. and Parisi-Presicce, F. (2002) Describing policies with graph constraints and rules. In: Graph Transformation (ICGT 2002). Springer-Verlag Lecture Notes in Computer Science 2505 223-238.
25. Lack, S. and Sobocinski, P. (2004) Adhesive categories. In: Proc. of Foundations of Software Science and Computation Structures (FOSSACS'04) Springer-Verlag Lecture Notes in Computer Science 2987 273-288.
26. Löwe, M. (1993) Algebraic approach to single-pushout graph transformation. Theoretical Computer Science 109 181-224.
27. Orejas, F. (2008) Attributed graph constraints(FASE'08). In: Graph Transformations (FASE'08) To appear in Springer-Verlag Lecture Notes in Computer Science.
28. Orejas, F., Ehrig, H. and Prange, U. (2008) A logic of graph constraints. In: Proc. Fundamental Approaches to Software Engineering (FASE'08) Springer-Verlag Lecture Notes in Computer Science 4961 179-219
29. Pennemann, K.-H. (2008a) An algorithm for approximating the satisfiability problem of high-level conditions. In: Proc. Graph Transformation for Verification and Concurrency (GT- Electronic Notes in Theoretical Computer Science 213 75-94.
30. Pennemann, K.-H. (2008b) Resolution-like theorem proving for high-level conditions. In: Graph Transformations (ICGT'08). Springer-Verlag Lecture Notes in Computer Science .
31. Plump, D. and Steinert, S. (2004) Towards graph programs for graph algorithms. In: Graph Transformations (ICGT'04). Springer-Verlag Lecture Notes in Computer Science 3256 128-143.
32. Rensink, A. (2004) Representing first-order logic by graphs. In: Graph Transformations Springer-Verlag Lecture Notes in Computer Science 3256 319-335.
33. Trakhtenbrot, B. A. (1950) The impossibility of an algorithm for the decision problem on finite classes (in Russian). Doklady Akademii Nauk SSSR 70 569-572.
34. English translation in: Nine Papers on Logic and Quantum Electrodynamics (1963) AMS Transl. Ser. 2 23 1-5.
35. Zuckschwerdt, C. (2006) Ein System zur Transformation von Konsistenz in Anwendungsbedingun-gen (in German). Berichte aus dem Department fur Informatik, Universit at Oldenburg 11/06, 114 pages.