| Area: |
Department of Computing |
| Credits: |
25.0 |
| Contact Hours: |
3.0 |
| |
| ** The tuition pattern below provides details of the types of classes and their duration. This is to be used as a guide only. For more precise information please check your unit outline. ** |
| |
| Workshop: |
1 x 3 Hours Weekly |
| |
| Syllabus: |
This unit is designed for students in the Master of Science (Computer Science). An in-depth treatment into the formal verification of software systems based on propositional and predicate calculus and set theory. Topics include, formal reasoning, theorem proving and logic programming, soundness and completeness, deductive proofs, deductive systems, binary decision diagrams, finite and infinite models, decidability, logic programming, semantics and verification, and model specification with Z and other formal modelling languages. The application of formal methods to clean-room software verification is presented. |
| |
| ** To ensure that the most up-to-date information about unit references, texts and outcomes appears, they will be provided in your unit outline prior to commencement. ** |
| |
| Field of Education: | 020101 Formal Language Theory |
| Funding Cluster: | 06 - Computing, Built Environment, Health |
| SOLT (Online) Definitions*: | Supplemental
*Extent to which this unit or thesis utilises online information |
| Result Type: | Grade/Mark |
Availability |
| Availability Information has not been provided by the respective School or Area. Prospective students should contact the School or Area listed above for further information. |
