Using model checking for reducing the cost of test generation

Authors:
Hyoung Seok Hong;Hasan Ural
Affiliations:
Concordia Institute for Information Systems Engineering, Concordia University;School of Information Technology and Engineering, University of Ottawa
Venue:
FATES'04 Proceedings of the 4th international conference on Formal Approaches to Software Testing
Year:
2004

Citing 17
Cited 2

Selecting Software Test Data Using Data Flow Information

IEEE Transactions on Software Engineering
Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
Test Data Selection and Quality Estimation Based on the Concept of Essential Branches for Path Testing

IEEE Transactions on Software Engineering
The temporal logic of reactive and concurrent systems

The temporal logic of reactive and concurrent systems
Unconstrained edges and their application to branch analysis and testing of programs

Journal of Systems and Software
Dominators, super blocks, and program coverage

POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Automatic Generation of Path Covers Based on the Control Flow Analysis of Computer Programs

IEEE Transactions on Software Engineering
Unconstrained duals and their use in achieving all-uses coverage

ISSTA '96 Proceedings of the 1996 ACM SIGSOFT international symposium on Software testing and analysis
Reducing and estimating the cost of test coverage criteria

Proceedings of the 18th international conference on Software engineering
How many paths are needed for branch testing?

Journal of Systems and Software - Special issue on software reliability issues
Software unit test coverage and adequacy

ACM Computing Surveys (CSUR)
Test development for communication protocols: towards automation

Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue on advanced topics on SDL and MSC
Coverage Metrics for Functional Validation of Hardware Designs

IEEE Design & Test
A Temporal Logic Based Theory of Test Coverage and Generation

TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Data flow testing as model checking

Proceedings of the 25th International Conference on Software Engineering
A Data Flow Oriented Program Testing Strategy

IEEE Transactions on Software Engineering
Test generation based on control and data dependencies within system specifications in SDL

Computer Communications

Reducing test sequence length using invertible sequences

ICFEM'07 Proceedings of the formal engineering methods 9th international conference on Formal methods and software engineering
Dependence testing: extending data flow testing with control dependence

TestCom'05 Proceedings of the 17th IFIP TC6/WG 6.1 international conference on Testing of Communicating Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a method for reducing the cost of test generation. A spanning set for a coverage criterion is a set of entities such that exercising every entity in the spanning set guarantees exercising every entity defined by the coverage criterion. The central notion used in constructing a minimum spanning set is subsumption relation. An entity subsumes another entity if exercising the former guarantees exercising the latter. We develop a method for finding subsumption relations which can be uniformly applied to a family of control flow and data flow oriented coverage criteria by reducing the problem of determining whether an entity subsumes another entity to the model checking problem of the linear temporal logic LTL.