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
An efficient automata approach to some problems on context-free grammars
Information Processing Letters
Decidability of model checking with the temporal logic EF
Theoretical Computer Science
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 Computation
Introduction To Automata Theory, Languages, And Computation
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,
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
Constrained Properties, Semilinear Systems, and Petri Nets
CONCUR '96 Proceedings of the 7th International Conference on 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
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
Interprocedural analysis of concurrent programs under a context bound
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Context-bounded analysis of concurrent queue systems
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Context-Bounded model checking of concurrent software
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Automatic checking of component protocols in component-based systems
SC'06 Proceedings of the 5th international conference on Software Composition
Verifying concurrent message-passing c programs with recursive calls
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
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 |
Today model checking of security or safety properties of component-based systems based on finite protocols has the flaw that either parallel or sequential systems can be checked. Parallel systems can be described often by well known Petri nets, but it is not possible to model recursive behaviour. On the other hand sequential systems based on pushdown automata can capture recursion and recursive callbacks [27], but they do not provide parallel behaviour in general.In this work we show how this gap can be filled if process rewrite systems (introduced by Mayr [16]) are used to capture the behaviour of components. The protocols of the components interfaces specified as finite state machines can be combined to a system equal to a process rewrite system. By calculating the reachability of the fault state range one gets a trace (counterexample) which does not satisfy the properties specified by all protocols of the combined components, if any error exists.