Towards an assume-guarantee theory for adaptable systems

Proceedings of the 2009 ICSE Workshop on Software Engineering for Adaptive and Self-Managing Systems, SEAMS 2009

Volumn , Issue , 2009, Pages 106-115

  Inverardi, Paola ^a   Pelliccione, Patrizio ^a   Tivoli, Massimo ^a  

^a UNIVERSITY OF L'AQUILA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTABLE SYSTEM; ILLUSTRATIVE EXAMPLES; LEVELS OF ABSTRACTION; POSITION PAPERS; RUNTIMES; SOFTWARE SYSTEMS;

COMPUTER SOFTWARE; HUMAN COMPUTER INTERACTION;

SOFTWARE ARCHITECTURE;

EID: 70349923604     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SEAMS.2009.5069079     Document Type: Conference Paper

References (15)

1. M. Caporuscio, P. Inverardi, and P. Pelliccione. Compositional verification of middleware-based software architecture descriptions. In Proceedings of the International Conference on Software Engineering (ICSE 2004). ACM Press, 2004.
2. S. Chaki and N. Sinha. Assume-guarantee reasoning for deadlock. In FMCAD '06: Proceedings of the Formal Methods in Computer Aided Design, pages 134-144, Washington, DC, USA, 2006. IEEE Computer Society.
3. B. H. C. Cheng, H. Giese, P. Inverardi, J. Magee, and R. de Lemos et al. 08031 - software engineering for self-adaptive systems: A research road map. In B. H. C. Cheng, R. de Lemos, H. Giese, P. Inverardi, and J. Magee, editors, Software Engineering for Self-Adaptive Systems, number 08031 in Dagstuhl Seminar Proceedings, Dagstuhl, Germany, 2008. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany.
4. J. M. Cobleigh, G. S. Avrunin, and L. A. Clarke. Breaking up is hard to do: An evaluation of automated assume-guarantee reasoning. ACM Trans. Softw. Eng. Methodol., 17(2):1-52, 2008.
5. J. M. Cobleigh, D. Giannakopoulou, and C. Pasareanu. Learning Assumptions for Compositional Verification. In Ninth International Conference on Tools and Algorithm for the Construction and Analysis of Systems (TACAS 2003), number 2619 in LNCS, Warsaw, Poland, April 2003. Springer.
6. J. Dingel. Computer-Assisted Assume/Guarantee Reasoning with VeriSoft. In 25th International Conference on Software Engineering (ICSE2003), Portland, Oregon, May 2003.
7. 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. In C. Rochange, editor, 7th Intl. Workshop on Worst-Case Execution Time (WCET) Analysis, Dagstuhl, Germany, 2007. Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany.
8. D. Giannakopoulou, C. S. Pasareanu, and H. Barringer. Component verification with automatically generated assumptions. In Automated Software Engineering journal, 12(3): 297-320, 2005.
9. 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 MoDELS 2007, pages 212-224, 2008.
10. O. Grumberg and D. Long. Model checking and modular verification. ACM Transactions on Programming Languages and Systems, 16(3):843-871, 1994.
11. C. B. Jones. Tentative steps toward a development method for interfering programs. ACM Trans. Program. Lang. Syst., 5(4):596-619, 1983.
12. C. B. Jones, C. Morgan, and S. Verlag. Wanted: a compositional approach to concurrency. In Programming Methodology, pages 1-15. Springer Verlag, 2003.
13. J. Kramer and J. Magee. Concurrency: State Models and Java Programs. John Wiley and Sons, 1999.
14. M. Ojeda-Aciego and A. Valverde. TASCPL: TAS Solver for Classical Propositional Logic. In JELIA, volume 3229 of Lecture Notes in Computer Science, pages 738-741. Springer, 2004.
15. A. Pnueli. In transition for global to modular temporal reasoning about programs. Logics and Models of Concurrent Systems, 1984.