Some ‘Secure Programming’ Exercises for an Introductory Programming Class

Citation

M. Bishop, “Some ‘Secure Programming’ Exercises for an Introductory Programming Class,” Proceedings of the Sixth World Conference on Information Security Education pp. 226–232 (July 2009).

Paper

• Published version web page, paper paywalled at Springer Link: [DOI] [URL]
• Authors’ final version:
  • Local: [PDF] [PS]
  • UC Repository: [eScholarship]

Abstract

Ideally, computer security should be an integral part of all programming courses. Beginning programming classes pose a particular challenge, because the students are learning basic concepts of programming. Thus, teaching them about buffer overflows as security problems, requiring an explanation of concepts such as “smashing the stack,” will confuse students more than motivate them to check array bounds. Advanced concepts such as race conditions require more background than the students have, or will have, when taking introductory programming classes. An alternate approach is to teach the underlying concepts of robust programming; preventing crashes or errors is central to such a course. This paper presents some exercises that illustrate this approach, and some thoughts on what constitutes “secure programming”.

Bibliographic Information: [BibTeX] [RIS]
DOI: 10.1007/978-3-642-39377-8_26