1. Alur R, Madhusudan P, Nam W (2005) Symbolic compositional verification by learning assumptions. In: Etessami K, Rajamani SK (eds) Proceedings of the 17th international conference on computer aided verification (CAV ’05), New York, July 6–10, 2005. Lecture notes in computer science, vol 3576. Springer, Edinburgh, pp 548–562
2. Angluin D: Learning regular sets from queries and counterexamples. Inform Comput 75(2), 87–106 (1987)
3. Barringer H, Giannakopoulou D, Păsăreanu CS (2003) Proof rules for automated compositional verification through learning. In: Proceedings of the second workshop on specification and verification of component based systems (SAVCBS ’03), Helsinki, September 1–2, 2003. Iowa State University, Ames, pp 14–21
4. Calbrix H, Nivat M, Podelski A (1993) Ultimately periodic words of rational ω-languages. In: Brookes SD, Main MG, Melton A, Mislove MW, Schmidt DA (eds) Proceedings of the 9th international conference on mathematical foundations of programming semantics (MFPS ’93). Lecture notes in computer science, vol 802. Springer, New Orleans, pp 554–566
5. Chaki S, Sinha N (2006) Assume-guarantee reasoning for deadlock. In: Proceedings of the 6th international conference on formal methods in computer-aided design (FMCAD ’06), San Jose, November 12–16, 2006. IEEE Computer Society, Washington, DC, pp 134–144