An Approach for Detecting Infeasible Paths Based on Sub-Path Expansion

WANG Hong-yang; JIANG Shu-juan; WANG Xing-ya; JU Xiao-lin; ZHANG Yan-mei

doi:10.3969/j.issn.0372-2112.2015.08.013

您当前的位置：

首页 >

文章列表页 >

An Approach for Detecting Infeasible Paths Based on Sub-Path Expansion

更新时间：2025-07-16

- An Approach for Detecting Infeasible Paths Based on Sub-Path Expansion
- Acta Electronica Sinica Vol. 43, Issue 8, Pages: 1555-1560(2015)
- 作者机构：
  
  1. 中国矿业大学计算机科学与技术学院,江苏,徐州,221116
  2. 南通大学计算机科学与技术学院,江苏,南通,226019
  3. 中国矿业大学计算机科学与技术学院,江苏,徐州,221116
  4. 南通大学计算机科学与技术学院,江苏,南通,226019
- 作者简介：
- 基金信息：
- DOI：10.3969/j.issn.0372-2112.2015.08.013
  CLC： TP311
- Published：2015
- 稿件说明：
移动端阅览
WANG Hong-yang, JIANG Shu-juan, WANG Xing-ya, et al. An Approach for Detecting Infeasible Paths Based on Sub-Path Expansion[J]. Acta Electronica Sinica, 2015, 43(8): 1555-1560.
DOI：

WANG Hong-yang, JIANG Shu-juan, WANG Xing-ya, et al. An Approach for Detecting Infeasible Paths Based on Sub-Path Expansion[J]. Acta Electronica Sinica, 2015, 43(8): 1555-1560. DOI： 10.3969/j.issn.0372-2112.2015.08.013.

摘要

不可达路径是造成软件测试资源消耗的一个重要方面.在路径测试之前

检测程序中的不可达路径可以有效节约软件测试资源.提出了一种基于子路径扩展的不可达路径静态检测方法.该方法首先生成程序的子路径集

将路径的可达性问题转换为不等式组的求解问题.使用约束求解器判断子路径的可达性

可以分为:可达子路径

不可达子路径和无法判定三个部分

并对后面两部分的子路径扩展出的路径做二次可达性检测

最终获得程序中所有路径的可达性信息.可达性检测工作主要在子路径集上进行

因此有效地解决了路径爆炸问题.实验结果表明本文方法可以准确有效地检测出程序中的不可达路径.

Abstract

Infeasible paths are one of the most important parts to cost the test resources.Before path testing

infeasible paths detecting in a program can save test resources efficiently.This paper presents a static method to detect infeasible paths which is based on sub-path expansion.First

the proposed method generates sub-path set

and the feasibility issues will be converted into inequalities.Second

the constraint solver is used to solve the inequalities

and then we can distinguish the sub-paths into three parts:one part is infeasible sub-paths

the second part is feasible sub-paths

and the third part is undetermined.The paths that are expanded from the latter two parts will be tested again to determine their feasibility.Eventually

the feasibility of all the paths is detected.Most of the detecting work is on sub-path set

so our method makes an effective solution to the path-explosion problem.Experimental results show that the proposed method can detect infeasible paths more accurately and effectively.

关键词

Keywords

references

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

The Testing and Repairing Methods for Machine Learning Model Security

MART Algorithm Based on Mirror Selection Order Optimization

Novel Evolutionary Generation Approach to Test Data for Multiple Paths Coverage

An Approach to Property-Oriented Testing of Real-Time Systems

A Method of Variable Range Analysis Based on Abstract Interpretation and Its Applications

Related Author

ZHANG Xiao-yu

SHEN Chao

LIN Chen-hao

LI Qian

WANG Qian

LI Qi

GUAN Xiao-hong

LI Zhi-bo

Related Institution

Institute for Network Sciences and Cyberspace， Tsinghua University

School of Cyber Science and Engineering， Wuhan University

Key Laboratory for Intelligent Networks and Network Security（Xi’an Jiaotong University）

School of Cyber Science and Engineering， Faculty of Electronic and Information Engineering， Xi’an Jiaotong;University

Zhongguancun Laboratory

⁰