Model-Based Testing of Concurrent Programs with Predicate Sequencing Constraints

Authors:
Peng Wu;Huimin Lin
Affiliations:
Graduate School of the Chinese Academy of Sciences;Institute of Software Chinese Academy of Sciences
Venue:
QSIC '05 Proceedings of the Fifth International Conference on Quality Software
Year:
2005

Citing 8
Cited 1

Model checking

Model checking
Symbolic Transition Graph with Assignment

CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
An Approach to Symbolic Test Generation

IFM '00 Proceedings of the Second International Conference on Integrated Formal Methods
Formal Test Automation: A Simple Experiment

Proceedings of the IFIP TC6 12th International Workshop on Testing Communicating Systems: Method and Applications
Formal Test Automation: The Conference Protocol with TGV/TORX

TestCom '00 Proceedings of the IFIP TC6/WG6.1 13th International Conference on Testing Communicating Systems: Tools and Techniques
Specification Analysis and Test Data Generation by Solving Boolean Combinations of Numeric Constraints

APAQS '00 Proceedings of the The First Asia-Pacific Conference on Quality Software (APAQS'00)
Test generation for radiotherapy accelerators

International Journal on Software Tools for Technology Transfer (STTT) - Special section on high-level test of complex systems
TGV: theory, principles and algorithms: A tool for the automatic synthesis of conformance test cases for non-deterministic reactive systems

International Journal on Software Tools for Technology Transfer (STTT) - Special section on high-level test of complex systems

Symbolic test generation using a temporal logic with constrained events

Formal methods and hybrid real-time systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

A predicate sequencing constraint logic(PSCL) is proposed to represent test purpose for testing of concurrent programs. The advantage of PSCL rests in its capability of expressing not only sequencing relationships among I/O events, but also data dependencies between event parameters. A PSCL-based symbolic test case generation method is also proposed to automatically derive symbolic test cases that incorporate given data dependency constraints as verdict conditions.Themethod works in a syntactic way without referring to concrete program states and the derived test cases allow for dynamic test data selection according to the response from the software under test. A case study shows the PSCL-based test case generation can achieve transition coverage with smaller number of test steps.