- Begel, A. and Simon, B. Novice software developers, all over again. In ICER '08: Proceedings of the 4th International Workshop on Computing Education Research (Sept. 2008). Google ScholarDigital Library
- Feathers, M. Working Effectively with Legacy Code, Prentice Hall, 2004. Google ScholarDigital Library
- Fox, A. and Patterson, D. Software engineering for Software as a Service; http://www.saas-class.org, March 2012 and May 2012.Google Scholar
- Green, B. Private Communication, 2011.Google Scholar
- IEEE. Guide to the Software Engineering Body of Knowledge (SWEBOK), 2004.Google Scholar
- Ji, F. and Sedano, T. Comparing extreme programming and waterfall project results. Conference on Software Engineering Education and Training 2011 (2011). Google ScholarDigital Library
- Patterson, D.A. and Hennessy, J.L. Computer Organization and Design: The Hardware/Software Interface. Revised 4th Edition, Morgan Kaufmann Publishers, 2012. Google ScholarDigital Library
- Stella, L.F.F., Jarzabek, S. and Wadhwa, B. A comparative study of maintainability of Web applications on J2EE, .NET, and Ruby on Rails. WSE 2008. 10th International Symposium on Web Site Evolution (Oct. 3--4, 2008), 93--99.Google ScholarCross Ref
Index Terms
- Crossing the software education chasm
Recommendations
A Software Chasm: Software Engineering and Scientific Computing
The domain-independent solutions proffered by the software engineering community have led to the isolation of the scientific-computing community.
Lean software startup practices and software engineering education
ICSE '22: Proceedings of the ACM/IEEE 44th International Conference on Software Engineering: Companion ProceedingsIn the modern economy, software drives innovation and economic growth. Studies show how software increasingly influences all industry sectors. Over the past 5 decades, software engineering has also changed significantly to advance the development of ...
On k-planar crossing numbers
The k-planar crossing number of a graph is the minimum number of crossings of its edges over all possible drawings of the graph in k planes. We propose algorithms and methods for k-planar drawings of general graphs together with lower bound techniques. ...
Comments