用于程序开发的改进的有条件切片算法

Improved Conditioned Slicing Algorithm for Program Development

为了加速软件开发,提高软件质量,本文针对开发过程提出了一种改进的有条件切片算法。该算法改造了程序控制流程图,扩充了程序数据依赖定义,按照条件切片的一阶逻辑谓词缩减目标程序,并用扩充后的数据依赖计算有条件程序切片。在程序编码阶段,该算法能够抽取需要关注的代码段给开发人员,并能利用边的信息计算出程序的路径数目,从而为开发人员发现软件缺陷、冗余提供了有利的支撑。

An improved conditioned slicing algorithm is proposed for accelerating program development and better software quality. The algorithm adds negative edges for branch and loop predicts, reconstructs CFG. Then it extends data dependence concepts and reduces program size by logical equality. At last it computes the conditioned slice. During program development, the algorithm can extract application parts of developers interesting, and easily compute numbers of path by different edges. So it gives developers a good support for raising correctness and reducing developing time.