XFindBugs

Shen, Haihao; Zhang, Sai; Zhao, Jianjun; Fang, Jianhong; Yao, Shiyuan

doi:10.1145/1512475.1512490

Cited by 10 publications

(3 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since the base system is modified by weaving, unexpected results can emerge. In AO paradigm, this issue is commonly known as the aspect interaction problem [SP05,TCZY09].…”

Section: Ao Paradigm and The Aspect Interaction Problemmentioning

confidence: 99%

“…However, this paradigm is particularly limited in the expression of crosscutting features, i.e., those expressing concerns that affects several classes or modules of the application. Indeed, in at least two cases (the tangling and scattering code [SP05]) the object-oriented paradigm does not provide a satisfactory solution to achieve clear and well-structured programs.…”

Section: Introductionmentioning

confidence: 99%

“…Even when the base system and the aspects are well defined, the weaving mechanism may lead to a bad interaction between all parts. This is one kind of what is commonly known as aspect interaction problem [SP05,TCZY09].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

On using pre and postconditions to tackle the aspect scheduling problem by rewriting systems: a design-level approach.

Benouhiba¹,

Boudjedir²

2014

JOT

View full text Add to dashboard Cite

The aspect-oriented paradigm promises separation of crosscutting concerns by modularizing them as aspects. This paradigm allows then weaving aspects upon some points in the base system. Unfortunately, the interaction of aspects may have an undesirable effect on each other and/or on the base system if they are executed in any order. Many works tried to solve this problem but the proposed solutions were either limited to some simple models of aspects or used to check if a set of temporal properties is preserved when aspects are introduced. In this paper, we propose a framework based on extended UML diagrams (class and state/transition diagrams) in order to make the detection of undesirable interaction more powerful and realistic. This framework relies on finite state automata (FSA); it transforms the interaction problem into a reachability issue. In fact, bad interaction is expressed as a generic LTL property which is independent of the system to be verified. This property can be checked using any model-checker like Maude. To concretize the proposed framework, we propose a rewriting system that allows an implicit construction of the FSA of the base system and the aspects in addition to the aspects composition and the weaving mechanism. Therefore, the proposed system defines a translation scheme of UML models into rewriting logic specifications written in Maude language. Thanks to the advances of the on-the-fly technique in Maude, the use of its LTL model-checker avoids a systematic exploration of all possible combinations of the aspects. The approach will be illustrated by a case study in order to explain how it works.

show abstract

“…Since the base system is modified by weaving, unexpected results can emerge. In AO paradigm, this issue is commonly known as the aspect interaction problem [SP05,TCZY09].…”

Section: Ao Paradigm and The Aspect Interaction Problemmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

On using pre and postconditions to tackle the aspect scheduling problem by rewriting systems: a design-level approach.

Benouhiba¹,

Boudjedir²

2014

JOT

View full text Add to dashboard Cite

show abstract

Automatic Detection of Infinite Recursion in AspectJ Programs

Salmi

Parsa

2009

Future Generation Information Technology

View full text Add to dashboard Cite

AspectJ code analysis and verification with GASR

Fabry

Roover

Noguera

et al. 2016

Journal of Systems and Software

View full text Add to dashboard Cite

• We argue for a general-purpose source code analysis tool that is aware of aspects.• We present the logic program querying tool GASR, the first such tool..• We discuss its implementation along with its library of logical predicates.• We show how it can automatically verify previously published aspectual assumptions. AbstractAspect-oriented programming languages extend existing languages with new features for supporting modularization of crosscutting concerns. These features however make existing source code analysis tools unable to reason over this code. Consequently, all code analysis efforts of aspect-oriented code that we are aware of have either built limited analysis tools or were performed manually. Given the significant complexity of building them or manual analysis, a lot of duplication of effort could have been avoided by using a general-purpose tool.To address this, in this paper we present Gasr: a source code analysis tool that reasons over AspectJ source code, which may contain metadata in the form of annotations. Gasr provides multiple kinds of analyses that are general enough such that they are reusable, tailorable and can reason over annotations. We demonstrate the use of Gasr in two ways: we first automate the recognition of previously identified aspectual source code assumptions. Second, we turn implicit assumptions into explicit assumptions through annotations and automate their verification. In both uses Gasr performs detection and verification of aspect assumptions on two well-known case studies that were manually investigated in earlier work. Gasr finds already known aspect assumptions and adds instances that had been previously overlooked.

show abstract

XFindBugs

Cited by 10 publications

References 23 publications

On using pre and postconditions to tackle the aspect scheduling problem by rewriting systems: a design-level approach.

On using pre and postconditions to tackle the aspect scheduling problem by rewriting systems: a design-level approach.

Automatic Detection of Infinite Recursion in AspectJ Programs

AspectJ code analysis and verification with GASR

Contact Info

Product

Resources

About