一句话：针对自动化测试中的 Web 表单填充，提出能突破字符串求解器局限的通用约束求解方法。
自动化测试 Web 应用时，填充并提交表单是关键环节。表单字段通常带有约束以防止无效输入，现有测试生成器（如 Black Ostrich）能识别字段期望模式，并用正则实例生成器和/或字符串约束求解器来满足约束；但字符串求解器仅能处理字符串，难以覆盖其他类型或更一般的约束。本文提出一种通用的 Web 表单约束求解方法，旨在扩展可求解的约束范围。摘要未报告具体实验与结果。
When creating automated tests for web applications, one major part is filling and submitting web forms. Filling out forms automatically is challenging, as form fields would typically be subject to specific constraints that prevent entry of invalid data. Modern test generators, such as the recently proposed Black Ostrich scanner, are already capable of identifying expected patterns for form values and solve them, using instance generators for regular expressions and/or string constraint solvers. String solvers, however, are limited to, well, strings.
DOI 原文 ·
@inproceedings{paperbot8425,
title = {A Generalized Approach for Solving Web Form Constraints},
author = {Björn Karthein and Cristian-Alexandru Staicu and Andreas Zeller},
booktitle = {ASE},
year = {2024},
doi = {10.1145/3691620.3695600}
}