An experience teaching formal methods in discrete mathematics

Authors:
J. Stanley Warford
Affiliations:
Pepperdine University, Malibu, CA
Venue:
ACM SIGCSE Bulletin
Year:
1995

Citing 6
Cited 1

Teaching calculation and discrimination: a more effective curriculum

Communications of the ACM
A logical approach to discrete math

A logical approach to discrete math
Towards more formalism in software engineering education

SIGCSE '93 Proceedings of the twenty-fourth SIGCSE technical symposium on Computer science education
Reasoning about programs: integrating verification and analysis of algorithms into the introductory programming course

SIGCSE '93 Proceedings of the twenty-fourth SIGCSE technical symposium on Computer science education
Derivation of programs for freshmen

SIGCSE '94 Proceedings of the twenty-fifth SIGCSE symposium on Computer science education
Towards an introductory formal programming course

SIGCSE '94 Proceedings of the twenty-fifth SIGCSE symposium on Computer science education

Teaching discrete structures: a systematic review of the literature

Proceedings of the 42nd ACM technical symposium on Computer science education

Quantified Score

Hi-index	0.00

Visualization

Abstract

In spite of recent calls to incorporate formal methods into the computer science curriculum, the effort is still controversial and proceeding slowly. This paper presents our experience in restructuring the undergraduate Discrete Mathematics course to include formal methods. It concludes with some philosophical ruminations about the place of formal methods in the computer science curriculum in general.