535 Hits in 4.0 sec

Tracechecks: Defining Semantic Interfaces with Temporal Logic [chapter]

Eric Bodden, Volker Stolz
2006 Lecture Notes in Computer Science  
Tracechecks are a formalism based on linear temporal logic (LTL) with variable bindings and pointcuts of the aspect-oriented language AspectJ for the purpose of verification.  ...  We explain in detail how we make use of AspectJ pointcuts to derive a formal model of an existing application and use LTL to express temporal assertions over this model.  ...  We thank the whole abc group for their useful comments on this work and on extending the AspectBench compiler in general.  ... 
doi:10.1007/11821946_10 fatcat:mh2p4rpzand63oe6ny2nlv4pue

Behavior Consistency Verification for Evolution of Aspectual Component-Based Software

Xue Yao Zhou, Ning Jiang Chen, Dan Dan Hu
2013 Advanced Materials Research  
A semantic model of aspectual component-based software is proposed to provide behavior description and semantic foundation for the consistency verification of software architecture dynamic evolution.  ...  By using the semantic model of Pi-calculus, a set of the consistency verification methods of dynamic evolution from multiple aspects are introduced.  ...  A, A') is empty, and the evolution doesn't have an impact on the semantic of pointcut, the pointcut is static robust, otherwise it is fragile.  ... 
doi:10.4028/ fatcat:qbdssjaxnjhdncrogx2eaundcq

Pointcuts as Functional Queries [chapter]

Michael Eichberg, Mira Mezini, Klaus Ostermann
2004 Lecture Notes in Computer Science  
Due to its abstraction and module facilities, XQuery enables powerful composition and reusability mechanisms for pointcuts.  ...  As a consequence, these languages do not provide operations to manipulate or reason about pointcuts beyond weaving.  ...  this is backed up by the existence of a formal semantics [20] ).  ... 
doi:10.1007/978-3-540-30477-7_25 fatcat:zuggp3de5bcublyiqywldcsyda

Path Expression Pointcuts: Abstracting over Non-Local Object Relationships in Aspect-Oriented Languages

Mohammed Al-Mansari, Stefan Hanenberg
2006 Grid Services Engineering and Management  
We propose so called "path expression pointcuts" that permit to abstract over (non-local) object-relationships within pointcuts -and show that this overcomes the problem.  ...  In aspect-oriented programming, aspects require access to join point information for selecting join points within pointcuts as well as for specifying aspect-specific behavior at such join points within  ...  These issues are going to be our main focus for the future work. Another important work direction that we are concerning also is completing the formal semantics of the path expression pointcut.  ... 
dblp:conf/gsem/Al-MansariH06 fatcat:dvnfgzjuwjgldnwfmxpoujyxca

The aspect-oriented user requirements notation

Gunter Mussbacher
2011 Proceedings of the tenth international conference on Aspect-oriented software development companion - AOSD '11  
See Appendix C: BNF for Name Expressions for a more formal definition of variable expressions on pointcut maps.  ...  See Appendix C: BNF for Name Expressions for a more formal definition of names in pointcut expressions.  ...  An element // link tagged with the anytype pointcut element may be matched to any type // of element link in the base model. // Enhanced matching based on semantics: An AND-fork m the pointcut // expression  ... 
doi:10.1145/1960314.1960331 dblp:conf/aosd/Mussbacher11 fatcat:j43pfoobifakfkgsyyphx7o7ja

Open Modules: Modular Reasoning About Advice [chapter]

Jonathan Aldrich
2005 Lecture Notes in Computer Science  
Advice is a mechanism used by advanced object-oriented and aspect-oriented programming languages to augment the behavior of methods in a program.  ...  Advice can help to make programs more modular by separating crosscutting concerns more effectively, but it also challenges existing ideas about modularity and separate development.  ...  In other work on formal models of AOP, Lämmel provides a big-step semantics for method-call interception in object-oriented languages [15] . Wand et al.  ... 
doi:10.1007/11531142_7 fatcat:c5oso34d7rfy5iuxs7gyggn66i

AspectLISA: An Aspect-oriented Compiler Construction System Based on Attribute Grammars

Damijan Rebernak, Marjan Mernik, Pedro Rangel Henriques, Maria João Varanda Pereira
2006 Electronical Notes in Theoretical Computer Science  
Adding aspects to LISA will lead to more reusable language specifications.  ...  Additional improvements can be achieved with aspect-oriented techniques since semantic aspects also crosscut many language constructs.  ...  Acknowledgements We would like to thank Jeff Gray for useful comments on earlier versions and Mitja Lenič for ideas and tips on implementation.  ... 
doi:10.1016/j.entcs.2006.10.003 fatcat:wlwzdaejtnfvrgxqdcyjif77vq

Temporal Assertions using AspectJ

Volker Stolz, Eric Bodden
2006 Electronical Notes in Theoretical Computer Science  
We present a runtime verification framework for Java programs. Properties can be specified in Linear-time Temporal Logic (LTL) over AspectJ pointcuts.  ...  No Java source code is necessary since AspectJ works on the bytecode level, thus even allowing instrumentation of third-party applications.  ...  From LTL to alternating automata In this section we give a finite path semantics for LTL and remind the reader on how to translate LTL formulae into alternating automata.  ... 
doi:10.1016/j.entcs.2006.02.007 fatcat:ymphyuopyfahzncox5kfe3yrhy

