ISCAS OpenIR  > 基础软件与系统重点实验室
a constraint solver and its application to path feasibility analysis
Zhang Jian; Wang Xiaoxu
2001
发表期刊International Journal of Software Engineering & Knowledge Engineering
卷号11期号:2页码:139-156
摘要Many testing methods are based on program paths. A well-known problem with them is that some paths are infeasible. To decide the feasibility of paths, we may solve a set of constraints. In this paper, we describe constraint-based tools that can be used for this purpose. They accept constraints expressed in a natural form, which may involve variables of different types such as integers, Booleans, reals and fixed-size arrays. The constraint solver is an extension of a Boolean satisfiability checker and it makes use of a linear programming package. The solving algorithm is described, and examples are given to illustrate the use of the tools. For many paths in the testing literature, their feasibility can be decided in a reasonable amount of time.
收录类别ei,sci,istp
关键词Constraint Solving Test Data Generation Infeasible Paths Arrays
部门归属计算机科学国家重点实验室
语种英语
WOS记录号WOS:000169185000003
引用统计
内容类型期刊论文
URI标识http://ir.iscas.ac.cn/handle/311060/3176
专题基础软件与系统重点实验室
推荐引用方式
GB/T 7714
Zhang Jian,Wang Xiaoxu. a constraint solver and its application to path feasibility analysis[J]. International Journal of Software Engineering & Knowledge Engineering,2001,11(2):139-156.
APA Zhang Jian,&Wang Xiaoxu.(2001).a constraint solver and its application to path feasibility analysis.International Journal of Software Engineering & Knowledge Engineering,11(2),139-156.
MLA Zhang Jian,et al."a constraint solver and its application to path feasibility analysis".International Journal of Software Engineering & Knowledge Engineering 11.2(2001):139-156.
条目包含的文件
文件名称/大小 文献类型 版本类型 开放类型 使用许可
20011102139.pdf(254KB) 开放获取--请求全文
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Zhang Jian]的文章
[Wang Xiaoxu]的文章
百度学术
百度学术中相似的文章
[Zhang Jian]的文章
[Wang Xiaoxu]的文章
必应学术
必应学术中相似的文章
[Zhang Jian]的文章
[Wang Xiaoxu]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。