Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
Proving Deadlock Freedom in Component-Based Programming
| |
|
Proving Deadlock Freedom in Component-Based Programming
Paola Inverardi5  and Sebastian Uchitel6
| (5) |
Dip. di Matematica, Universit’a dell’ Aquila, I-67010 L’Aquila, Italy |
| (6) |
Dep. of Computing, Imperial College, Queen’s Gate 180, London, SW7 2BZ, UK |
Abstract
Emerging technologies such as commercial off-the-shelf products (COTS) and component integration frameworks such as CORBA
and COM are changing the way software is produced. Distributed applications are being designed as sets of autonomous, decoupled
components, allowing rapid development based on integration of COTS and simplifying architectural changes required to cope
with the dynamics of the underlying environment. Although integration technologies and development techniques assume rather
simple architectural contexts, they face a critical problem: Component integration.
So far existing techniques for detecting dynamic integration errors are based on behavioural analysis of the composed system
and have serious space complexity problems. In this work we propose a broader notion of component semantics based on assumptions
and a method for proving deadlock freedom in a component-based setting. Our goal is to prevent and detect these errors in
component based programming settings in a component-wise fashion. We aim for effective methods that can scale to real size
applications even at the price of incompleteness as opposed to many existing methods that although theoretically complete
might fail in practice.
P. Inverardi was artially supported by the Italian MURST national Project SALADIN. S. Uchitel was partially supported by ARTE
Project, PIC 11-00000-01856, ANPCyT and TW72, UBACyT.
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|