Skip Navigation

IEICE Transactions on Information and Systems 2007 E90-D(5):799-807; doi:10.1093/ietisy/e90-d.5.799
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Request Permissions
Google Scholar
Right arrow Articles by YAGI, I.
Right arrow Articles by SEKI, H.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Copyright © 2007 The Institute of Electronics, Information and Communication Engineers

Regular Section -- Papers -- Automata and Formal Language Theory

A Labeled Transition Model A-LTS for History-Based Aspect Weaving and Its Expressive Power

Isao YAGI1, Yoshiaki TAKATA1 and Hiroyuki SEKI1

1 The authors are with the Graduate School of Information Science, Nara Institute of Science and Technology, Ikoma-shi, 630–0101 Japan. E-mail: isao-y{at}is.naist.jp, E-mail: y-takata{at}is.naist.jp and E-mail: seki{at}is.naist.jp


  Abstract

This paper proposes an event-based transition system called A-LTS. An A-LTS is a simple system consisting of two agents, a basic program and a monitor. The monitor observes the behavior of the basic program and if the behavior matches some pre-defined pattern, then the monitor interrupts the execution of the basic program and possibly triggers the execution of another specific program. An A-LTS models a common feature found in recent software technologies such as Aspect-Oriented Programming (AOP), history-based access control and active database. We investigate the expressive power of A-LTS and show that it is strictly stronger than finite state machines and strictly weaker than pushdown automata (PDA). This implies that the model checking problem for A-LTS is decidable. It is also shown that the expressive power of A-LTS, linear context-free grammar and deterministic PDA are mutually incomparable. We also discuss the relationship between A-LTS and pointcut/advice in AOP.

Key Words: labeled transition system, pushdown automaton, formal model, aspect-oriented programming, AspectJ

Manuscript received August 3, 2006. Manuscript revised December 1, 2006.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.