M. Caporuscio, P. Inverardi, and P. Pelliccione, Compositional verification of middleware-based software architecture descriptions, Proceedings. 26th International Conference on Software Engineering, 2004.
DOI : 10.1109/ICSE.2004.1317444

S. Chaki and N. Sinha, Assume-Guarantee Reasoning for Deadlock, 2006 Formal Methods in Computer Aided Design, pp.134-144, 2006.
DOI : 10.1109/FMCAD.2006.8

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.118.5545

B. H. Cheng, H. Giese, P. Inverardi, J. Magee, and R. De-lemos, 08031 ? software engineering for selfadaptive systems: A research road map, Software Engineering for Self-Adaptive Systems, number 08031 in Dagstuhl Seminar Proceedings Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2008.

J. M. Cobleigh, G. S. Avrunin, and L. A. Clarke, Breaking up is hard to do, ACM Transactions on Software Engineering and Methodology, vol.17, issue.2, pp.1-52, 2008.
DOI : 10.1145/1348250.1348253

J. M. Cobleigh, D. Giannakopoulou, and C. Pasareanu, Learning Assumptions for Compositional Verification, Ninth International Conference on Tools and Algorithm for the Construction and Analysis of Systems number 2619, 2003.
DOI : 10.1007/3-540-36577-X_24

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.103.913

A. Ermedahl, C. Sandberg, J. Gustafsson, S. Bygde, and B. Lisper, Loop bound analysis based on a combination of program slicing, abstract interpretation, and invariant analysis, 7th Intl. Workshop on Worst- Case Execution Time (WCET) Analysis Internationales Begegnungs-und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, 2007.

D. Giannakopoulou, C. S. Pasareanu, and H. Barringer, Component Verification with Automatically Generated Assumptions, Automated Software Engineering journal, pp.297-320, 2005.
DOI : 10.1007/s10515-005-2641-y

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.105.2359

H. J. Goldsby, B. H. Cheng, and J. Zhang, AMOEBA-RT: Run-Time Verification of Adaptive Software. Models in Software Engineering: Workshops and Symposia at MoD- ELS, pp.212-224, 2007.

O. Grumberg and D. Long, Model checking and modular verification, ACM Transactions on Programming Languages and Systems, vol.16, issue.3, pp.843-871, 1994.
DOI : 10.1145/177492.177725

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.6959

C. B. Jones, Tentative steps toward a development method for interfering programs, ACM Transactions on Programming Languages and Systems, vol.5, issue.4, pp.596-619, 1983.
DOI : 10.1145/69575.69577

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.456.4499

C. B. Jones, C. Morgan, and S. Verlag, Wanted: a compositional approach to concurrency, Programming Methodology, pp.1-15, 2003.
DOI : 10.1007/978-0-387-21798-7_1

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.97.1344

J. Kramer and J. Magee, Concurrency: State Models and Java Programs, 1999.

M. Ojeda-aciego and A. Valverde, tascpl: TAS Solver for Classical Propositional Logic, JELIA, pp.738-741, 2004.
DOI : 10.1007/978-3-540-30227-8_70

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.216.8041

A. Pnueli, In transition for global to modular temporal reasoning about programs. Logics and Models of Concurrent Systems, 1984.