Aspect-oriented in-lined reference monitors

Kevin W. Hamlen, Micah Jones
2008 Proceedings of the third ACM SIGPLAN workshop on Programming languages and analysis for security - PLAS '08  
automata whose edge labels are encoded as pointcut expressions.  ...  The semantics of the language establishes a formal connection between Aspect-Oriented Programming and In-lined Reference Monitoring wherein policy specifications denote Aspect-Oriented security automata-security  ...  Acknowledgments The authors would like to thank Gopal Gupta for his comments and critiques of early drafts of this paper, and the anonymous reviewers for their contributions to the related work section  ... 
doi:10.1145/1375696.1375699 dblp:conf/pldi/HamlenJ08 fatcat:upioys3x7bgmvmo3vukubbeg5y

A static aspect language for checking design rules

Clint Morgan, Kris De Volder, Eric Wohlstadter
2007 Proceedings of the 6th international conference on Aspect-oriented software development - AOSD '07  
PDL allows succinct declarative definitions of programmatic structures which correspond to design rule violations. PDL is based on a fully static and expressive pointcut language.  ...  For many interesting design rules, current general purpose AOP languages lack the expressiveness to characterize them statically and enforce them at compile time.  ...  The formalization gave rise to some interesting insights into the semantics of ! pointcuts.  ... 
doi:10.1145/1218563.1218571 dblp:conf/aosd/MorganVW07 fatcat:apedkh2rlzal3cvmzrjhgik5fq

A Graph-Based Aspect Interference Detection Approach for UML-Based Aspect-Oriented Models [chapter]

Selim Ciraci, Wilke Havinga, Mehmet Aksit, Christoph Bockisch, Pim van den Broek
2010 Lecture Notes in Computer Science  
They require to manually model the abstract semantics for each system; or they derive the system semantics from code assuming one specific aspect-oriented language.  ...  As back-end we use a graph-based model checker, for which we have defined an operational semantics of UML diagrams, pointcuts and advice.  ...  Firstly, in our approach, we derive the formal representation of models based on the static and dynamic semantics of the UML, and on a graph based generic pointcut model.  ... 
doi:10.1007/978-3-642-16086-8_9 fatcat:pn5effouzzfklacum6zqtqqqsa

Specializing continuations a model for dynamic join points

Christopher J. Dutchyn
2007 Proceedings of the 6th workshop on Foundations of aspect-oriented languages - FOAL '07  
Pointcuts arise directly in the semantic specification as predicates identifying continuation frames.  ...  Advice models procedures operating on continuations, specializing the behaviour of continuation frames.  ...  We give a formal model of dynamic join points, pointcuts, and advice built on the well-understood processes of conversion to continuation-passing-style, and defunctionalization.  ... 
doi:10.1145/1233833.1233840 dblp:conf/foal/Dutchyn06 fatcat:gxiaujnr4berrftuntekpubmky

Foundations of incremental aspect model-checking

Shriram Krishnamurthi, Kathi Fisler
2007 ACM Transactions on Software Engineering and Methodology  
We present the theoretical underpinnings for applying modelchecking to programs (expressed as state machines) written using these mechanisms.  ...  Our technique assumes that the set of pointcut designators is known statically, but that the actual advice can vary. It handles both static and dynamic pointcut designators.  ...  Acknowledgments We are grateful to Gregor Kiczales for valuable discussions that changed the perspective of this paper.  ... 
doi:10.1145/1217295.1217296 fatcat:lbsz4gut6vdsbc4wdaqjpzhnii

Modeling Crosscutting in Aspect-Oriented Mechanisms [chapter]

Hidehiko Masuhara, Gregor Kiczales
2003 Lecture Notes in Computer Science  
The discussion in each part first outlines the core semantics to be addressed, by showing how that semantics could be embedded in the language of Section 2.  ...  This starts with an example program and an implementation of the semantics, as a modification to the implementation of Section 2.2.  ...  Some authors have proposed formal models for AO mechanisms [2, 6, 13, 20, 27] .  ... 
doi:10.1007/978-3-540-45070-2_2 fatcat:odxx6ihduncc7bxfe3rt2xyae4

A lightweight LTL runtime verification tool for java

Eric Bodden
2004 Companion to the 19th annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications - OOPSLA '04  
Implementations have been proposed so far for imperative and functional languages [5] .  ...  To our knowledge our approach is the first to allow addressing of entire sets of states, also over subclass boundaries, thus exploiting the OO nature.  ...  One can easily see that this use of pointcuts (and implicitly propositions) leads to a simple format, however maintains powerful expressiveness of our logic: We allow to reason about entire sets of states  ... 
doi:10.1145/1028664.1028776 dblp:conf/oopsla/Bodden04 fatcat:puahf6gn2fd2bmkpzxpasswuja
« Previous Showing results 1 — 15 out of 535 results