Grey-box checking

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4229 LNCS, Issue , 2006, Pages 420-435

  Elkind, Edith ^a   Genest, Biaise ^a,b   Peled, Doron ^a   Qu, Hongyang ^a,c  

^a UNIVERSITY OF WARWICK   (United Kingdom)

^b CAMPUS DE BEAULIEU   (France)

^c AIX MARSEILLE UNIV   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES; FORMAL LOGIC; LEARNING SYSTEMS; FORMAL METHODS;

BLACK BOX CHECKING; FORMAL MODELS; SYSTEM COMPONENTS; ADAPTIVE MODELING; BLACK BOXES; FORMAL MODEL; GREY-BOX; LOWER BOUNDS; WHITE BOX;

SYSTEMS ANALYSIS; MODEL CHECKING;

EID: 33750542702     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11888116_30     Document Type: Conference Paper

References (16)

1. R. Alur, P. Madhusudan, and W. Nam. Symbolic Compositional Verification by Learning Assumptions. In CAV'05, LNCS, 2005.
2. D. Angluin. Learning Regular Sets from Queries and Counterexamples. Information and Computation, 75, 87-106 (1987).
3. R. Alur, R. Grosu and M. McDougall. Efficient Reachability Analysis of Hierarchical Reactive Machines In CAV'00, LNCS 1855, p.280-295, 2000.
4. E. M. Clarke, O. Grumberg, D. Peled, Model Checking, MIT Press, 1999.
5. E. Clarke, D. Long, K. McMillan. Compositional Model Checking. In LICS'89, IEEE, p.353-362, 1989.
6. T.S. Chow. Testing software design modeled by finite-states machines. In IEEE transactions on software engineering, SE-4, 1978, 178-187.
7. J. Cobleigh, D. Giannakopoulou, C. Pasareanu. Learning Assumptions for Compositional Verification. In TACAS'03, LNCS 2619, p.331-346, 2003.
8. E. Elkind, B. Genest, D. Peled and H. Qu. Grey-Box Checking. Internal Report, available at http;//www.crans.org/genest/EGPQ.ps.
9. A. Groce, D. Peled and M. Yannakakis. Adaptive Model Checking. In TACAS'02, LNCS 2280, p.357-370, 2002.
10. A. Mazurkiewicz, Trace Semantics, Proceedings of Advances in Petri Nets, 1986, Bad Honnef, Lecture Notes in Computer Science, Springer Verlag, 279-324, 1987.
11. E. Ochmanski, Languages and Automata, in The Book of Traces, V. Diekert, G. Rozenberg (eds.), World Scientific, 167-204.
12. D. Peled, M. Vardi and M. Yannakakis. Black Box Checking. In FORTE/PSTV'99, 1999.
13. R. Rivest and R. Schapire. Inference of Finite Automata Using Homing Sequences. Information and Computation, 103(2), p.299-347, 1993.
14. M.P. Vasilevskii. Failure diagnosis of automata. Kibertetika, no 4, p.98-108, 1973.
15. W. Weimer and G. Necula Mining Temporal Specifications for Error Detection. In TACAS'05, LNCS 3440, p.461-476, 2005.
16. G. Xie and Z. Dang. Testing Systems of Concurrent Black-boxes - an Automata-Theoretic and Decompositional Approach. In FATES'05, LNCS, 2005.