Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
Book cover

International Conference on Fundamental Approaches to Software Engineering

FASE 2012: Fundamental Approaches to Software Engineering pp 194–208Cite as

  1. Home
  2. Fundamental Approaches to Software Engineering
  3. Conference paper
Recursive Checkonly QVT-R Transformations with General when and where Clauses via the Modal Mu Calculus

Recursive Checkonly QVT-R Transformations with General when and where Clauses via the Modal Mu Calculus

  • Julian Bradfield18 &
  • Perdita Stevens18 
  • Conference paper
  • 1514 Accesses

  • 9 Citations

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

Abstract

In earlier work we gave a game-based semantics for checkonly QVT-R transformations. We restricted when and where clauses to be conjunctions of relation invocations only, and like the OMG standard, we did not consider cases in which a relation might (directly or indirectly) invoke itself recursively. In this paper we show how to interpret checkonly QVT-R – or any future model transformation language structured similarly – in the modal mu calculus and use its well-understood model-checking game to lift these restrictions. The interpretation via fixpoints gives a principled argument for assigning semantics to recursive transformations. We demonstrate that a particular class of recursive transformations must be ruled out due to monotonicity considerations. We demonstrate and justify a corresponding extension to the rules of the QVT-R game.

Download conference paper PDF

References

  1. Bradfield, J.C., Stirling, C.: Modal mu-calculi. In: Blackburn, P., van Benthem, J., Wolter, F. (eds.) Handbook of Modal Logic, vol. 3, pp. 721–756. Elsevier (2007)

    Google Scholar 

  2. Bradfield, J., Stevens, P.: Recursive checkonly QVT-R transformations with general when and where clauses via the modal mu calculus. Technical Report EDI–INF–RR–1410, University of Edinburgh, Includes Appendix (2012)

    Google Scholar 

  3. Cabot, J., Clarisó, R., Guerra, E., de Lara, J.: Verification and validation of declarative model-to-model transformations through invariants. Journal of Systems and Software 83(2), 283–302 (2010)

    CrossRef  Google Scholar 

  4. Object Management Group. Object constraint language, version 2.0, formal/2006-05-01 (May 2006)

    Google Scholar 

  5. Kozen, D.: Results on the propositional mu-calculus. Theor. Comput. Sci. 27, 333–354 (1983)

    CrossRef  MathSciNet  MATH  Google Scholar 

  6. OMG. MOF2.0 query/view/transformation (QVT) version 1.1. OMG document formal/2009-12-05 (2009), www.omg.org

  7. Stevens, P.: A simple game-theoretic approach to checkonly QVT Relations. Journal of Software and Systems Modeling (SoSyM) (March 16, 2011), doi: 10.1007/s10270-011-0198-8

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Informatics, University of Edinburgh, UK

    Julian Bradfield & Perdita Stevens

Authors
  1. Julian Bradfield
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Perdita Stevens
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Universidad Autónoma de Madrid, Campus Cantoblanco, 28049, Madrid, Spain

    Juan de Lara

  2. School of Informatics, City University, Northampton Square, EC1V 0HB, London, UK

    Andrea Zisman

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bradfield, J., Stevens, P. (2012). Recursive Checkonly QVT-R Transformations with General when and where Clauses via the Modal Mu Calculus. In: de Lara, J., Zisman, A. (eds) Fundamental Approaches to Software Engineering. FASE 2012. Lecture Notes in Computer Science, vol 7212. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28872-2_14

Download citation

  • .RIS
  • .ENW
  • .BIB
  • DOI: https://doi.org/10.1007/978-3-642-28872-2_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-28871-5

  • Online ISBN: 978-3-642-28872-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature