• Offered by Research School of Computer Science
  • ANU College ANU College of Engineering and Computer Science
  • Course subject Computer Science
  • Academic career PGRD
  • Course convener
    • Prof Rajeev Gore
  • Mode of delivery In Person
  • Co-taught Course
  • Offered in Second Semester 2014
    See Future Offerings

This course presents some formal notations that are commonly used for the description of computation and of computing systems, for the specification of software and for mathematically rigorous arguments about program properties. The following areas of study constitute the backbone of the course. Predicate calculus and natural deduction, inductive definitions of data types as a basis for recursive functions and structural induction, formal language theory (particularly regular expressions, finite state machines and context free grammars), specification languages, propositional programming language semantics, partial correctness and proofs of termination.

Learning Outcomes

Upon successful completion, students will have the knowledge and skills to:

Upon completion of this course, the student will be able to do the following:

  1. Apply the concepts of standard mathematical logic to produce proofs or refutations of well-formed propositions or arguments phrased in English or in a variety of formal notations (first order logic, discrete mathematics or Hoare Logic).
  2. Given a description of a regular language, either in English, as a regular expression or as a grammar, generate a finite state automaton that recognizes that language. Similarly, given a deterministic or nondeterministic automaton, give a description of the language which it accepts.
  3. Given an inductive definition of a simple data structure, write a recursive definition of a given simple operation on data of that type. Given some such recursively defined operations, prove simple properties of these functions using the appropriate structural induction principle.
  4. Prove simple programs correct using Hoare Logic.
  5. Prove correctness and termination of a simple program using the weakest precondition calculus.
  6. Specify a simple system using Z.
  7. Understand very simple Prolog programs.

Indicative Assessment

Assignments (36%); Tutorials (4%); Quiz (10%); Final Exam (50%)

The ANU uses Turnitin to enhance student citation and referencing techniques, and to assess assignment submissions as a component of the University's approach to managing Academic Integrity. While the use of Turnitin is not mandatory, the ANU highly recommends Turnitin is used by both teaching staff and students. For additional information regarding Turnitin please visit the ANU Online website.

Workload

Thirty one-hour lectures and nine one-hour tutorials

Fees

Tuition fees are for the academic year indicated at the top of the page.  

If you are a domestic graduate coursework or international student you will be required to pay tuition fees. Students continuing in their current program of study will have their tuition fees indexed annually from the year in which you commenced your program. Further information for domestic and international students about tuition and other fees can be found at Fees.

Student Contribution Band:
2
Unit value:
6 units

If you are an undergraduate student and have been offered a Commonwealth supported place, your fees are set by the Australian Government for each course. At ANU 1 EFTSL is 48 units (normally 8 x 6-unit courses). You can find your student contribution amount for each course at Fees.  Where there is a unit range displayed for this course, not all unit options below may be available.

Units EFTSL
6.00 0.12500
Domestic fee paying students
Year Fee
1994-2003 $1980
2004 $2088
2005 $2088
2006 $2088
2007 $2088
2008 $2190
2009 $2916
2010 $2916
2011 $2946
2012 $2946
2013 $2946
2014 $2952
International fee paying students
Year Fee
1994-2003 $3450
2004 $3450
2005 $3534
2006 $3618
2007 $3618
2008 $3618
2009 $3618
2010 $3750
2011 $3756
2012 $3756
2013 $3756
2014 $3762
Note: Please note that fee information is for current year only.

Offerings, Dates and Class Summary Links

The list of offerings for future years is indicative only.
Class summaries, if available, can be accessed by clicking on the View link for the relevant class number.

Second Semester

Class number Class start date Last day to enrol Census date Class end date Mode Of Delivery Class Summary
8687 21 Jul 2014 08 Aug 2014 31 Aug 2014 30 Oct 2014 In Person N/A

Responsible Officer: Registrar, Student Administration / Page Contact: Website Administrator / Frequently Asked Questions