Towards the Reverse Engineering of UML Sequence Diagrams
WCRE '03 Proceedings of the 10th Working Conference on Reverse Engineering
Static control-flow analysis for reverse engineering of UML sequence diagrams
PASTE '05 Proceedings of the 6th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
AD2US: An Automated Approach to Generating Usage Scenarios from UML Activity Diagrams
APSEC '05 Proceedings of the 12th Asia-Pacific Software Engineering Conference
Automatic test case generation for UML activity diagrams
Proceedings of the 2006 international workshop on Automation of software test
Test Cases Generation from UML Activity Diagrams
SNPD '07 Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03
Proving the Correctness of Multiprocess Programs
IEEE Transactions on Software Engineering
TSGen: A UML Activity Diagram-Based Test Scenario Generation Tool
CSE '09 Proceedings of the 2009 International Conference on Computational Science and Engineering - Volume 02
Transition sequence exploration of UML activity diagram using evolutionary algorithm
Proceedings of the 5th India Software Engineering Conference
Compositional semantics for UML 2.0 sequence diagrams using petri nets
SDL'05 Proceedings of the 12th international conference on Model Driven
CONTESSA: concurrency testing augmented with symbolic analysis
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
| Hi-index | 0.00 |
Concurrent programming is increasingly being used in many applications with the advent of multi-cores. The necessary support for execution of multi-threading is getting richer. Notwithstanding, a concurrent program may behave nondeterministically, it may result in different outputs with the same input in different runs. The aim of this study is to generate test sequences for concurrency from unified modelling language (UML) behavioral models such as sequence and activity diagrams. Generating exhaustive test cases for all concurrent interleaving sequences is exponential in size. Therefore, it is necessary to find adequate test cases in presence of concurrency to uncover errors due to, e.g., data race, synchronization and deadlocks. In order to generate adequate test cases a novel search algorithm, which we call concurrent queue search (CQS) is proposed. The CQS handles random nature of concurrent tasks. To generate test scenarios, a sequence diagram is converted into an activity diagram. An activity diagram encapsulates sequential, conditional, iterative and concurrent ows of the control. By the experimental results, it was observed that test sequences generated by CQS algorithm are superior as compared to DFS and BFS search algorithms.