首页> 外文OA文献 >Dynamic Slicing of Object-Oriented and Aspect-Oriented Softwares
【2h】

Dynamic Slicing of Object-Oriented and Aspect-Oriented Softwares

机译:面向对象和面向方面的软件的动态切片

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

Slicing is generally based on program code. An alternative approach to compute the slice is from specifications developed using formalism such as Unified Modeling Languages(UML). UML is widely used for object-oriented modeling and design. In our research, we focus on UML communication diagram to compute the dynamic slices. We first develop a suitable intermediate representation for communication diagram named as Communication Dependence Graph (CoDG). Then, we propose two dynamic slicing algorithms. We have named the first algorithm edge marking dynamic slicing algorithm for communnication diagram (EMACD) and the second node-marking dynamic slicing algorithm for communnication diagram (NMACD). We have implemented our algorithms and also calculated the space and time complexity. Aspect-oriented Programming (AOP) is a recent programming paradigm that focuses on modular implementations of various crosscutting concerns. In our research, we proposed a technique for dynamic slicing of aspect-oriented software based on the UML communication diagram. Next, we generate an intermediate representation from the communication diagram which we named as Communication Aspect Dependency Graph (CADG). Then, we proposed an edge marking dynamic slicing algorithm named as Aspect-Oriented Edge Marking Algorithm (AOEM). The novelty in our approach is that we present the communication diagram for the aspect-oriented software. We have implemented the algorithm and also found the space and time complexity of the algorithm.
机译:切片通常基于程序代码。计算切片的另一种方法是使用形式化的规范(例如统一建模语言(UML))开发的规范。 UML被广泛用于面向对象的建模和设计。在我们的研究中,我们专注于UML通信图以计算动态切片。我们首先为通信图开发一个合适的中间表示,称为通信依赖图(CoDG)。然后,我们提出了两种动态切片算法。我们将第一个用于通信图的边缘标记动态切片算法(EMACD)命名为第二个用于通信图的节点标记动态切片算法(NMACD)。我们已经实现了算法,还计算了时空复杂度。面向方面的编程(AOP)是最近的编程范例,重点关注各种横切关注点的模块化实现。在我们的研究中,我们提出了一种基于UML通信图的面向方面软件的动态切片技术。接下来,我们从通讯图中生成一个中间表示,我们将其称为通讯方面依赖图(CADG)。然后,我们提出了一种边缘标记动态切片算法,称为面向方面的边缘标记算法(AOEM)。我们方法的新颖之处在于,我们提供了面向方面软件的通信图。我们已经实现了该算法,还发现了该算法的时空复杂性。

著录项

  • 作者

    Mishra Alina;

  • 作者单位
  • 年度 2013
  • 总页数
  • 原文格式 PDF
  • 正文语种
  • 中图分类

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号