Loading...
| Friend's email | |
| Your name | |
| Your email | |
| enter code | |
This page was sent successfuly
- Type of Document: M.Sc. Thesis
- Language: Farsi
- Document No: 49375 (19)
- University: Sharif University of Technology
- Department: Computer Engineering
- Advisor(s): Mirian Hosseinabadi, Hassan
- Abstract:
- It's impossible to check all inputs of a software program due to infinite input domain, therefore the domain should be somehow restricted. One popular approach to do so, is input space partitioning. In this approach, the input domain has been modeled and partitioned into some equivalent classes or blocks. Using these blocks, it's possible to select one sample from each one and reduce the number of test cases to a small desirable number. To automate this approach, it's essential to firstly define the software requirements specification in a well-defined machine understandable template, then with processing this document we can detect program’s functionality and testable functions. Our goal in this thesis is to simplify the procedure of extracting characteristics and blocks to use input space partitioning, which leads to extraction of test cases. To achieve this goal, we have used class diagram and OCL specification of pre-conditions, post-conditions and invariants that relate to entities in this diagram. At last, we selected a library management system for the case study, and as a result, we showed that about 70 percent coverage of two other popular approaches called node coverage and predicate coverage, have been covered with our suggested automatic solution
- Keywords:
- Test Case ; Software Testing ; Input Space Partitioning ; Unified Modeling Language (UML) ; Input Characteristics ; Test Automation
Digital Object List
-
محتواي کتاب
- view
Bookmark