Satisfiability of high-level conditions

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

Volumn 4178 LNCS, Issue , 2006, Pages 430-444

  Habel, Annegret ^a   Pennemann, Karl Heinz ^a  

^a UNIVERSITY OF OLDENBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; DATA STRUCTURES; MATHEMATICAL MODELS; PATTERN MATCHING; PETRI NETS; SET THEORY;

HIGH-LEVEL CONDITIONS; MORPHISMS; RULE MATCHING;

LOGIC PROGRAMMING;

EID: 33750275273     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11841883_30     Document Type: Conference Paper

References (13)

1. A. Corradini, 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 Handbook of Graph Grammars and Computing by Graph Transformation, volume 1, pages 163-245. World Scientific, 1997.
2. H. Ehrig. Introduction to the algebraic theory of graph grammars. In Graph-Grammars and Their Application to Computer Science and Biology, volume 73 of Lecture Notes in Computer Science, pages 1-69. Springer-Verlag, 1979.
3. H. Ehrig, K. Ehrig, A. Habel, and K.-H. Pennemann. Theory of constraints and application conditions: From graphs to high-level structures. Fundamenta Informaticae, 72, 2006.
4. H. Ehrig, K. Ehrig, U. Prange, and G. Taentzer. Fundamentals of Algebraic Graph Transformation. EATCS Monographs of Theoretical Computer Science. Springer-Verlag, Berlin, 2006.
5. H. Ehrig, A. Habel, H.-J. Kreowski, and F. Parisi-Presicce. Parallelism and concurrency in high level replacement systems. Mathematical Structures in Computer Science, 1:361-404, 1991.
6. H. Ehrig, A. Habel, J. Padberg, and U. Prange. Adhesive high-level replacement systems: A new categorical framework for graph transformation. Fundamenta Informaticae, 72, 2006.
7. A. Habel, J. Müller, and D. Plump. Double-pushout graph transformation revisited. Mathematical Structures in Computer Science, 11(5):637-688, 2001.
8. A. Habel and K.-H. Pennemann. Nested constraints and application conditions for high-level structures. In Formal Methods in Software and System Modeling, volume 3393 of Lecture Notes in Computer Science, pages 293-308. Springer-Verlag, 2005.
9. A. Habel, K.-H. Pennemann, and A. Rensink. Weakest preconditions for high-level programs. In Proc. Int. Conference on Graph Transformation (ICGT 2006), this volume of Lecture Notes in Computer Science. Springer-Verlag, 2006.
10. R. Heckel and A. Wagner. Ensuring consistency of conditional graph grammars - a constructive approach. In SEGRAGRA '95, volume 2 of Electronic Notes in Theoretical Computer Science, pages 95-104, 1995.
11. M. Koch, L. V. Mancini, and F. Parisi-Presicce. Graph-based specification of access control policies. Journal of Computer and System Sciences, 71:1-33, 2005.
12. S. Lack and P. Sobociński. Adhesive categories. In Proc. of Foundations of Software Science and Computation Structures (FOSSACS'04), volume 2987 of Lecture Notes in Computer Science, pages 273-288. Springer-Verlag, 2004.
13. A. Rensink. Representing first-order logic by graphs. In Graph Transformations (ICGT'04), volume 3256 of Lecture Notes in Computer Science, pages 319-335. Springer-Verlag, 2004.