When BDDs Fail: Conformance Testing with Symbolic Execution and SMT Solving

2010 Third International Conference on Software Testing, Verification and Validation Pub Date : 2010-04-06 DOI:10.1109/ICST.2010.48

Elisabeth Jöbstl, Martin Weiglhofer, B. Aichernig, F. Wotawa

{"title":"When BDDs Fail: Conformance Testing with Symbolic Execution and SMT Solving","authors":"Elisabeth Jöbstl, Martin Weiglhofer, B. Aichernig, F. Wotawa","doi":"10.1109/ICST.2010.48","DOIUrl":null,"url":null,"abstract":"Model-based testing is a well known technique that allows one to validate the correctness of software with respect to its model. If a lot of data is involved, symbolic techniques usually outperform explicit data enumeration. In this paper, we focus on a new symbolic test case generation technique. Our approach is based on symbolic execution and on satisfiability (modulo theory; SMT) solving. Our work was motivated by the complete failure of a well-known existing symbolic test case generator to produce any test cases for an industrial Session Initiation Protocol (SIP) implementation. Hence, we have replaced the BDD-based analysis of the existing tool with a combination of symbolic execution and SMT solving. Our new tool generates the test cases for SIP in seconds. However, further experiments showed that our approach is not a substitutive but a complementary approach: we present the technique and the results obtained for two protocol specifications, the first supporting our new technique, the second being witness for the classic BDD-technique.","PeriodicalId":192678,"journal":{"name":"2010 Third International Conference on Software Testing, Verification and Validation","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Third International Conference on Software Testing, Verification and Validation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICST.2010.48","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 14

Abstract

Model-based testing is a well known technique that allows one to validate the correctness of software with respect to its model. If a lot of data is involved, symbolic techniques usually outperform explicit data enumeration. In this paper, we focus on a new symbolic test case generation technique. Our approach is based on symbolic execution and on satisfiability (modulo theory; SMT) solving. Our work was motivated by the complete failure of a well-known existing symbolic test case generator to produce any test cases for an industrial Session Initiation Protocol (SIP) implementation. Hence, we have replaced the BDD-based analysis of the existing tool with a combination of symbolic execution and SMT solving. Our new tool generates the test cases for SIP in seconds. However, further experiments showed that our approach is not a substitutive but a complementary approach: we present the technique and the results obtained for two protocol specifications, the first supporting our new technique, the second being witness for the classic BDD-technique.

查看原文本刊更多论文

当bdd失败时:符号化执行和SMT解决的一致性测试

基于模型的测试是一种众所周知的技术，它允许人们根据其模型验证软件的正确性。如果涉及大量数据，符号技术通常优于显式数据枚举。在本文中，我们重点研究了一种新的符号测试用例生成技术。我们的方法是基于符号执行和可满足性(模理论;SMT)解决。我们的工作是由一个众所周知的现有的符号测试用例生成器的完全失败所驱动的，它无法为工业会话发起协议(SIP)实现生成任何测试用例。因此，我们已经用符号执行和SMT求解的组合取代了现有工具的基于bdd的分析。我们的新工具在几秒钟内为SIP生成测试用例。然而，进一步的实验表明，我们的方法不是一种替代方法，而是一种补充方法:我们提出了两种协议规范的技术和结果，第一个支持我们的新技术，第二个是经典bdd技术的见证。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2010 Third International Conference on Software Testing, Verification and Validation

自引率

0.00%

发文量