CPOT-SM – Complete Property-oriented Testing with Symbolic Methods

CPOT-SM – 使用符号方法完成面向属性的测试

• 批准号: 407708394
• 负责人: Professor Dr. Jan Peleska
• 金额: --
• 依托单位: Technologie-Zentrum Informatik und Informationstechnik (TZI)
• 依托单位国家: 德国
• 项目类别: Research Grants
• 财政年份: 2019
• 资助国家: 德国
• 起止时间: 2018-12-31 至 2022-12-31
• 项目状态: 已结题
• 来源: https://gepris.dfg.de/gepris/projekt/407708394?language=en
• 关键词: CPOT; SM; Complete; Property; oriented

Complete testing methods provide test suite generation techniques with guaranteed fault coverage under certain hypotheses about the system under test (SUT). While they have always been considered as an interesting research field, their practical applicability has often been questioned, due to the unmanageable test suite sizes to be applied when wishing to achieve full fault coverage under realistic hypotheses. This situation has changed during the last years, since it could be shown that equivalence class partition techniques could be applied to industrial-size SUTs.In this project, we plan to exploit these recent results in the context of property-oriented testing (POT). In contrast to general model-based testing (MBT), POT focuses on the thorough test of single SUT requirements only. As a consequence, POT does not require complete models describing the expected behavior of the SUT but can be based on (1) specifications stated in temporal logics, (2) partial models, or (3) abstracted models. Therefore, the costs for enabling SUT verification by POT are usually lower than the costs for a full MBT approach. On the downside, there is currently no comprehensive theory of completeness for testing against properties. It is therefore a main objective of this project to elaborate new approaches to POT allowing to generate test suites with guaranteed fault coverage. This will be achieved by means of a mixed approach involving both models and temporal logics specifications. To cope with the state space complexity of the models, symbolic methods will be applied, where concrete inputs, outputs, and SUT states are replaced by first-order formulas identifying input, output, and state classes. As an additional challenge, we will investigate POT in the context of autonomous systems. Since POT has close links to MBT, a supporting work package will focus on complete model-based testing theories for systems with infinite domains for inputs, internal states, and outputs. A further work package will investigate the problem of configurable systems as in product line testing and extend the existing equivalence class theory to configuration parameters. The CPOT-SM research results will be implemented as an experimental prototype in an existing industrial-strength MBT tool. The elaborated methods will be validated in this tool framework in case studies to be conducted with international research partners. The case studies cover the fields avionics, railways, autonomous vehicles, and robotics.

完备测试方法为测试用例集生成技术提供了在被测系统（SUT）的某些假设下保证故障覆盖率的方法。虽然他们一直被认为是一个有趣的研究领域，其实际适用性经常受到质疑，由于难以管理的测试套件的大小时，希望在现实的假设下实现完整的故障覆盖率。这种情况已经改变，在过去的几年中，因为它可以表明，等价类划分技术可以应用于工业规模的SUTs.In这个项目中，我们计划利用这些最新的成果的背景下，面向属性的测试（POT）。与一般的基于模型的测试（MBT）不同，POT只关注于对单个SUT需求的全面测试。因此，POT不需要描述SUT预期行为的完整模型，但可以基于（1）时态逻辑中规定的规范，（2）部分模型，或（3）抽象模型。因此，通过POT进行SUT验证的成本通常低于完全MBT方法的成本。不利的一面是，目前还没有全面的完备性理论来测试属性。因此，这是一个主要的目标，这个项目阐述新的方法，POT允许生成测试套件，保证故障覆盖率。这将通过涉及模型和时序逻辑规范的混合方法来实现。 为了科普模型的状态空间复杂性，将应用符号方法，其中具体的输入，输出和SUT状态被替换为一阶公式，识别输入，输出和状态类。作为一个额外的挑战，我们将在自治系统的背景下研究POT。由于POT与MBT有着密切的联系，因此支持工作包将重点关注具有无限输入、内部状态和输出域的系统的完整的基于模型的测试理论。进一步的工作包将调查的问题，可配置系统的产品线测试和扩展现有的等价类理论的配置参数。 CPOT-SM的研究结果将在现有的工业强度MBT工具中作为实验原型实施。将在与国际研究伙伴进行的案例研究中，在这一工具框架中验证所拟订的方法。案例研究涵盖航空电子设备、铁路、自动驾驶汽车和机器人技术等领域。