A Graph-based Approach to Modeling and Detecting Composition Conflicts Related to Introductions

Wilke Havinga, Istvan Nagy, Lodewijk Bergmans, Mehmet Akşit

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    26 Citations (Scopus)
    11 Downloads (Pure)

    Abstract

    The goal of this paper is to model and detect composition conflicts related to introductions. Within this context, we identify several categories of composition conflicts. To analyze the causes of these conflicts precisely, we first model the structure of programs as graphs. Next, we model introductions as graph transformation rules. We define explicit rules to describe when composition conflicts related to introductions occur. We built a prototype tool that detects and visualizes the occurrence of such conflicts in AspectJ programs, making use of an existing graph analysis and rewriting tool. The graph-based models are generated automatically from the source code of Java programs and AspectJ introductions. However, our approach does not make strong assumptions about either the aspect or base language; it has been designed to be applicable to other AOP languages.
    Original languageEnglish
    Title of host publicationAOSD '07
    Subtitle of host publicationProceedings of International Conference on Aspect Oriented Software Development, AOSD 2007
    Place of PublicationNew York, NY
    PublisherACM Press
    Pages85-95
    Number of pages11
    ISBN (Print)1-59593-615-7
    DOIs
    Publication statusPublished - 19 Jan 2007
    Event6th International Conference on Aspect-Oriented Software Development, AOSD 2007 - Vancouver, Canada
    Duration: 12 Mar 200716 Mar 2007
    Conference number: 6

    Conference

    Conference6th International Conference on Aspect-Oriented Software Development, AOSD 2007
    Abbreviated titleAOSD
    CountryCanada
    CityVancouver
    Period12/03/0716/03/07

    Fingerprint

    Chemical analysis

    Keywords

    • EWI-8885
    • IR-60271
    • METIS-242012

    Cite this

    Havinga, W., Nagy, I., Bergmans, L., & Akşit, M. (2007). A Graph-based Approach to Modeling and Detecting Composition Conflicts Related to Introductions. In AOSD '07: Proceedings of International Conference on Aspect Oriented Software Development, AOSD 2007 (pp. 85-95). New York, NY: ACM Press. https://doi.org/10.1145/1218563.1218574
    Havinga, Wilke ; Nagy, Istvan ; Bergmans, Lodewijk ; Akşit, Mehmet . / A Graph-based Approach to Modeling and Detecting Composition Conflicts Related to Introductions. AOSD '07: Proceedings of International Conference on Aspect Oriented Software Development, AOSD 2007. New York, NY : ACM Press, 2007. pp. 85-95
    @inproceedings{e7ef5fb9bab044d89af3cd1ad20c9c87,
    title = "A Graph-based Approach to Modeling and Detecting Composition Conflicts Related to Introductions",
    abstract = "The goal of this paper is to model and detect composition conflicts related to introductions. Within this context, we identify several categories of composition conflicts. To analyze the causes of these conflicts precisely, we first model the structure of programs as graphs. Next, we model introductions as graph transformation rules. We define explicit rules to describe when composition conflicts related to introductions occur. We built a prototype tool that detects and visualizes the occurrence of such conflicts in AspectJ programs, making use of an existing graph analysis and rewriting tool. The graph-based models are generated automatically from the source code of Java programs and AspectJ introductions. However, our approach does not make strong assumptions about either the aspect or base language; it has been designed to be applicable to other AOP languages.",
    keywords = "EWI-8885, IR-60271, METIS-242012",
    author = "Wilke Havinga and Istvan Nagy and Lodewijk Bergmans and Mehmet Akşit",
    year = "2007",
    month = "1",
    day = "19",
    doi = "10.1145/1218563.1218574",
    language = "English",
    isbn = "1-59593-615-7",
    pages = "85--95",
    booktitle = "AOSD '07",
    publisher = "ACM Press",

    }

    Havinga, W, Nagy, I, Bergmans, L & Akşit, M 2007, A Graph-based Approach to Modeling and Detecting Composition Conflicts Related to Introductions. in AOSD '07: Proceedings of International Conference on Aspect Oriented Software Development, AOSD 2007. ACM Press, New York, NY, pp. 85-95, 6th International Conference on Aspect-Oriented Software Development, AOSD 2007, Vancouver, Canada, 12/03/07. https://doi.org/10.1145/1218563.1218574

    A Graph-based Approach to Modeling and Detecting Composition Conflicts Related to Introductions. / Havinga, Wilke; Nagy, Istvan; Bergmans, Lodewijk; Akşit, Mehmet .

    AOSD '07: Proceedings of International Conference on Aspect Oriented Software Development, AOSD 2007. New York, NY : ACM Press, 2007. p. 85-95.

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    TY - GEN

    T1 - A Graph-based Approach to Modeling and Detecting Composition Conflicts Related to Introductions

    AU - Havinga, Wilke

    AU - Nagy, Istvan

    AU - Bergmans, Lodewijk

    AU - Akşit, Mehmet

    PY - 2007/1/19

    Y1 - 2007/1/19

    N2 - The goal of this paper is to model and detect composition conflicts related to introductions. Within this context, we identify several categories of composition conflicts. To analyze the causes of these conflicts precisely, we first model the structure of programs as graphs. Next, we model introductions as graph transformation rules. We define explicit rules to describe when composition conflicts related to introductions occur. We built a prototype tool that detects and visualizes the occurrence of such conflicts in AspectJ programs, making use of an existing graph analysis and rewriting tool. The graph-based models are generated automatically from the source code of Java programs and AspectJ introductions. However, our approach does not make strong assumptions about either the aspect or base language; it has been designed to be applicable to other AOP languages.

    AB - The goal of this paper is to model and detect composition conflicts related to introductions. Within this context, we identify several categories of composition conflicts. To analyze the causes of these conflicts precisely, we first model the structure of programs as graphs. Next, we model introductions as graph transformation rules. We define explicit rules to describe when composition conflicts related to introductions occur. We built a prototype tool that detects and visualizes the occurrence of such conflicts in AspectJ programs, making use of an existing graph analysis and rewriting tool. The graph-based models are generated automatically from the source code of Java programs and AspectJ introductions. However, our approach does not make strong assumptions about either the aspect or base language; it has been designed to be applicable to other AOP languages.

    KW - EWI-8885

    KW - IR-60271

    KW - METIS-242012

    U2 - 10.1145/1218563.1218574

    DO - 10.1145/1218563.1218574

    M3 - Conference contribution

    SN - 1-59593-615-7

    SP - 85

    EP - 95

    BT - AOSD '07

    PB - ACM Press

    CY - New York, NY

    ER -

    Havinga W, Nagy I, Bergmans L, Akşit M. A Graph-based Approach to Modeling and Detecting Composition Conflicts Related to Introductions. In AOSD '07: Proceedings of International Conference on Aspect Oriented Software Development, AOSD 2007. New York, NY: ACM Press. 2007. p. 85-95 https://doi.org/10.1145/1218563.1218574