Proving deadlock freedom in component-based programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2029, Issue , 2001, Pages 60-75

  Inverardi, Paola ^a   Uchitel, Sebastian ^b  

^a UNIVERSITY OF L'AQUILA   (Italy)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMMERCIAL OFF-THE-SHELF; INTEGRATION; SEMANTICS; SOFTWARE ENGINEERING;

ARCHITECTURAL CHANGES; COMMERCIAL OFF-THE-SHELF PRODUCTS; COMPONENT INTEGRATION; COMPONENT-BASED PROGRAMMING; DEVELOPMENT TECHNIQUE; DISTRIBUTED APPLICATIONS; EMERGING TECHNOLOGIES; INTEGRATION TECHNOLOGIES;

COMPUTER PROGRAMMING;

EID: 84944258920     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45314-8_6     Document Type: Conference Paper

References (14)

1. R. Alur, L. de Alfaro, T. A. Henzinger, and F. Y. C. Mang. Automatic modular verification. In Proceedings of CONCUR’99: Concurrency Theory, 1999.
2. F. Arbab, F.S. de Boer, and M. M. Bonsangue. A logical interface description language for components. In COORDINATION’OO, vol. 1906 of LNCS. Springer, 2000.
3. J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and L.J. Hwang. Symbolic model checking: 1020 and beyond.Information and Computation, 98:142-170, June 1992.
4. R. Cleaveland, J. Parrow, and B. Steffen.The concurrency workbench: a semantics based tool for the verification of concurrent systems. ACM Transactions on Programming Languages and Systems, 15(1):36-72, January 1993.
5. D. Garlan, R. Allen, and J. Ockerbloom. Architectural mismatch: Why reuse is so hard. IEEE Software, 12(6), November 1995.
6. D. Giannakopoulou, J. Kramer, and S.C. Cheung.Analysing the behaviour of distributed systems using tracta. Automated Software Engineering, 6(1):7-35, 1999.
7. S. Graf, B. Steffen, and G. Luttgen. Compositional minimisation of finite state systems using interface specifications. Formal Aspects of Computing, 8(5), 1998.
8. P. Inverardi and S. Uchitel. Proving deadlock freedom in component-based programming. Technical report, Universita’ dell’Aquila, Italia, October 1999. http://www.doc.ic.ac.uk/su2/pubs/techrep99.pdf
9. P. Inverardi, D. Yankelevich, and A. Wolf.Static checking of systems behaviors using derived component assumptions. ACM TOSEM, 2000.
10. N. Kobayashi. A partially deadlock-free typed process calculus. ACM Transactions on Programming Languages and Systems, 20(2):436-482, March 1998.
11. R. Milner. Communication and Concurrency. Prentice Hall, New York, 1989.
12. O. Grumberg and D. E. Long. Model checking and modular verification. ACM Transactions on Programming Languages and Systems, 16(3):843-871, May 1994.
13. R. Paige and R.E. Tarjan. Three partition refinement algorithms. SIAM Journal on Computing, 16(6):973-989, 1987.
14. Clemens Szyperski. Component Software. Beyond Object Oriented Programming. Addison Wesley, Harlow, England, 1998.