Skip to main content
SpringerLink
Log in

A formal definition of crosscuts

  • Conference paper
  • First Online:
Metalevel Architectures and Separation of Crosscutting Concerns (Reflection 2001)

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

Included in the following conference series:

Abstract

Crosscutting,i.e.relating different program points is one of the key notions of Aspect-Oriented Programming.In this article,we consider a general and operational model for crosscutting based on excusion monitors.

A domain-specific language for definition of crosscuts constitutes the core of the article.The semantics of this language is formally defined by means of parser operators matching event patterns in execution traces. We define an operational semantics of the matching process by means of rules relating the operators.The use of the language is exemplified by several sophisticated crosscut definitions.we sketch a prototype implementation in Java which has been systematically derived from the language definition.

This work has been partially funded by the EU project “EasyComp” (www.easycomp.org),no.IST-1999014191

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. T. Colcombet and P. Fradet.Enforcing trace properties by program transpormation. In Proceedings of the 27th ACM SIGPLAN-SIGACT Symposium on Principles of Proramming Languages (POLP-00),pages 54–66,N.Y.,January 19-27 2000.ACM Press.

    Google Scholar 

  2. R. Douence, O. Motelet,and M. Südholt.A formal definitions of crosscuts.Technical Report 01/3/INFO,École des Mines de Nantes,2001.

    Google Scholar 

  3. R. Douence and M. Südholt.Ageneric reification teachnique for object-oriented reflective languages. The Journal of Higher-Order and Symbolic Computation, 14(1),2001.

    Google Scholar 

  4. M. Ducasse. Opium:An extendable trace analyser for Prolog. The Journal of Logic programming, 1999.

    Google Scholar 

  5. P. Fradet and M. Südholt. AOP: towards a generic framework using program transformation and analysis.

    Google Scholar 

  6. P. Hudak, S. Peyton Jones, P. Wadler,et al.Report on the programming language HASKELL. ACM SIGPLAN Notices, 27(5),March 1992. HASKELL home page: http://www.haskell.org.

  7. G. Hutton and E. Meijer.Monadic parsing in Haskell. Juornal of Punctional Pogramming,8(4):437–444,July 1998.

    Article  MATH  Google Scholar 

  8. G. Kiczales, J.des Rivieres, and D. G. Bobrow. The Art of the Meta-Object Protocol. Mit Press, Cambridge (MA), USA, 1999.

    Google Scholar 

  9. G. Kiczales et al. Aspect-oriented programming. In Mehmet Askit and Satoshi Matsuoka, editors, 11th European Conference on Object-Oriented Programming, volume 1241 of LNCS, pages 220–242. Springer-Verlag, 1997.

    Google Scholar 

  10. G. Kiczales et al. An overview of ASPECTJ. In Proceedings of the European Conference on Object-Oriented Programming (ECOOP),2001. To appear,preprint version: see ASPECTJ home page,http://www.aspectj.org.

  11. C. KO. G. Fink, and K. Levitt. Automated detection of vulnerabilities in priveleged programs by excution monitoring. In Proceedings of the computer Security Application Conference, 1994.

    Google Scholar 

  12. R. Lämmel. Declarative aspect-oriented programming. In Partial Evaluation and program Manipulation, 1999.

    Google Scholar 

  13. U. Lindqvist and P. Porras. Detecting computer and network misuse through the production-based expert syatem toolset (P-BEST). In Proceedings of the IEEE symposium on Security and Privacy (SSP’ 99), pages 146–165. IEEE, May 1999.

    Google Scholar 

  14. W. De Meuter. Monads as a theoretical foundation for AOP.

    Google Scholar 

  15. A. Mounji. Languages and Tools for Rule-based Distributed Intrusion Detection. PhD thesis, Université de Namur,1997.

    Google Scholar 

  16. Amir Pnueli. The temporal logic of programs. In Proceedings of the 18th IEEE Symposium on the Foundations of Computer Science (FOCS-77), pages 46–57. IEEE 31-2 1997.

    Google Scholar 

  17. P. Tarr and H.L. Ossher.Hyper/J user nand installation manual. Technical report, IBM Corp., 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. École des Mines de Nantes, 4 rue Alfred Kastler, 44307, Nantes cedex 3, France

    Rèmi Douence, Olivier Motelet & Mario Südholt

Authors
  1. Rèmi Douence
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Olivier Motelet
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mario Südholt
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Information Science and Technology Department of Computer Science, University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo, 113-0033, Japan

    Akinori Yonezawa

  2. Global Scientific Information and Computing Center Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, 2-12-1 Oo-okayama, Meguro-ku, Tokyo, 152-8552, Japan

    Satoshi Matsuoka

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Douence, R., Motelet, O., Südholt, M. (2001). A formal definition of crosscuts. 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_13

Download citation

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

  • 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

Search

Navigation