zhang01

12 2011 档案

Coverage Guided Systematic Concurrency Testing
摘要:Main idea:This paperhas proposed a coverage-guided systematic concurrency testing algorithm, where ordering constraints learned from the good test runs are used to guide the selection of high-risk interleavings for future test execution. We propose HaPSets to capture these ordering constraints and u 阅读全文

posted @ 2011-12-17 22:24 zhanghs 阅读(325) 评论(0) 推荐(0)

Mining Message Sequence Graphs(ICSE2011)
摘要:本文的主要思想:Mining program behavior from execution traces is difficult for concurrent/distributed programs. Specifically, the inherent partial order relationships among events occurring across processes pose a big challenge to specification mining.In this paper, we propose a framework for mining partial 阅读全文

posted @ 2011-12-13 20:36 zhanghs 阅读(365) 评论(0) 推荐(0)

Structural coverage of feasible code(AST ’10, May 3-4, 2010, Cape Town, South Africa)
摘要:本文的主要思想是: 通过判断和修剪不可达分支,找到一种新的结构测试技术,以提高程序结构测试的覆盖度和结构测试测量的精确度。为此,我们把动态分析、concolic execution和abstraction refinemen结合起来以克服传统方法的局限性。动态分析监视测试的执行以确定程序状态空间中被覆盖的元素和可达路径,concolic execution计算路径约束以确定如何遍历未被覆盖的路径和元素,并对路径约束进行求解以生成测试这些未覆盖路径的测试用例,Abstraction refinement修剪哪些不满足路径约束的不可达元素。不可达元素的定义:原文 An element is ide 阅读全文

posted @ 2011-12-11 10:01 zhanghs 阅读(231) 评论(0) 推荐(1)

Hybrid Concolic Testing(ICSE'07)
摘要:一、本文的主要思想:提出hybrid concolic testing,它交互使用random tests和 concolic tests以达到对程序状态空间的较深和较广的搜索。程序初始执行时,hybrid concolic testing执行random tests,当random tests达到饱和状态时(It does not produce any new coverage points after running some predetermined number of steps),算法自动从从当前的程序状态切换到concolic execution,对未搜索的点进行限定深度的详尽 阅读全文

posted @ 2011-12-04 08:53 zhanghs 阅读(853) 评论(0) 推荐(0)

导航