Formal languages
A formal basis for architectural connection
ACM Transactions on Software Engineering and Methodology (TOSEM)
Interprocedural pointer alias analysis
ACM Transactions on Programming Languages and Systems (TOPLAS)
An efficient automata approach to some problems on context-free grammars
Information Processing Letters
Deriving specialized program analyses for certifying component-client conformance
PLDI '02 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
ECOOP '93 Proceedings of the 7th European Conference on Object-Oriented Programming
Model Checking of Unrestricted Hierarchical State Machines
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Reachability Analysis of Pushdown Automata: Application to Model-Checking
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Model Checking for Context-Free Processes
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Pushdown Processes: Parallel Composition and Model Checking
CONCUR '94 Proceedings of the Concurrency Theory
SOFSEM '02 Proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Efficient Algorithms for Model Checking Pushdown Systems
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Analysis of Recursive State Machines
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Essentials of Constraint Programming
Essentials of Constraint Programming
Robust Dynamic Exchange of Implementation Aspects
TOOLS '99 Proceedings of the Technology of Object-Oriented Languages and Systems
Modelling recursive calls with UML state diagrams
FASE'03 Proceedings of the 6th international conference on Fundamental approaches to software engineering
Checking component composability
SC'06 Proceedings of the 5th international conference on Software Composition
Automatic Protocol Conformance Checking of Recursive and Parallel Component-Based Systems
CBSE '08 Proceedings of the 11th International Symposium on Component-Based Software Engineering
Defining component protocols with service composition: illustration with the Kmelia model
SC'07 Proceedings of the 6th international conference on Software composition
Model Checking of Component Protocol Conformance -- Optimizations by Reducing False Negatives
Electronic Notes in Theoretical Computer Science (ENTCS)
Protocol conformance checking of services with exceptions
ESOCC'12 Proceedings of the First European conference on Service-Oriented and Cloud Computing
| Hi-index | 0.00 |
We statically check whether each component in a component-based system is used according to its protocol and provide counterexamples if such a check fails. The protocol is given by a finite state machine specifying legal sequences of procedure calls of the interface of a component. The main contribution is that we can deal with call-backs without any restrictions. We achieved this by using context-free grammars instead of finite state machines to describe the use of components.