Rigorous proofs of program correctness without formal logic

Wadkins, J. R. Jefferson

doi:10.1145/199688.199834

Cited by 2 publications

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

An undergraduate course in formal methods

Tremblay

1998

Proceedings of the Twenty-Ninth SIGCSE Technical Symposium on Computer Science Education

View full text Add to dashboard Cite

I' ,/' We present,a new undergraduate course in formal methods which emphasizes software specification. and description instead of formal program correctness or program derivation.This course is motivated by the idea that specifications play a key role in the software development process and that precise and clear d&&iptions of software systems and artifacts are important. It wants to show students that some simple notions from~logic and mathematics (predicates and quantifiers, set theory, maps), together with appropriate constructs for defining software components and systems, can ,be useful for this purpose.The course is taught using the Spec notation [1] and we first discuss why we did not choose the ubiquitous Z notation. The content of the course is then presented, followed with a brief description of an on-line Www system that was developed to help the students do the exercices presented in the course notes.

show abstract

An undergraduate course in formal methods

Tremblay

1998

Proceedings of the Twenty-Ninth SIGCSE Technical Symposium on Computer Science Education

View full text Add to dashboard Cite

show abstract

An undergraduate course in formal methods

Tremblay

1998

SIGCSE Bull.

View full text Add to dashboard Cite

We present a new undergraduate course in formal methods which emphasizes software specification and description instead of formal program correctness or program derivation.This course is motivated by the idea that specifications play a key role in the software development process and that precise and clear descriptions of software systems and artifacts are important. It wants to show students that some simple notions from logic and mathematics (predicates and quantifiers, set theory, maps), together with appropriate constructs for defining software components and systems, can be useful for this purpose.The course is taught using the Spec notation [1] and we first discuss why we did not choose the ubiquitous Z notation. The content of the course is then presented, followed with a brief description of an on-line WWW system that was developed to help the students do the exercices presented in the course notes.

show abstract

Rigorous proofs of program correctness without formal logic

Cited by 2 publications

References 6 publications

An undergraduate course in formal methods

An undergraduate course in formal methods

An undergraduate course in formal methods

Contact Info

Product

Resources

About