Syllabus for Programming Theory

Programmeringsteori

Syllabus

  • 10 credits
  • Course code: 1DT034
  • Education cycle: Second cycle
  • Main field(s) of study and in-depth level: Computer Science A1N, Embedded Systems A1N

    Explanation of codes

    The code indicates the education cycle and in-depth level of the course in relation to other courses within the same main field of study according to the requirements for general degrees:

    First cycle

    • G1N: has only upper-secondary level entry requirements
    • G1F: has less than 60 credits in first-cycle course/s as entry requirements
    • G1E: contains specially designed degree project for Higher Education Diploma
    • G2F: has at least 60 credits in first-cycle course/s as entry requirements
    • G2E: has at least 60 credits in first-cycle course/s as entry requirements, contains degree project for Bachelor of Arts/Bachelor of Science
    • GXX: in-depth level of the course cannot be classified

    Second cycle

    • A1N: has only first-cycle course/s as entry requirements
    • A1F: has second-cycle course/s as entry requirements
    • A1E: contains degree project for Master of Arts/Master of Science (60 credits)
    • A2E: contains degree project for Master of Arts/Master of Science (120 credits)
    • AXX: in-depth level of the course cannot be classified

  • Grading system: Fail (U), Pass (3), Pass with credit (4), Pass with distinction (5)
  • Established: 2007-10-04
  • Established by:
  • Revised: 2018-08-30
  • Revised by: The Faculty Board of Science and Technology
  • Applies from: Spring 2019
  • Entry requirements:

    120 credits with 30 credits in mathematics and 30 credits in computer science, including basic programming, data structures, and elementary logic. Proficiency in English equivalent to the Swedish upper secondary course English 6.

  • Responsible department: Department of Information Technology

Learning outcomes

On completion of the course, the student should be able to:

write rigorous descriptions of implementations and specifications of programs,

verify programs, i.e. prove that the implementation of a program meets its specification, and

synthesise programs, i.e. to derive a correct program from a given specification.

Content

The course will contain the following topics:

logical proofs, specification and correctness of programs, weakest preconditions, invariants, partial correctness, termination proofs, total correctness, and program synthesis.

Instruction

Lectures and tutorials.

Assessment

Written exam and assignments.

If there are special reasons for doing so, an examiner may make an exception from the method of assessment indicated and allow a student to be assessed by another method. An example of special reasons might be a certificate regarding special pedagogical support from the disability coordinator of the university.

Syllabus Revisions

Reading list

Reading list

Applies from: Spring 2019

Some titles may be available electronically through the University library.

Print syllabus and reading list
Print