Black box checking

D. Peled, M. Y. Vardi, M. Yannakakis

Research output: Contribution to journalArticlepeer-review


Two main approaches are used for increasing the quality of systems: in model checking, one checks properties of a known design of a system; in testing, one usually checks whether a given implementation, whose internal structure is often unknown, conforms with an abstract design. We are interested in the combination of these techniques. Namely, we would like to be able to test whether an implementation with unknown structure satisfies some given properties. We propose and formalize this problem of black box checking and suggest several algorithms. Since the input to black box checking is not given initially, as is the case in the classical model of computation, but is learned through experiments, we propose a computational model based on games with incomplete information. We use this model to analyze the complexity of the problem. We also address the more practical question of finding an approach that can detect errors in the implementation before completing an exhaustive search
Original languageAmerican English
Pages (from-to)225-246
JournalJournal of Automata, Languages and Combinatorics
Issue number2
StatePublished - 2002


Dive into the research topics of 'Black box checking'. Together they form a unique fingerprint.

Cite this