Dana Angluin (1987):
Learning Regular Sets from Queries and Counterexamples.
Inf. Comput. 75(2),
pp. 87–106,
doi:10.1016/0890-5401(87)90052-6.
Dirk Beyer, Thomas A. Henzinger & Vasu Singh (2007):
Algorithms for Interface Synthesis.
In: Damm & Hermanns,
pp. 4–19,
doi:10.1007/978-3-540-73368-3_4.
Sagar Chaki, Edmund M. Clarke, Alex Groce, Somesh Jha & Helmut Veith (2003):
Modular Verification of Software Components in C.
In: ICSE,
pp. 385–395,
doi:10.1109/ICSE.2003.1201217.
Sagar Chaki, Joël Ouaknine, Karen Yorav & Edmund M. Clarke (2003):
Automated Compositional Abstraction Refinement for Concurrent C Programs: A Two-Level Approach.
Electr. Notes Theor. Comput. Sci. 89(3),
pp. 417–432,
doi:10.1016/S1571-0661(05)80004-0.
Marsha Chechik & Martin Wirsing (2009):
Fundamental Approaches to Software Engineering, 12th International Conference, FASE 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009. Proceedings.
Lecture Notes in Computer Science 5503.
Springer,
doi:10.1007/978-3-642-00593-0.
Edmund M. Clarke, Orna Grumberg, Somesh Jha, Yuan Lu & Helmut Veith (2000):
Counterexample-Guided Abstraction Refinement.
In: Emerson & Sistla,
pp. 154–169,
doi:10.1007/10722167_15.
Jamieson M. Cobleigh, Dimitra Giannakopoulou & Corina S. Păsăreanu (2003):
Learning Assumptions for Compositional Verification.
In: Garavel & Hatcliff,
pp. 331–346,
doi:10.1007/3-540-36577-X_24.
James C. Corbett, Matthew B. Dwyer, John Hatcliff, Shawn Laubach, Corina S. Pasareanu, Robby & Hongjun Zheng (2000):
Bandera: extracting finite-state models from Java source code.
In: ICSE,
pp. 439–448,
doi:10.1145/337180.337234.
Patrick Cousot & Radhia Cousot (1977):
Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints.
In: Graham,
pp. 238–252,
doi:10.1145/512950.512973.
Available at http://dl.acm.org/citation.cfm?id=512950.
Werner Damm & Holger Hermanns (2007):
Computer Aided Verification, 19th International Conference, CAV 2007, Berlin, Germany, July 3-7, 2007, Proceedings.
Lecture Notes in Computer Science 4590.
Springer.
E. Allen Emerson & A. Prasad Sistla (2000):
Computer Aided Verification, 12th International Conference, CAV 2000, Chicago, IL, USA, July 15-19, 2000, Proceedings.
Lecture Notes in Computer Science 1855.
Springer.
Hubert Garavel & John Hatcliff (2003):
Tools and Algorithms for the Construction and Analysis of Systems, 9th International Conference, TACAS 2003, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2003, Warsaw, Poland, April 7-11, 2003, Proceedings.
Lecture Notes in Computer Science 2619.
Springer.
Dimitra Giannakopoulou & Corina S. Păsăreanu (2008):
Special issue on learning techniques for compositional reasoning.
Formal Methods in System Design 32(3),
pp. 173–174,
doi:10.1007/s10703-008-0054-9.
Dimitra Giannakopoulou & Corina S. Păsăreanu (2009):
Interface Generation and Compositional Verification in JavaPathfinder.
In: Chechik & Wirsing,
pp. 94–108,
doi:10.1007/978-3-642-00593-0_7.
Dimitra Giannakopoulou, Zvonimir Rakamaric & Vishwanath Raman (2012):
Symbolic Learning of Component Interfaces.
In: Miné & Schmidt,
pp. 248–264,
doi:10.1007/978-3-642-33125-1_18.
Robert M. Graham, Michael A. Harrison & Ravi Sethi (1977):
Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, Los Angeles, California, USA, January 1977.
ACM.
Available at http://dl.acm.org/citation.cfm?id=512950.
Michael Hanus (2007):
Practical Aspects of Declarative Languages, 9th International Symposium, PADL 2007, Nice, France, January 14-15, 2007.
Lecture Notes in Computer Science 4354.
Springer.
Thomas A. Henzinger, Ranjit Jhala & Rupak Majumdar (2004):
Race checking by context inference.
In: PLDI,
pp. 1–13,
doi:10.1145/996841.996844.
Thomas A. Henzinger, Ranjit Jhala & Rupak Majumdar (2005):
Permissive interfaces.
In: Wermelinger & Gall,
pp. 31–40,
doi:10.1145/1081706.1081713.
Cliff B. Jones (1983):
Tentative Steps Toward a Development Method for Interfering Programs.
ACM Trans. Program. Lang. Syst. 5(4),
pp. 596–619,
doi:10.1145/69575.69577.
Antoine Miné & David Schmidt (2012):
Static Analysis - 19th International Symposium, SAS 2012, Deauville, France, September 11-13, 2012. Proceedings.
Lecture Notes in Computer Science 7460.
Springer,
doi:10.1007/978-3-642-33125-1.
Kedar S. Namjoshi & Robert P. Kurshan (2000):
Syntactic Program Transformations for Automatic Abstraction.
In: Emerson & Sistla,
pp. 435–449,
doi:10.1007/10722167_33.
Jens Palsberg & Martín Abadi (2005):
Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2005, Long Beach, California, USA, January 12-14, 2005.
ACM.
Available at http://dl.acm.org/citation.cfm?id=1040305.
Andreas Podelski & Andrey Rybalchenko (2007):
ARMC: The Logical Choice for Software Model Checking with Abstraction Refinement.
In: Hanus,
pp. 245–259,
doi:10.1007/978-3-540-69611-7_16.
Corina S. Păsăreanu (2001):
Abstraction and Modular Reasoning for the Verification of Software.
PhD Thesis, Kansas State University.
Corina S. Păsăreanu, Dimitra Giannakopoulou, Mihaela Gheorghiu Bobaru, Jamieson M. Cobleigh & Howard Barringer (2008):
Learning to divide and conquer: applying the L* algorithm to automate assume-guarantee reasoning.
Formal Methods in System Design 32(3),
pp. 175–205,
doi:10.1007/s10703-008-0049-6.
Ronald L. Rivest & Robert E. Schapire (1993):
Inference of Finite Automata Using Homing Sequences.
Inf. Comput. 103(2),
pp. 299–347,
doi:10.1006/inco.1993.1021.
Rishabh Singh, Dimitra Giannakopoulou & Corina S. Păsăreanu (2010):
Learning Component Interfaces with May and Must Abstractions.
In: Touili,
pp. 527–542,
doi:10.1007/978-3-642-14295-6_45.
Tayssir Touili, Byron Cook & Paul Jackson (2010):
Computer Aided Verification, 22nd International Conference, CAV 2010, Edinburgh, UK, July 15-19, 2010. Proceedings.
Lecture Notes in Computer Science 6174.
Springer,
doi:10.1007/978-3-642-14295-6.
Michel Wermelinger & Harald Gall (2005):
Proceedings of the 10th European Software Engineering Conference held jointly with 13th ACM SIGSOFT International Symposium on Foundations of Software Engineering, 2005, Lisbon, Portugal, September 5-9, 2005.
ACM.
eptcs@eptcs.org