Automatic checking of component protocols in component-based systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4089 LNCS, Issue , 2006, Pages 1-17

  Zimmermann, Wolf ^a   Schaarschmidt, Michael ^a  

^a MARTIN LUTHER UNIVERSITY HALLE WITTENBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT FREE GRAMMARS; HAPTIC INTERFACES; NETWORK PROTOCOLS;

COMPONENT BASED SYSTEMS; FINITE STATE MACHINES;

COMPUTER SYSTEMS;

EID: 33749376458     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11821946_1     Document Type: Conference Paper

References (23)

1. C. Attiogbé, P. André, G. Ardourel. Checking Component Composability In Proc. of the 5th International Symposium on Software Composition, this volume of Lecture Notes in Computer Science. Springer, 2006.
2. R. Allen and S. Garlan. A formal basis for architectural connection. ACM Transactions on Software Engineering and Methodology, 6(3):213-249, 1997.
3. R. Alur, K. Etessami, and M. Yannakakis. Analysis of recursive state machines. In Proceedings of the 13th Conference on Computer Aided Verification, volume 2102 of Lecture Notes in Computer Science, pages 207-220. Springer, 2001.
4. U. Assmann. Invasive Software Composition. Springer, 2003.
5. M. Benedikt, P. Godefroid, and T. Reps. Model checking of unrestricted hierarchical state machines. In Proceedings of the 28th International Colloquium on Automata, Languages, and Programming ICALP'2001, volume 2076 of Lecture Notes in Computer Science, pages 652-666. Springer, 2001.
6. A. Bouajjani, J. Esparza, A. Finkel, O. Maler, P. Rossmanith, B. Willems, and P. Wolper. An efficient automata approach to some problems on context-free grammars. Information Processing Letters, 74(5-6):221-227, 2000.
7. A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Application to model checking. In CONCUR'97: Proceedings of the 8th International Conference on Concurrency Theory, volume 1243 of Lecture Notes in Computer Science, pages 135-150. Springer, 1997.
8. O. Burkart and B. Steffen. Model checking for context-free processes. In CONCUR'92: Proceedings of the 3rd International Conference on Concurrency Theory, volume 630 of Lecture Notes in Computer Science, pages 123-137. Springer, 1992.
9. O. Burkart and B. Steffen. Pushdown processes: Parallel composition and model checking. In CONCUR'94: Proceedings of the 5th International Conference on Concurrency Theory, volume 836 of Lecture Notes in Computer Science, pages 98-113. Springer, 1994.
10. C. Chambers. Predicate classes. In Proceedings of the 7th European Conference on Object-Oriented Programming, volume 707 of Lecture Notes in Computer Science, pages 268-296. Springer, 1993.
11. J. Esparza, D. Hansel, P. Rossmanith, and S. Schwoon. Efficient algorithms for model checking pushdown systems. In Proceedings of the 12th Conference on Computer Aided Verification, volume 1855 of Lecture Notes in Computer Science, pages 232-247. Springer, 2000.
12. J. Freudig, W. Löwe, R. Neumann, and M. Trapp. Subtyping of context-free classes. In Proceedings 3rd White Object Oriented Nights, 1998.
13. H. W. Schmidt, B. J. Krämer, I. Poernemo, and R. Reussner. Predictable component architectures using dependent finite state machines. In Proc. of the NATO Workshop Radical Innovations of Software and Systems Engineering in the Future, volume 2941 of Lecture Notes in Computer Science, pages 310-324. Springer, 2002.
14. M. Hind, M. Burke, P. Carini, and J.-D. Choi. Interprocedural pointer alias analysis. ACM Transactions on Programming Languages and Systems, 21(4):848-894, 1999.
15. J. E. Hopcroft, R. Motwani, and J. D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison Wesley, 2nd edition, 2001.
16. G. Kiczales, J. Lamping, A. Mendhekar, C. Maeda, C. Lopes, J.-M. Loingtier, and J. Irwin. Aspect-oriented programming. In ECOOP'97 - Object-Oriented Programming, volume 1241 of Lecture Notes in Computer Science, pages 220-242. Springer, 1997.
17. W. Löwe, R. Neumann, M. Trapp, and W. Zimmermann. Robust dynamic exchange of implementation aspects. In TOOLS 29 - Technology of Object-Oriented Languages and Systems, pages 351-360. IEEE, 1999.
18. O. Nierstrasz. Regular types for active objects. In OOPSALA '93, volume 28 of ACM SIGPLAN Notices, 1993.
19. G. Ramalingam, A. Warshavsky, J. Field, D. Goyal, and M. Sagiv. Deriving specialized program analyses for certifying component-client conformance. In Proceedings of the ACM SIGPLAN 2002 Conference on Programming Language Design and Implementation, pages 83-94. ACM, 2002.
20. R. H. Reussner. Counter-constraint finite state machines: A new model for resource-bounded component protocols. In Proceedings of the 29th Annual Conference in Current Trends in Theory and Practice of Informatics, volume 2540 of Lecture Notes in Computer Science, pages 20-40. Springer, 2002.
21. A. K. Salomaa. Formal Languages. Springer, 1978.
22. J. Tenzer and P. Stevens. Modelling recursive calls with uml state diagrams. In 6th International Conference on Fundamental Approaches to Software Engineering (FASE'03), volume 2621 of Lecture Notes in Computer Science, pages 135-149. Springer, 2003.
23. W. Zimmermann and M. Schaarschmidt. Model checking of client-component conformance. In 2nd Nordic Conference on Web-Services, number 008 in Mathematical Modelling in Physics, Engineering and Cognitive Sciences, pages 63-74, 2003.