Translucid contracts

Bagherzadeh, Mehdi; Rajan, Hridesh; Leavens, Gary T.; Mooney, Sean L.

doi:10.1145/1960275.1960293

Cited by 27 publications

(1 citation statement)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several approaches combat this problem by proposing new PCE languages with more expressiveness [8,9,10,11,12,13,14], limiting where advice may apply [15,16], or enforcing constraints on advice application [17,18,19,20]. Others make advice applicability more explicit [21] or do not use PCEs [22,23,24].…”

Section: Languages and Other Mechanisms For Coping With Pointcut Fragmentioning

confidence: 99%

Detecting broken pointcuts using structural commonality and degree of interest

Khatchadourian

Rashid

Masuhara

et al. 2017

Science of Computer Programming

View full text Add to dashboard Cite

Pointcut fragility is a well-documented problem in Aspect-Oriented Programming; changes to the base-code can lead to join points incorrectly falling in or out of the scope of pointcuts. Deciding which pointcuts have broken due to base-code changes is a daunting venture, especially in large and complex systems. We present an automated approach that recommends pointcuts that are likely to require modification due to a particular base-code change, as well as ones that do not. Our hypothesis is that join points selected by a pointcut exhibit common structural characteristics. Patterns describing such commonality are used to recommend pointcuts that have potentially broken with a degree of confidence as the developer is typing. The approach is implemented as an extension to the popular Mylyn Eclipse IDE plug-in, which maintains focused contexts of entities relevant to the task at hand using a Degree of Interest (DOI) model. We show that it is accurate in revealing

show abstract

Section: Languages and Other Mechanisms For Coping With Pointcut Fragmentioning

confidence: 99%

Detecting broken pointcuts using structural commonality and degree of interest

Khatchadourian

Rashid

Masuhara

et al. 2017

Science of Computer Programming

View full text Add to dashboard Cite

show abstract

High-Level Program Properties in Frama-C: Definition, Verification and Deduction

Robles,

Kosmatov,

Prevosto

et al. 2024

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Modular Reasoning in the Presence of Event Subtyping

Bagherzadeh

Dyer

Fernando

et al. 2016

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Separating crosscutting concerns while preserving modular reasoning is challenging. Type-based interfaces (event types) separate modularized crosscutting concerns (observers) and traditional object-oriented concerns (subjects). Event types paired with event specifications have been shown to be effective in enabling modular reasoning about subjects and observers. Similar to class subtyping there are benefits to organizing event types into subtyping hierarchies. However, unrelated behaviors of observers and their arbitrary execution orders could cause unique, somewhat counterintuitive, reasoning challenges in the presence of event subtyping. These challenges threaten both tractability of reasoning and reuse of event types. This work makes three contributions. First, we pose and explain these challenges. Second, we propose an event-based calculus to show how these challenges can be overcome. Finally, we present modular reasoning rules of our technique, and show its applicability to other event-based techniques including join point types. AbstractSeparating crosscutting concerns while preserving modular reasoning is challenging. Type-based interfaces (event types) separate modularized crosscutting concerns (observers) and traditional object-oriented concerns (subjects). Event types paired with event specifications were shown to be effective in enabling modular reasoning about subjects and observers. Similar to class subtyping, organizing event types into subtyping hierarchies is beneficial. However, unrelated behaviors of observers and their arbitrary execution orders could cause unique, somewhat counterintuitive, reasoning challenges in the presence of event subtyping. These challenges threaten both tractability of reasoning and reuse of event types. This work makes three contributions. First, we pose and explain these challenges. Second, we propose an event-based calculus to show how these challenges can be overcome. Finally, we present modular reasoning rules of our technique and show its applicability to other event-based techniques.

show abstract

Translucid contracts

Cited by 27 publications

References 28 publications

Detecting broken pointcuts using structural commonality and degree of interest

Detecting broken pointcuts using structural commonality and degree of interest

High-Level Program Properties in Frama-C: Definition, Verification and Deduction

Modular Reasoning in the Presence of Event Subtyping

Contact Info

Product

Resources

About