Regular types for active objects
Object-oriented software composition
Protocol specifications and component adaptors
ACM Transactions on Programming Languages and Systems (TOPLAS)
A formal basis for architectural connection
ACM Transactions on Software Engineering and Methodology (TOSEM)
Information and Computation - Special issue on EXPRESS 1997
SIMULA: an ALGOL-based simulation language
Communications of the ACM
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Behavior Protocols for Software Components
IEEE Transactions on Software Engineering
Combining Petri Nets and PA-Processes
TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
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
Robust Dynamic Exchange of Implementation Aspects
TOOLS '99 Proceedings of the Technology of Object-Oriented Languages and Systems
Describing and Reasoning on Web Services using Process Algebra
ICWS '04 Proceedings of the IEEE International Conference on Web Services
Model-Based Analysis of Obligations in Web Service Choreography
AICT-ICIW '06 Proceedings of the Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services
Component-Interaction Automata Approach (CoIn)
The Common Component Modeling Example
Service-Oriented Modeling of CoCoME with Focus and AutoFocus
The Common Component Modeling Example
Modelling the CoCoME with the Java/A Component Model
The Common Component Modeling Example
The Common Component Modeling Example
Automatic Protocol Conformance Checking of Recursive and Parallel BPEL Systems
ECOWS '08 Proceedings of the 2008 Sixth European Conference on Web Services
On More Predictable Implementations of Reliable Workflows in Service-oriented Architectures
ECOWS '09 Proceedings of the 2009 Seventh IEEE European Conference on Web Services
Modelling recursive calls with UML state diagrams
FASE'03 Proceedings of the 6th international conference on Fundamental approaches to software engineering
SPADE: verification of multithreaded dynamic and recursive programs
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Defining component protocols with service composition: illustration with the Kmelia model
SC'07 Proceedings of the 6th international conference on Software composition
Modeling- and analysis techniques for web services and business processes
FMOODS'05 Proceedings of the 7th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Automatic checking of component protocols in component-based systems
SC'06 Proceedings of the 5th international conference on Software Composition
Checking component composability
SC'06 Proceedings of the 5th international conference on Software Composition
Termination analysis of business process workflows
Proceedings of the 5th International Workshop on Enhanced Web Service Technologies
Protocol conformance checking of services with exceptions
ESOCC'12 Proceedings of the First European conference on Service-Oriented and Cloud Computing
Hi-index | 0.01 |
In past years, a number of works considered behavioral protocols of components and discussed approaches for automatically checking of compatibality of protocols (protocol conformance) in component-based systems. The approaches are usually model-checking approaches, i.e., a positive answer guarantees protocol conformance for all executions while a negative answer provides example executions that may lead to protocol violations. It turned out that if behavioral abstractions take into account unbounded concurrency and unbounded recursion, the protocol conformance checking problem becomes undecidable. There are two possibilities to overcome this problem: (i) further behavioral abstraction to finite state systems or (ii) a conservative approximation of the protocol conformance checking problem. Both approaches may lead to spurious counterexamples, i.e., due to abstractions or approximations the shown execution can never happen. This work considers the second approach and shows a heuristics that reduces the number of spurious counterexamples by cutting off search branches that definitely do not contain real counterexamples.