|
| A Lower Bound Study on Software Development Effort
|
|
Full
text: |
 PDF(142.1KB) |
|
|
Source |
International Journal of Computer Science and Security (IJCSS) |
|
Table of Contents |
|
|
Download
Complete Issue PDF(2.76MB) |
|
Volume: 4 Issue: 4 |
| |
Pages: 373-435 |
|
Publication
Date: October 2010 |
|
ISSN
(Online): 1985-1553 |
|
|
|
|
|
Pages |
383 - 391 |
|
Author(s) |
|
|
|
Published
Date |
30-10-2010 |
|
Publisher |
CSC
Journals, Kuala Lumpur,
Malaysia |
|
ADDITIONAL
INFORMATION |
| Keywords Abstract References Cited by Related Articles Collaborative
Colleague |
| |
|
| |
KEYWORDS: Lower Bound, Software Development, Effort |
|
|
| |
|
|
| This Manuscript is indexed in the following databases/websites:- |
|
| 1. Directory of Open Access Journals (DOAJ) |
| 2. Docstoc |
| 3. Scribd |
| 4. PDFCAST |
| 5. Google Scholar |
| 6. refSeek |
| 7. Academic Index |
| 8. Socol@r |
| 9. iSEEK |
| 10. Bielefeld Academic Search Engine (BASE) |
| 11. ResearchGATE |
| 12. Academic Journals Database |
| 13. Libsearch |
| 14. slideshare |
| |
|
| |
|
|
| This paper depicts a study on the lower bound of software development effort. The work begins with the transformation model which is with the popular software development lifecycle. In general, properly handled transformations can ultimately produce the software, and the processes form the path of software development. Each transformation is associated with an effort, or the weight of an element in a path. There can be a number of these paths since many different methods and tools can be used or reused for a single transformation. Then, the Shortest Path algorithm is applied to find a shortest path which is with a minimal total effort among all the paths. However, from time to time, when advanced methods and tools are introduced, the new paths and efforts will change the previously identified shortest path. Hence, the continued work is to discuss the minimal total effort of a potential shortest path, although it may be currently unavailable. Convergence analysis is firstly provided for the discussion of whether this shortest path exists, and lower bound analysis is then provided for the discussion of the completeness and soundness. This lower bound study is significant, since an optimal software development effort is determinable. |
| |
|
| |
|
| |
| 1 |
R. W. Selby and B. W. Boehm. “Software Engineering: Barry W. Boehm’s Lifetime Contributions to Software Development, Management, and Research”. Wiley-IEEE, 2007
|
|
|
| 2 |
M. Jørgensen, M. Sheppered. “A Systematic Review of Software Development Cost Estimation Studies”. IEEE Transactions on Software Engineering, 33(1):33-53, 2007
|
|
|
| 3 |
M. Jørgensen, B. Boehm, S. Rifkin. “Software Development Effort Estimation: Formal Models or Expert Judgment?” IEEE Software, 26(2):14-19, 2009
|
|
|
| 4 |
D. E. Knuth. “The Art of Computer Programming, Volume 4, Fascicle 0: Introduction to Combinatorial Algorithms and Boolean Functions”. Addison-Wesley Professional, 2008
|
|
|
| 5 |
Dijkstra, E. W. “A Note on Two Problems in Connexion with Graphs, in Numerische Mathematik, Vol. 1”. Mathematisch Centrum, Amsterdam, the Netherlands, pp. 269-271, 1959
|
|
|
| 6 |
ISO/IEC 12207. “Information Technology – Software Lifecycle Processes”. IEEE/IEC Standard 12207.
|
|
|
| 7 |
“IEEE Guide for CASE Tool Interconnections – Classification and Description (IEEE std 1175)”. IEEE Standards, Available at: http://ieeexplore.ieee.org/.
|
|
|
| 8 |
J. Lee and N. L. Xue. “Analyzing User Requirements by Use Cases: A Goal-Driven Approach”. IEEE Software, 1999
|
|
|
| |
|
| |
|
| |
| |
|
| |
|
| |
| 1 |
TechRepublic
|
| 2 |
silicon.com
|
| |
|
| |
|
| |
|
| Lung-Lung Liu : Colleagues
|
|
