Grey-box checking

Edith Elkind, Biaise Genest, Doron Peled, Hongyang Qu

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

23 Scopus citations


There are many cases where we want to verify a system that does not have a usable formal model: the model may be missing, out of date, or simply too big to be used. A possible method is to analyze the system while learning the model (black box checking). However, learning may be an expensive task, thus it needs to be guided, e.g., using the checked property or an inaccurate model (adaptive model checking). In this paper, we consider the case where some of the system components are completely specified (white boxes), while others are unknown (black boxes), giving rise to a grey box system. We provide algorithms and lower bounds, as well as experimental results for this model.

Original languageEnglish
Title of host publicationFormal Techniques for Networked and Distributed Systems - FORTE 2006 - 26th IFIP WG 6.1 International Conference, Proceedings
EditorsElie Najm, Jean-François Pradat-Peyre, Véronique Viguié Donzeau-Gouge
PublisherSpringer Verlag
Number of pages16
ISBN (Print)3540462198, 9783540462194
StatePublished - 2006
Externally publishedYes
Event26th IFIP WG 6.1 International Conference - Paris, France
Duration: 26 Sep 200629 Sep 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4229 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference26th IFIP WG 6.1 International Conference


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

Cite this