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.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Alur, R., Benedikt, M., Etessami, K., Godefroid, P., Reps, T., Yannakakis, M.: Analysis of Recursive State Machines. ACM Transactions on Programming Languages and Systems 27(4), 786–818 (2005)
Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Proceedings of the ACM Symposium on Theory of Computation, pp. 202–211 (2004)
Berg, T., Grinchtein, O., Jonsson, B., Leucker, M., Raffelt, H., Steffen, B.: On the Correspondence Between Conformance Testing and Regular Inference. In: Cerioli, M. (ed.) FASE 2005. LNCS, vol. 3442, pp. 175–189. Springer, Heidelberg (2005)
Friedman, A., Menon, P.: Fault Detection in Digital Circuits. Prentice Hall (1971)
Groce, A., Peled, D., Yannakakis, M.: Adaptive model checking. Logic Journal of the IGPL 14(5), 729–744 (2006)
Kohavi, Z.: Switching and Finite Automata Theory. McGraw Hill (1978)
Kumar, V., Madhusudan, P., Viswanathan, M.: Minimization, Learning, and Conformance Testing of Boolean Programs. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 203–217. Springer, Heidelberg (2006)
Kumar, V., Viswanathan, M.: Conformance testing in the presence of multiple faults. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pp. 1136–1145 (2005)
Lee, D., Yannakakis, M.: Principles and methods of testing finite state machines; A survey. Proceedings of the IEEE 84, 1090–1126 (1996)
Linn, R., Üyar, M. (eds.): Conformance Testing methodologies and architechtures for OSI protocols. IEEE Computer Society Press (1995)
Moore, E.F.: Gedanken-experiments on sequential machines. Automata Studies, Annals of Mathematics Studies 34, 129–153 (1956)
Peled, D., Vardi, M., Yannakakis, M.: Black Box Checking. Journal of Automata, Languages, and Combinatorics 7(2), 225–246 (2002)
Tretmans, J.: A formal approach to conformance testing. In: Protocol Test Systems. IFIP Transactions, vol. C-19, pp. 257–276 (1994)
Vasilevskii, M.P.: Fault diagnosis of automata. Kibernetika 4, 98–108 (1973)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 IFIP International Federation for Information Processing
About this paper
Cite this paper
Prabhakar, P., Viswanathan, M. (2012). Conformance Testing of Boolean Programs with Multiple Faults. In: Giese, H., Rosu, G. (eds) Formal Techniques for Distributed Systems. FMOODS FORTE 2012 2012. Lecture Notes in Computer Science, vol 7273. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30793-5_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-30793-5_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30792-8
Online ISBN: 978-3-642-30793-5
eBook Packages: Computer ScienceComputer Science (R0)