Skip to main content

Supporting Formal Verification of Crosscutting Concerns

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2192))

Abstract

This paper presents an approach to formal verification of the properties of systems composed of multiple crosscutting concerns. The approach models concerns as sets of concurrent processes, and provides a method of composition that mimics the composition operators of existing multiple-concern implementation languages. A case study demonstrates the composition process and shows how formal verification of different composition strategies can detect potential problems. We also discuss the need for a general model of concerns that can be handled by different formal languages.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Aksit, K. Wakita, J. Bosch, L. Bergmans, and A. Yonezawa. Abstracting object-interactions using composition-filters. In R. Guerraoui, O. Nierstrasz, and M. Riveill, editors, Object-Based Distributed Processing, pages 152–184. Springer-Verlag, 1993.

    Google Scholar 

  2. Don Batory. Subjectivity and GenVoca generators. In Proceedings of the Fourth International Conference on Software Reuse, Orlando, Florida, April 1996.

    Google Scholar 

  3. Erich Gamma, Richard Helm, Ralph Johnson, and John Vlissides. Design Patterns: Elements of Reusable Object-Oriented Software. Addison-Wesley, 1995.

    Google Scholar 

  4. William Harrison and Harold Ossher. Subject-oriented programming (a critique of pure objects). In Proceedings of OOPSLA’ 93, pages 411–428. ACM, 1993.

    Google Scholar 

  5. Daniel Jackson. Structuring Z specifications with views. ACM Transactions on Software Engineering and Methodology, 4(4):365–389, October 1995.

    Article  Google Scholar 

  6. Daniel Jackson. Alcoa: the alloy constraint analyzer. In Proceedings of ICSE 2000, Limerick, Ireland, 2000. http://sdg.lcs.mit.edu/alloy/.

  7. Gregor Kiczales, J. Lamping, A. Mendhekar, C. Lopes, J. Loingtier, and J. Irwin. Aspectoriented programming. In Proceedings of ECOOP’ 97, 1997.

    Google Scholar 

  8. J. Magee and J. Kramer. Concurrency: State Models and Java Programs. JohnWiley&Sons, 1999.

    Google Scholar 

  9. Torsten Nelson, Donald Cowan, and Paulo Alencar. A model for describing object-oriented systems from multiple perspectives. In Fundamental Approaches to Software Engineering, FASE 2000, volume 1783 of Lecture Notes in Computer Science, Berlin, Germany, 2000. Springer.

    Chapter  Google Scholar 

  10. R. Pande and J. Browne. A compositional approach to concurrent object-oriented programming. In Proceedings of the International Conference on Compilers and Languages, Paris, France, May 1994.

    Google Scholar 

  11. Mark Skipper. A model of composition oriented programming. In Proceedings of the ICSE 2000 Workshop on Multi-Dimensional Separation of Concerns in Software Engineering, 2000.

    Google Scholar 

  12. B. Smith. Reflection and semantics in lisp. In Proceedings of PoPL’84: The Eleventh Annual ACM Symposium on Principles of Programming Languages, January 1984.

    Google Scholar 

  13. Spivey. The Z Notation: A Reference Manual. Prentice Hall, 1987.

    Google Scholar 

  14. Peri Tarr, Harold Ossher, William Harrison, and S. Sutton. N degrees of separation: Multidimensional separation of concerns. In Proceedings of the 21st International Conference on Software Engineering, pages 107–119, 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nelson, T., Cowan, D., Alencar, P. (2001). Supporting Formal Verification of Crosscutting Concerns. In: Yonezawa, A., Matsuoka, S. (eds) Metalevel Architectures and Separation of Crosscutting Concerns. Reflection 2001. Lecture Notes in Computer Science, vol 2192. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45429-2_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-45429-2_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42618-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics