中文摘要：

最近，严峻的技术基于动态探索，它试着自动地行使每个可能的用户连接元素，广泛地被用来便于充分严峻的网应用程序。大多数如此的严峻的工具是在处理顾客方面脚本上由于他们的强调由形式相互作用在到达动态页导致不管多么不有效。在这份报纸，我们在场完成完整的形式测试并且造一个自动化测试模型的组合策略。我们建议一个算法叫了与限制(PTC ) 测试实现策略的 pairwise。我们的 PTC 算法使用 pairwise 范围并且处理语义限制和不合法的价值的问题。我们实现了原型工具 ComjaxTest 并且在五网应用上进行了实验研究。当比测试算法的一般 pairwise 完成动态页的一篇更高的报道时，试验性的结果显示我们的 PTC 算法产生更少的形式测试用例。另外，我们的 ComjaxTest 产生一个相对完全的测试模型然后在时间的合理数量检测更多的差错，作为与基于动态探索的另外的存在工具相比。

英文摘要：

Recently, testing techniques based on dynamic exploration, which try to automatically exercise every possible user interface element, have been extensively used to facilitate fully testing web applications. Most of such testing tools are however not effective in reaching dynamic pages induced by form interactions due to their emphasis on handling client-side scripting. In this paper, we present a combinatorial strategy to achieve a full form test and build an automated test model. We propose an algorithm called pairwise testing with constraints （PTC） to iraplement the strategy. Our PTC algorithm uses pairwise coverage and handles the issues of semantic constraints and illegal values. We have implemented a prototype tool ComjaxTest and conducted an empirical study on five web applications. Experimental results indicate that our PTC algorithm generates less form test cases while achieving a higher coverage of dynamic pages than the general pairwise testing algorithm. Additionally, our ComjaxTest generates a relatively complete test model and then detects more faults in a reasonable amount of time, as compared with other existing tools based on dynamic exploration.