paperbot · PL 论文追踪

全部论文 待读 收藏

P2 Finding the shortest path to reproduce a failure found by TESTAR

寻找复现 TESTAR 所发现失败的最短路径
FSE Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering2019匹配度 1/10 · 该论文关注 GUI 自动化测试中失败复现的最短路径,属于软件测试与调试方向;与研究画像的核心兴趣(静态分析、PL 与 AI 结合、浮点程序分析、贝叶斯程序分析)均无直接关联。引用 3 inbox
Olivia Rodriguez Valdes
crossref: 2026-09-12

AI 速览

一句话:提出一种在 TESTAR 的 GUI 测试图中寻找最短失败复现路径的初步方法。

TESTAR 是一款基于 GUI 的自动化测试工具,在自动探索界面时进行动态分析,并在执行过程中生成测试序列。它把测试相关信息保存到图数据库中,可用遍历语言在测试中或测试后查询与遍历。由 TESTAR 发现的失败,其测试序列可能过长,给失败根因分析带来困难。本文提出一种初步方法,旨在从这些测试信息中找到能够复现该失败的最短路径,从而缩短并简化失败复现与后续调试。摘要未报告具体实验评估。

问题
TESTAR 找到失败时生成的测试序列可能过长,导致根因分析困难,因此需要找到能够复现该失败的最短路径。
方法
利用 TESTAR 存储测试信息的图数据库及其遍历语言,提出一种寻找最短失败复现路径的初步方法。
评估
摘要仅描述初步方案,未给出具体实验评估或结果。
原文摘要(Abstract)

TESTAR is a tool for automated testing via the GUI. It uses dynamic analysis during automated GUI exploration and generates the test sequences during the execution. TESTAR saves all kind of information about the tests in a Graph database that can be queried or traversed during or after the tests using a traversal language. Test sequences leading to a failure can be excessively long, making the root-cause analysis of the failure difficult. This paper proposes an initial approach to find the shortest path to reproduce an error found by TESTAR

链接与引用

DOI 原文 ·

BibTeX
@inproceedings{paperbot5065,
  title = {Finding the shortest path to reproduce a failure found by TESTAR},
  author = {Olivia Rodriguez Valdes},
  booktitle = {FSE},
  year = {2019},
  doi = {10.1145/3338906.3342496}
}