| 基于文法分支覆盖的短句子生成算法 |
| 其他题名 | algorithm for generating short sentences from grammars based on branch coverage criterion
|
| 郑黎晓; 许智武; 陈海明
|
| 2011
|
| 发表期刊 | 软件学报
 |
| ISSN | 1000-9825
|
| 卷号 | 22期号:11页码:2564-2576 |
| 摘要 | 提出一种上下文无关文法的句子生成算法.对于给定文法,算法生成一个满足该文法分支覆盖准则的句子集.结合长度控制、冗余消除和句子集规模控制等策略,使得生成的句子较短、无冗余、句子集规模较小.考察了算法在基于文法的软件系统的测试数据生成方面的应用情况.实验结果表明,该算法生成的测试数据具有较强的程序揭错能力,并且能够帮助测试人员提高测试速度. |
| 收录类别 | CNKI
; EI
; WANFANG
|
| 其他摘要 | This paper presents a sentence generation algorithm, which takes as input a context-free grammar and produces a set of sentences that achieves branch coverage for the grammar. The algorithm incorporates length control, redundancy elimination, and sentence-set size control strategies into a sentence generation process such that the generated sentences are short and simple, and the sentence set is small with no redundancy. The paper also investigates the application of this algorithm to test data generation for grammar-based systems. Experimental results show that the generated test data not only has high fault detection ability, but can also help testers improve the testing speed. © Copyright 2011, Institute of Software, the Chinese Academy of Sciences. All rights reseved. |
| 关键词 | 上下文无关文法
句子生成
分支覆盖
长度控制
|
| 部门归属 | 中国科学院软件研究所计算机科学国家重点实验室;中国科学院研究生院;
|
| 资助者 | 国家自然科学基金(61070038,60573013)
|
| 语种 | 中文
|
| 内容类型 | 期刊论文
|
| URI标识 | http://ir.iscas.ac.cn/handle/311060/16034
|
| 专题 | 中国科学院软件研究所
|
推荐引用方式
GB/T 7714 |
郑黎晓,许智武,陈海明. 基于文法分支覆盖的短句子生成算法[J]. 软件学报,2011,22(11):2564-2576.
|
| APA |
郑黎晓,许智武,&陈海明.(2011).基于文法分支覆盖的短句子生成算法.软件学报,22(11),2564-2576.
|
| MLA |
郑黎晓,et al."基于文法分支覆盖的短句子生成算法".软件学报 22.11(2011):2564-2576.
|
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论