Three partition refinement algorithms
SIAM Journal on Computing
The concurrency workbench: a semantics-based tool for the verification of concurrent systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Model checking and modular verification
ACM Transactions on Programming Languages and Systems (TOPLAS)
Component software: beyond object-oriented programming
Component software: beyond object-oriented programming
A partially deadlock-free typed process calculus
ACM Transactions on Programming Languages and Systems (TOPLAS)
Static checking of system behaviors using derived component assumptions
ACM Transactions on Software Engineering and Methodology (TOSEM)
Communication and Concurrency
Behaviour Analysis of Distributed Systems Using the Tracta Approach
Automated Software Engineering
Architectural Mismatch: Why Reuse Is So Hard
IEEE Software
Architectural Mismatch: Why Reuse Is So Hard
IEEE Software
Automating Modular Verification
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
A Logical Interface Description Language for Components
COORDINATION '00 Proceedings of the 4th International Conference on Coordination Languages and Models
Automatic synthesis of deadlock free connectors for COM/DCOM applications
Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
Architecting families of software systems with process algebras
ACM Transactions on Software Engineering and Methodology (TOSEM)
Deadlock-free software architectures for COM/DCOM applications
Journal of Systems and Software - Special issue on: Component-based software engineering
Connectors Synthesis for Deadlock-Free Component-Based Architectures
Proceedings of the 16th IEEE international conference on Automated software engineering
On the usability of process algebra: an architectural view
Theoretical Computer Science - Process algebra
On the semantics of software adaptation
Science of Computer Programming - Special issue on second international workshop on foundations of coordination languages and software architectures (FOCLASA'03)
Liveness in Interaction Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Everything Is PSPACE-Complete in Interaction Systems
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Compositional analysis of deadlock-freedom for tree-like component architectures
EMSOFT '08 Proceedings of the 8th ACM international conference on Embedded software
Modular analysis of dataflow process networks
FASE'03 Proceedings of the 6th international conference on Fundamental approaches to software engineering
Reachability in Tree-Like Component Systems is PSPACE-Complete
Electronic Notes in Theoretical Computer Science (ENTCS)
aComment: mining annotations from comments and code to detect interrupt related concurrency bugs
Proceedings of the 33rd International Conference on Software Engineering
Preserving architectural properties in multithreaded code generation
COORDINATION'05 Proceedings of the 7th international conference on Coordination Models and Languages
Synthesizing concurrency control components from process algebraic specifications
COORDINATION'06 Proceedings of the 8th international conference on Coordination Models and Languages
Deadlock-freedom in component systems with architectural constraints
Formal Methods in System Design
| Hi-index | 0.00 |
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.