Aspects that in isolation behave correctly, may interact when being combined. When interaction changes an aspect's behaviour or disables an aspect, we call this interference. One particular type of interference occurs when aspects are applied to shared join points, since then the ordering of the aspects can also influence the behaviour of the composition. We present an approach to detect aspect interference at shared join points. Aspect compositions are modelled by using a graph production system for modelling aspect-language semantics. A graph-based model of a join point is generated from the source-code of the system. This graph is transformed into a runtime-state representation. Combined with the production system (and the correct tooling) the execution of the aspects is simulated. This simulation results in a labelled transition system that can be used to analyse and verify different properties of the system at the join point. Simulation of the entire system can be computationally expensive. In our approach, we decide to abstract base system execution into non-deterministic valuation and carefully choosing advice semantics, such that simulation of the entire system can be avoided.
Abstract. In this paper we describe the Ludo case, one of the case studies of the AGTIVE 2007 Tool Contest (see [22]). After summarising the case description, we give an overview of the submitted solutions. In particular, we propose a number of dimensions along which choices had to be made when solving the case, essentially setting up a solution space; we then plot the spectrum of solutions actually encountered into this solution space. In addition, there is a brief description of the special features of each of the submissions, to do justice to those aspects that are not distinguished in the general solution space.
In this paper we specify an operational run-time semantics of Assignment Featherweight Java -a minimal subset of Java with assignments -with around advice, using graph transformations. We introduce a notion of correctness of our specification with respect to an existing semantics and claim a number of advantages over traditional mathematical notations, that come forth from the executable nature of graph-transformation-based semantics. Using test programs as graphs during specification of the semantics, simulation can help in verifying the correctness of the rules simply by testing, increasing the rigorousness of the specification process. Also, execution of the semantics results in a state space that can be used for analysis and verification, giving rise to an effective method for aspect program verification. As a criterion for correctness, we use a structural operational semantics of this language from the so-called Common Aspect Semantics Base.
Ui t nodi gi ngO p d o n d e r d a g 3 j u n i 2A s p e c t -O r i e n t e d L a n g u a g e s i n C o l l e i n C o l l e g e z a a l 4 i n g e b o u w ' Wa a i e r ' v a n d e U n i v e r s i t e i t T we n t e .V o o r a f g a a n d a a n d e v e r d e d i g i n g z a l i k o m 1 4 : 4 5 e e n k o r t e t o e l i c h n g g e v e n o p mi j n o n d e r z o e k .U b e U b e n t v a n h a r t e we l k o m b i j d e v e r d e d i g i n g e n d e r e c e p e d i e a a n s l u i t e n d wo r d t g e h o u d e n . V a n a f 2 0 : 3 0 b o r r e l e n b i j c a f é C e n t r a l P a r k i n E n s c h e d e ( R S V P v o o r 2 8 me i )T o m S t a i j e n t . t . s t a i j e n @g ma i l . c o m + 3 1 6 1 0 0 2 7 6 4 9 P a r a n i mf e n : J a c k e l i e n B a r e l d s e n R e i n S t a i j e n G r a p h -b a s e d S p e c i fi c a o n a n d V e r i fi c a o n f o r A s p e c t -O r i e n t e d L a n g u a g e s T o m S t a i j e n I S B N 9 7 8 -9 0 -3 6 5 -3 0 4 1 -5 G r a p h -b a s e d S p e c i fi c a o n a n d V e r i fi c a o n f o r A s p e c t -O r i e n t e d L a n g u a g e s "Common sense, do what it will, cannot avoid being surprised occasionally. The object of science is to spare it this emotion and create mental habits which shall be in such close accord with the habits of the world as to secure that nothing shall be unexpected." T o m S t a i j e n -Bertrand Russell AcknowledgementsThe first person I would like to thank is my daily supervisor and assistant-promoter Arend Rensink. During the past five years, Arend has taught me a great deal about formal methods in general and about graph transformation, about writing proofs and to not fear Greek symbols. I also want to thank him for listening and understanding when things did not go too well, and for triggering me when things did not go very fast. However, the most precious thing I need to thank Arend for, is the enthusiasm and joy I have in specifying systems formally, particularly for the purpose of solving puzzles. I have carried out my Ph.D. studies at the software engineering group lead my Mehmet Akşit. The sprout of his mind "Composition Filters" has found its way into this thesis. His endless enthusiasm has been a continuous motivation, his presence a motive for generalisation, always to look for a "bigger picture". His feedback, advice and guidance can be found throughout this thesis.I like to thank the members of my Ph.D. committee: Shmuel Katz, Dark Janssens, Jaco van de Pol and Pieter Hartel. Their useful comments enabled me to dramatically improve this thesis.I would like to thank all members of the software engineering group and the formal methods and tools group. They have provided me with useful feedback during our regular seminars and provided me with a pleasant working environment and of course a number of unforgettable social events. In particular, I want to thank ex-fellow-Ph.D. student Pascal Dürr with whom I went on some awesome hiking trips, Ivan Zapreev, we "recognised" each other in Marktoberdorf and have had the best times since,...
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.