Formal Methods in System Design

, Volume 32, Issue 3, pp 173–174 | Cite as

Special issue on learning techniques for compositional reasoning

Guest Editorial

References

  1. 1.
    Alur R, Madhusudan P, Nam W (2005) Symbolic compositional verification by learning assumptions. In: Proceedings of CAV’05. Lecture notes in computer science, vol 3576. Springer, Berlin, pp 548–562 Google Scholar
  2. 2.
    Chaki S, Strichman O (2007) Optimized L*-based assume-guarantee reasoning. In: Proceedings of TACAS’07. Lecture notes in computer science, vol 4424. Springer, Berlin, pp 276–291 Google Scholar
  3. 3.
    Cobleigh JM, Giannakopoulou D, Păsăreanu CS (2003) Learning assumptions for compositional verification. In: Proceedings of TACAS’03. Lecture notes in computer science, vol 2619. Springer, Berlin, pp 331–346 Google Scholar
  4. 4.
    Gupta A, McMillan KL, Fu Z (2007) Automated assumption generation for compositional verification. In: Proceedings of CAV’07. Lecture notes in computer science, vol 4590. Springer, Berlin, pp 420–432 Google Scholar
  5. 5.
    Sharygina N, Chaki S, Clarke EM, Sinha N (2005) Dynamic component substitutability analysis. In: Proceedings of FM’05. Lecture notes in computer science, vol 3582. Springer, Berlin, pp 512–528 Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2008

Authors and Affiliations

  • Dimitra Giannakopoulou
    • 1
  • Corina S. Păsăreanu
    • 1
  1. 1.NASA Ames Research CenterMountain ViewUSA

Personalised recommendations