Skip to main content
SpringerLink
Log in

Nested Quantification in Graph Transformation Rules

  • Conference paper
Graph Transformations (ICGT 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4178))

Included in the following conference series:

Abstract

In this paper we describe a way to integrate Taentzer’s rule amalgamation with the recently proposed notions of nested graph conditions. The resulting so-called quantified graph transformation rules include (universally and existentially) quantified sub-structures in a flexible way. This can be used for instance to specify a larger-step operational semantics, thus improving the scalability of graph transformation as a technique for software verification.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bottoni, P., Parisi-Presicce, F., Taentzer, G.: Specifying integrated refactoring with distributed graph transformations. In: Pfaltz, J.L., Nagl, M., Böhlen, B. (eds.) AGTIVE 2003. LNCS, vol. 3062, pp. 220–235. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  2. de Lara, J., Ermel, C., Taentzer, G., Ehrig, K.: Parallel graph transformation for model simulation applied to timed transition petri nets. In: Graph Transformation and Visual Modelling Techniques (GTVMT). ENTCS, vol. 109, pp. 17–29 (2004)

    Google Scholar 

  3. Ermel, C., Taentzer, G., Bardohl, R.: Simulating algebraic high-level nets by parallel attributed graph transformation. In: Kreowski, et al. [14], pp. 64–83

    Google Scholar 

  4. FuJaBa tool suite: From UML to Java and back again (2005), http://www.cs.uni-paderborn.de/cs/fujaba/downloads

  5. Glabbeek, R.V., Plotkin, G.: Configuration structures. In: Tenth Annual Symposium on Logic in Computer Science, pp. 199–209. IEEE Computer Society, Los Alamitos (1995)

    Chapter  Google Scholar 

  6. The graph rewrite and transformation (GReAT) tool suite (2006), http://escher.isis.vanderbilt.edu/tools/get_tool?GReAT

  7. Graphs for object-oriented verification (GROOVE) (2006), http://groove.sf.net

  8. Habel, A., Heckel, R., Taentzer, G.: Graph grammars with negative application conditions. Fundamenta Informaticae 26(3/4), 287–313 (1996)

    MATH  MathSciNet  Google Scholar 

  9. Habel, A., Pennemann, K.-H.: Nested constraints and application conditions for high-level structures. In: Kreowski, et al. [14], pp. 293–308

    Google Scholar 

  10. Hausmann, J.H.: DMM: Dynamic Meta Modelling — A Semantics Description Language for Visual Modeling Languages. PhD thesis, University of Paderborn (2006)

    Google Scholar 

  11. Hoffmann, B.: Graph transformation with variables. In: Kreowski, et al. [14], pp. 101–115

    Google Scholar 

  12. Hurkens, C.A.J.: Spreading gossip efficiently. Nieuw Archief voor Wiskunde 1(2), 208 (2000)

    MathSciNet  Google Scholar 

  13. Kastenberg, H., Kleppe, A., Rensink, A.: Defining object-oriented execution semantics using graph transformations. In: Gorrieri, R., Wehrheim, H. (eds.) FMOODS 2006. LNCS, vol. 4037, pp. 186–201. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  14. Kreowski, H.-J., Montanari, U., Orejas, F., Rozenberg, G., Taentzer, G.: Formal Methods in Software and Systems Modeling. LNCS, vol. 3393. Springer, Heidelberg (2005)

    Book  MATH  Google Scholar 

  15. Minas, M., Hoffmann, B.: An example of cloning graph transformation rules for programming. In: Bruni, R., Varró, D. (eds.) Fifth International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT), pp. 235–244 (2006)

    Google Scholar 

  16. Rensink, A.: Representing first-order logic using graphs. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol. 3256, pp. 319–335. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  17. Schürr, A.: Logic based programmed structure rewriting systems. Fundamenta Informaticae 26(3/4), 363–385 (1996)

    MATH  MathSciNet  Google Scholar 

  18. Taentzer, G.: Parallel and Distributed Graph Transformation: Formal Description and Application to Communication-Based Systems. PhD thesis, Technische Universität Berlin (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Twente, P.O. Box 217, 7500 AE, The Netherlands

    Arend Rensink

Authors
  1. Arend Rensink
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Business Communication and Information Science, University of Southern Denmark, 6000, Kolding, Denmark

    Andrea Corradini

  2. Technische Universität Berlin, Germany

    Hartmut Ehrig

  3. Dipartimento di Informatica, Università di Pisa,  

    Ugo Montanari

  4. Instituto de Informática, Universidade Federal do Rio Grande do Sul, Porto Alegre, Brazil

    Leila Ribeiro

  5. Leiden Center of Advanced Computer Science (LIACS), Leiden University, Niels Bohrweg 1, 2333, Leiden, CA, The Netherlands

    Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rensink, A. (2006). Nested Quantification in Graph Transformation Rules. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds) Graph Transformations. ICGT 2006. Lecture Notes in Computer Science, vol 4178. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11841883_1

Download citation

  • DOI: https://doi.org/10.1007/11841883_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-38870-8

  • Online ISBN: 978-3-540-38872-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation