goto UNSW home page  
Contacts Library myUNSW WebCT
Algorithmic Verification - COMP3153
PRINT THIS PAGE
UNSW Computing
 
Faculty: Faculty of Engineering
 
 
School:  School of Computer Science and Engineering
 
 
Course Outline: http://www.cse.unsw.edu.au/~cs3153
 
 
Campus: Kensington Campus
 
 
Career: Undergraduate
 
 
Units of Credit: 6
 
 
EFTSL: 0.125 (more info)
 
 
Contact Hours per Week: 3
 
 
Enrolment Requirements:
 
 
Prerequisite: COMP2011 or COMP2711 or COMP2911.
 
 
Equivalent: COMP9153
 
 
Fee Band:   (more info)
 
 
Further Information: See Class Timetable
 
 

Description

This course replaces COMP4151, students can not receive credit for both

It is virtually impossible to guarantee the correctness of a system, and in turn the absense of bugs by standard software engineering practice such as code review, systematic testing and good software design alone. The formal methods community has developed various rigorous, mathematically sound techniques and tools that allow the automatic analysis of systems and software. The application of these fully automatic techniques is typically called algorithmic verification.

The course will describe several automatic verification techniques, the algoriths they are based on, and the tools that support them. We will discuss examples to which the techniques have been applied, and provide experience with the use of several tools.

Further Information

URL for this page:

© The University of New South Wales (CRICOS Provider No.: 00098G), 2004-2011. The information contained in this Handbook is indicative only. While every effort is made to keep this information up-to-date, the University reserves the right to discontinue or vary arrangements, programs and courses at any time without notice and at its discretion. While the University will try to avoid or minimise any inconvenience, changes may also be made to programs, courses and staff after enrolment. The University may also set limits on the number of students in a course.