Sciweavers

1073 search results - page 41 / 215
» Formal Program Development with Approximations
Sort
View
TSE
2011
107views more  TSE 2011»
13 years 3 months ago
Deriving a Slicing Algorithm via FermaT Transformations
In this paper we present a case study in deriving an algorithm from a formal specification via FermaT transformations. The general method (which is presented in a separate paper)...
Martin P. Ward, Hussein Zedan
PPSN
1994
Springer
14 years 23 days ago
Genetic L-System Programming
We present the Genetic L-System Programming (GLP) paradigm for evolutionary creation and development of parallel rewrite systems (Lsystems, Lindenmayer-systems) which provide a com...
Christian Jacob
ISSRE
2003
IEEE
14 years 1 months ago
Test-Driven Development as a Defect-Reduction Practice
Test-driven development is a software development practice that has been used sporadically for decades. With this practice, test cases (preferably automated) are incrementally wri...
Laurie A. Williams, E. Michael Maximilien, Mladen ...
JSW
2008
220views more  JSW 2008»
13 years 8 months ago
Empirical validation of Software development effort multipliers of Intermediate COCOMO Model
Intermediate COCOMO Model computes effort as a function of program size and a set of cost drivers. Effort adjustment factor (EAF) is calculated using 15 cost drivers. EAF is an imp...
M. J. Basavaraj, K. C. Shet
PDP
2007
IEEE
14 years 3 months ago
Improving the Development Process for CSE Software
Scientific and engineering programming has been around since the beginning of computing, often being the driving force for new system development and innovation. At the same time...
Michael A. Heroux, James M. Willenbring, Michael N...