Conformance testing of boolean programs with multiple faults

Authors:
Pavithra Prabhakar;Mahesh Viswanathan
Affiliations:
California Institute of Technology, USA,IMDEA Software Institute;University of Illinois at Urbana-Champaign
Venue:
FMOODS'12/FORTE'12 Proceedings of the 14th joint IFIP WG 6.1 international conference and Proceedings of the 32nd IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
Year:
2012

Citing 9
Cited 0

Conformance testing methodologies and architectures for OSI protocols

Conformance testing methodologies and architectures for OSI protocols
Switching and Finite Automata Theory: Computer Science Series

Switching and Finite Automata Theory: Computer Science Series
A Formal Approach to Conformance Testing

Proceedings of the IFIP TC6/WG6.1 Sixth International Workshop on Protocol Test systems VI
Black box checking

Journal of Automata, Languages and Combinatorics - Selected papers of the workshop on logic and algebra for concurrency
Visibly pushdown languages

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Conformance testing in the presence of multiple faults

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Analysis of recursive state machines

ACM Transactions on Programming Languages and Systems (TOPLAS)
On the correspondence between conformance testing and regular inference

FASE'05 Proceedings of the 8th international conference, held as part of the joint European Conference on Theory and Practice of Software conference on Fundamental Approaches to Software Engineering
Minimization, learning, and conformance testing of boolean programs

CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Conformance testing is the problem of constructing a complete test suite of inputs based on a specification S such that any implementation I (of size less than a given bound) that is not equivalent to S gives a different output on the test suite than S. Typically I and S are assumed to be some type of finite automata. In this paper we consider the problem of constructing test suites for boolean programs (or more precisely modular visibly pushdown automata) that are guaranteed to catch all erroneous implementations that have at least R faults, and pass all correct implementations; if the incorrect implementation has fewer than R faults then the test suite may or may not detect it. We present a randomized algorithm for the construction of such test suites, and prove the near optimality of our test suites by proving lower bounds on the size of test suites.