Programming Logic for Complex Systems This course covers program verification methods for a class of programs, commonly referred to as reactive programs. Reactive programs typically never terminate and are run in order to maintain some interaction with the environment. An adequate description of reactive systems must refer not only to initial and final states, but also to the ongoing behaviour as a (possibly infinite) sequence of states and events. The purpose of this course is to investigate the use of logical calculi for the specification, design and verification of reactive systems. Topics include: modelling of discrete event systems, semantics of real-time languages, logical and discrete calculi (e.g. temporal logic) for specifying and verifying safety, liveness, deadlock, priority and fairness properties of reactive programs, and prolog tools for automating verification

Lectures are in the Software Engineering lab CSE2056. The workstations are equipped with the Rodin (Event-B ) and Spin toolsets. Interspersed with the lectures, you will be asked to do small developments and proofs.

• User Requirements Documents , System Specifications and Models
• Introduction to formal methods
• Example of a concurrent system: controlling cars on a bridge (Event-B)
• Spin, Linear Time Temporal Logic and concurrency
• Mathematical Language and Proofs (Event-B)
• Sequential Program Development & Proofs.
• Two guest lectures by Albert Lai on Predicative Programming and the PVS theorem prover
• Example: File Transfer Protocol
• Wrap-up: Science, Mathematical Models, Prediction and Engineering