Control flow analysis of UML 2.0 sequence diagrams

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

Volumn 3748 LNCS, Issue , 2005, Pages 160-174

  Garousi, Vahid ^a   Briand, Lionel C ^a   Labiche, Yvan ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); CONFORMAL MAPPING; GRAPH THEORY; MATHEMATICAL MODELS; METADATA; SOFTWARE ENGINEERING;

CONCURRENT CONTROL FLOW GRAPH (CCFG); CONTROL FLOW ANALYSIS; SEQUENCE DIAGRAMS (SD); UML 2.0;

COMPUTER PROGRAMMING LANGUAGES;

EID: 33646520109     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11581741_13     Document Type: Conference Paper

References (31)

1. S. Muchnick, Advanced Compiler Design and Implementation, First ed: Morgan Kaufmann, 1997.
2. A. T. Chusho, "Test data selection and quality estimation based on the concept of essential branches for path testing," IEEE Tran. on Soft. Eng., vol. 13, no. 5, pp. 509-517, 1987.
3. A. Bertolino and M. Marre, "Automatic Generation of Path Covers Based on the Control Flow Analysis of Computer Programs," IEEE Tran. on Soft. Eng., vol. 20, no. 12, pp. 885-899, 1994.
4. S. Rapps and E. J. Weyuker, "Data flow analysis techniques for test data selection," Proc. Int. Conf. on Soft. Eng., pp. 272-278, 1982.
5. M. Harrold and M. Soffa, "Interprocedual data flow testing," Proc. Symp. on Soft. Testing, Analysis, and Verification, pp. 158-167, 1989.
6. B. Marick, "Experience With the Cost of Different Coverage Goals For Testing," Proc. Pacific Northwest Soft. Quality Conf., pp. 147-164, 1991.
7. Z. Jin and J. Offutt, "Coupling-based Criteria for Integration Testing," Soft. Testing, Verification, and Reliability, vol. 8, no. 3, pp. 133-154, Sept. 1998.
8. OMG, "Unified Modeling Language Specification (v1.3)," 1999.
9. OMG, "Unified Modeling Language Specification (v1.5)," 2003.
10. OMG, "UML 2.0 Superstructure Final Adopted specification," 2003.
11. M. Okazaki, T. Aoki, and T. Katayama, "Formalizing sequence diagrams and state machines using Concurrent Regular Expression," Proc. Int. Workshop on Scenarios and State Machines: Models, Algorithms, and Tools, pp. 74-79, 2003.
12. A. Rountev, S. Kagan, and J. Sawin, "Coverage Criteria for Testing of Object Interactions in Sequence Diagrams," Proc. Conf. Fundamental Approaches to Soft. Eng., pp. 289-304, 2005.
13. S. Bernardi, S. Donatelli, and J. Merseguer, "From UML sequence diagrams and statecharts to analyzable Petri-net Models," Proc. Int. Workshop on Soft, and Performance, pp. 35-45, 2002.
14. J. Cardoso and C. Sibertin-Blanc, "Ordering actions in sequence diagrams of UML," Proc. Int. Conf. on Information Technology Interfaces, pp. 3-14, 2001.
15. E. Burd, D. Overy, and A. Wheelman, "Evaluating Using Animation to Improve Understanding of Sequence Diagrams," Proc. Int. Workshop on Program Comprehension, pp. 07-113, 2002.
16. Y. Wu, M.-H. Chen, and J. Offutt, "UML-Based Integration Testing for Component-Based Software," Proc. Int. Conf. on COTS-Based Software Systems, pp. 251-260, 2003.
17. A. Abdurazik and J. Offutt, "Using UML Collaboration Diagrams for Static Checking and Test Generation," Proc. Int. Conf. on the Unified Modeling Language, pp. 383-395, 2000.
18. F. Fraikin and T. Leonhardt, "SeDiTeC-testing based on sequence diagrams," Proc. Int. Conf. on Automated Soft. Eng., pp. 261-266, 2002.
19. A. Kleppe, J. Warmer, and W. Bast, MDA Explained: The Model Driven ArchitecturePractice and Promise, 1st ed: Addison-Wesley Prof., 2003.
20. V. K. Garg and M. T. Ragunath, "Concurrent regular expressions and their relationship to Petri nets," Theoretical Computer Science, vol. 96, no. 2, pp. 285-304, 1992.
21. S. Donatelli and G. Franceschinis, "PSR Methodology: integrating hardware and software models," Proc. Int. Conf. in Application and Theory of Petri Nets, pp. 133-152, 1996.
22. V. Garousi, L. Briand, and Y. Labiche, "Control Flow Analysis of UML 2.0 Sequence Diagrams," Technical Report SCE-05-09, Carleton University, http://www.sce.carleton.ca/squall/pubs/tech_report/TR_SCE-05-09.pdf, 2005.
23. D. L. Long and L. A. Clarke, "Task interaction graphs for concurrency analysis," Proc. Int. Conf. on Soft. Eng., pp. 44-52, 1989.
24. A. T. Chamillard and L. A. Clarke, "Improving the accuracy of Petri net-based analysis of concurrent programs," Proc. Int. Symp. on Soft, testing and analysis, pp. 24-38, 1996.
25. I. Krüger, R. Grosu, P. Scholz, and M. Broy, "From MSCs to Statecharts," Proc. Int. Workshop on Distributed and parallel Embedded Systems, pp. 61-71, 1999.
26. H. R. Nielson and F. Nielson, "Infinitary Control Flow Analysis: a Collecting Semantics for Closure Analysis," Symp. on Principles of Programming Languages, pp. 332-345, 1997.
27. J. Bauer, "A control-flow-analysis for multi-threaded Java with security applications," Master's thesis, Universitat des Saarlandes, 2001, pp. 97.
28. P. D. Blasio, K. Fisher, and C. Talcott, "A Control-Flow Analysis for a Calculus of Concurrent Objects," IEEE Trans. on Soft. Eng., vol. 26, no. 7, 2000.
29. W. Brauer, W. Reisig, and G. R. (eds.), "Petri nets, central models and their properties," LNCS,vol.254, 1987.
30. J. Warmer and A. Kleppe, The Object Constraint Language: Getting Your Models Ready for MDA: Addison Wesley, 2003.
31. G. Rozenberg and A. Salomaa, Handbook of Formal Languages, 1st ed: Springer, 1997.