Skip to main content

Verification of Architectural Refactorings: Rule Extraction and Tool Support

  • Conference paper

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

Abstract

With the recent success of the component-based and service-oriented paradigm, the complexity of software also increased. To tackle complexity, architectural models aid the developers. However, a software in constant use, must continually evolve, otherwise it becomes progressively less satisfactory [1]. During the adaptation to changed requirements and improvement of internal structure, changes may be required to preserve the observable behaviour of the systems. In OO programming, such behaviour-preserving transformations are called refactorings [2].

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

Buying options

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

Learn about institutional subscriptions

References

  1. Lehman, M.M.: Laws of software evolution revisited. In: European Workshop on Software Process Technology, pp. 108–124 (1996)

    Google Scholar 

  2. Fowler, M., Beck, K., Brant, J., Opdyke, W., Roberts, D.: Refactoring: Improving the Design of Existing Code, 1st edn. Addison-Wesley Professional, Reading (1999)

    Google Scholar 

  3. Bisztray, D., Heckel, R., Ehrig, H.: Verification of architectural refactorings by rule extraction. In: Fiadeiro, J.L., Inverardi, P. (eds.) FASE 2008. LNCS, vol. 4961, pp. 347–361. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  4. Hoare, C.A.R.: Communicating Sequential Processes. Prentice Hall International Series in Computer Science. Prentice Hall, Englewood Cliffs (1985)

    MATH  Google Scholar 

  5. Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science). An EATCS Series. Springer, New York (2006)

    Google Scholar 

  6. Tiger Developer Team: Tiger EMF Transformer (2007), http://www.tfs.cs.tu-berlin.de/emftrans

  7. Bisztray, D.: Verification of architectural refactoring rules. Technical Report CS-08-001, Department of Computer Science, University of Leicester (2008), http://www.cs.le.ac.uk/people/dab24/refactoring-techrep.pdf

  8. Formal Systems Europe Ltd: FDR2 User Manual (2005), http://www.fsel.com/documentation/fdr2/html/index.html

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bisztray, D. (2008). Verification of Architectural Refactorings: Rule Extraction and Tool Support. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds) Graph Transformations. ICGT 2008. Lecture Notes in Computer Science, vol 5214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87405-8_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-87405-8_37

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-87404-1

  • Online ISBN: 978-3-540-87405-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics