Minimization, learning, and conformance testing of boolean programs

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

Volumn 4137 LNCS, Issue , 2006, Pages 203-217

  Kumar, Viraj ^a   Madhusudan, P ^a   Viswanathan, Mahesh ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; LEARNING SYSTEMS; RECURSIVE FUNCTIONS; THEOREM PROVING;

CONFORMANCE TESTING; RECURSIVE STATE MACHINES (RSM); SEQUENTIAL IMPERATIVE PROGRAMS;

BOOLEAN ALGEBRA;

EID: 33749563571     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11817949_14     Document Type: Conference Paper

References (25)

1. R. Alur, M. Benedikt, K. Etessami, P. Godefroid, T. W. Reps, and M. Yannakakis. Analysis of recursive state machines. TOPLAS, 27(4):786-818, 2005.
2. R. Alur, P. Cerný, P. Madhusudan, and W. Nam. Synthesis of interface specifications for Java classes. In POPL, pages 98-109. ACM Press, 2005.
3. R. Alur, K. Etessami, and P. Madhusudan. A temporal logic of nested calls and returns. In TACAS, LNCS 2988, pages 467-481. Springer, 2004.
4. R. Alur, V. Kumar, P. Madhusudan, and M. Viswanathan. Congruences for visibly pushdown languages. In ICALP, LNCS 3580, pages 1102-1114. Springer, 2005.
5. R. Alur and P. Madhusudan. Visibly pushdown languages. In STOC, pages 202-211. ACM Press, 2004.
6. R. Alur and P. Madhusudan. Adding nesting structure to words. In DLT, LNCS 4036, pages 1-13, 2006.
7. R. Alur, P. Madhusudan, and W. Nam. Symbolic compositional verification by learning assumptions. In CAV, LNCS 3576, pages 548-562. Springer, 2005.
8. G. Ammons, R. Bodik, and J. R. Larus. Mining specifications. SIGPLAN Not., 37(1):4-16, 2002.
9. D. Angluin. Learning regular sets from queries and counterexamples. Information and Computation, 75:87-106, 1987.
10. T. Ball and S. Rajamani. Bebop: A symbolic model checker for boolean programs. In SPIN, LNCS 1885, pages 113-130. Springer, 2000.
11. P. Berman and R. Roos. Learning one-counter languages in polynomial time. In FOCS, pages 61-67. IEEE, 1987.
12. J. M. Cobleigh, D. Giannakopoulou, and C. S. Pasareanu. Learning assumptions for compositional verification. In TACAS, LNCS 2619, pages 331-346, 2003.
13. A. Friedman and P. Menon. Fault Detection in Digital Circuits. PrenticeHall, Inc., Englewood Cliffs, New Jersey, 1971.
14. A. Groce, D. Peled, and M. Yannakakis. Adaptive model checking. In TACAS, LNCS 2280, pages 357-370. Springer-Verlag, 2002.
15. M. Kearns and U. Vazirani. An introduction to computational learning theory. MIT Press, 1994.
16. Z. Kohavi. Switching and Finite Automata Theory. McGraw-Hill, New York, 1978.
17. V. Kumar, P. Madhusudan, and M. Viswanathan. Minimization, learning, and conformance testing of Boolean programs. Technical Report UIUCDCS-R-20062736, University of Illinois at Urbana-Champaign, June 2006.
18. D. Lee and M. Yannakakis. Principles and methods of testing finite state machines - A survey. In Proceedings of the IEEE, volume 84, pages 1090-1126, 1996.
19. R. Linn and M. Üyar. Conformance testing methodologies and architectures for OSI protocols. IEEE Computer Society Press, 1995.
20. E. F. Moore. Gedanken-experiments on sequential machines. In Automata Studies, pages 129-153, Princeton University Press, Princeton, NJ, 1956.
21. D. Peled, M. Y. Vardi, and M. Yannakakis. Black box checking. J. Autom. Lang. Comb., 7(2):225-246, 2001.
22. Y. Sakakibara. Efficient learning of context-free grammars from positive structural examples. Inf. Comput., 97(1):23-60, 1992.
23. J. Tretmans. A formal approach to conformance testing. In Protocol Test Systems, volume C-19 of IFIP Trans., pages 257-276. North-Holland, 1994.
24. L. Valiant. A theory of the learnable. Comm. of the ACM, 27(11):1134-1142, 1984.
25. A. Vardhan, K. Sen, M. Viswanathan, and G. Agha. Actively learning to verify safety for FIFO automata. In FSTTCS, LNCS 3328, pages 494-505, 2004.