首页 | 本学科首页   官方微博 | 高级检索  
     

面向方面程序的简化动态依赖图切片方法
引用本文:张广泉,黄静,章晓芳,刘长林. 面向方面程序的简化动态依赖图切片方法[J]. 计算机科学与探索, 2011, 5(3): 229-237. DOI: 10.3778/j.issn.1673-9418.2011.03.004
作者姓名:张广泉  黄静  章晓芳  刘长林
作者单位:1. 苏州大学,计算机科学与技术学院,江苏,苏州,215006;中国科学院,软件研究所,计算机科学国家重点实验室,北京,100190
2. 苏州大学,计算机科学与技术学院,江苏,苏州,215006
3. 苏州大学,计算机科学与技术学院,江苏,苏州,215006;南京大学,计算机软件新技术国家重点实验室,南京,210093
基金项目:The National Natural Science Foundation of China under Grant No.60973149,the Open Funds of State Key Laboratory of Computer Science of Chinese Academy of Sciences under Grant No.SYSKF0908,the Natural Science Foundation of Jiangsu Higher Education Institutions of China under Grant No.08KJB520010
摘    要:程序切片是一种重要的程序分析技术,广泛应用于程序的调试、测试与维护等领域。面向方面程序设计作为一种新的软件开发范型,能够实现横切关注点的模块化,其特有的语言元素和功能为切片增加了难度。从静态切片和动态切片两种类型,讨论了面向方面程序切片技术。在此基础上,提出了一种基于简化动态依赖图的面向方面程序切片方法,可以减少动态依赖图中节点和边的数量,生成准确的面向方面程序的动态切片,从而有助于人们更好地对面向方面程序进行分析和理解。

关 键 词:面向方面程序  静态切片  动态切片  简化动态依赖图
修稿时间: 

Slicing of Aspect-Oriented Programs Based on Reduced Dynamic Dependence Graph
ZHANG Guangquan,HUANG Jing,ZHANG Xiaofang,LIU Changlin. Slicing of Aspect-Oriented Programs Based on Reduced Dynamic Dependence Graph[J]. Journal of Frontier of Computer Science and Technology, 2011, 5(3): 229-237. DOI: 10.3778/j.issn.1673-9418.2011.03.004
Authors:ZHANG Guangquan  HUANG Jing  ZHANG Xiaofang  LIU Changlin
Affiliation:1. School of Computer Science and Technology, Soochow University, Suzhou, Jiangsu 215006, China 2. State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100190, China 3. State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing 210093, China
Abstract:Program slicing is an important technique for program analysis, which has many applications in various fields such as program debugging, testing, maintenance, etc. Aspect-oriented program is a new software development paradigm that enables modular implementation of cross-cutting concerns, and poses difficulties for slicing of aspect-oriented programs. From the two types: static slicing and dynamic slicing, a systematic analysis of the researches on slicing of aspect-oriented programs is conducted, and a dynamic slicing method of aspect-oriented programs based on reduced dynamic dependence graph is proposed, which can reduce the number of nodes and edges of dynamic dependence graph. The generated dynamic slice is accurate that helps people to better understand aspect-oriented programs.
Keywords:aspect-oriented program  static slicing  dynamic slicing  reduced dynamic dependence graph
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机科学与探索》浏览原始摘要信息
点击此处可从《计算机科学与探索》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号