Home   >   CSC-OpenAccess Library   >    Manuscript Information
A Lower Bound Study on Software Development Effort
Lung-Lung Liu
Pages - 383 - 391     |    Revised - 30-08-2010     |    Published - 30-10-2010
Volume - 4   Issue - 4    |    Publication Date - October 2010  Table of Contents
Lower Bound, Software Development, Effort
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 Google Scholar 
2 Academic Journals Database 
3 Academic Index 
4 CiteSeerX 
5 refSeek 
6 iSEEK 
7 Socol@r  
8 ResearchGATE 
9 Libsearch 
10 Bielefeld Academic Search Engine (BASE) 
11 Scribd 
12 SlideShare 
14 PdfSR 
“IEEE Guide for CASE Tool Interconnections – Classification and Description (IEEE std 1175)”. IEEE Standards, Available at: http://ieeexplore.ieee.org/.
D. E. Knuth. “The Art of Computer Programming, Volume 4, Fascicle 0: Introduction to Combinatorial Algorithms and Boolean Functions”. Addison-Wesley Professional, 2008
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
ISO/IEC 12207. “Information Technology – Software Lifecycle Processes”. IEEE/IEC Standard 12207.
J. Lee and N. L. Xue. “Analyzing User Requirements by Use Cases: A Goal-Driven Approach”. IEEE Software, 1999
M. Jørgensen, B. Boehm, S. Rifkin. “Software Development Effort Estimation: Formal Models or Expert Judgment?” IEEE Software, 26(2):14-19, 2009
M. Jørgensen, M. Sheppered. “A Systematic Review of Software Development Cost Estimation Studies”. IEEE Transactions on Software Engineering, 33(1):33-53, 2007
R. W. Selby and B. W. Boehm. “Software Engineering: Barry W. Boehm’s Lifetime Contributions to Software Development, Management, and Research”. Wiley-IEEE, 2007
Mr. Lung-Lung Liu
International College Ming Chuan University Gui-Shan, Taoyuan County, Taiwan, ROC 333 - Taiwan

View all special issues >>