Course Syllabus
The table below gives the planned syllabus for the course. The syllabus lists the topics in order, and gives access to each lecture's meeting outlines, and homeworks and readings.
Material describing the course and its objectives and grading policies is available elsewhere.
This syllabus is subject to change. If it is necessary to revise the schedule, then this page will be updated to reflect the changes.
The readings are from Principles of Programming Analysis (second corrected printing) by Flemming Nielson, Hanne Riis Nielson, and Chris Hankin (Springer-Verlag, 2005).
| Dates | Topics | Homework Due | Readings | Optional Readings |
|---|---|---|---|---|
| Jan. 12 | Introduction | Handouts, Grading Policy | Forward, Preface | |
| Jan. 14 | Overview of Analysis Techniques (Syntax and Semantics of WHILE) | HW0 | Ch 1, 1.1-1.2 | [Hedin-etal09] (Concept Overview) |
| Jan. 19 | Overview of Analysis Techniques (Parsing and ASTs for WHILE) | [Hedin-etal09] (Concept Overview) | Ch 1.2 | |
| Jan. 21 | Overview of Analysis Techniques (Dataflow Analysis) | HW1, p1 | Ch 1.3 | Ch 1.4 |
| Jan. 26 | Overview of Analysis Techniques (Abstract Interpretation) | Ch 1.5 | ||
| Jan. 28 | Overview of Analysis Techniques (Type and Effect Systems), ASTs and CFGs in JastAdd (Attributes, Rewrites) | HW1, p2 | Ch 1.6, [Hedin-etal09] (Abstract Syntax, Attributes) | |
| Feb. 2 | ASTs and CFGs in JastAdd (Attributes, Rewrites) | [Hedin-etal09] (Abstract Syntax, Attributes) | ||
| Feb. 4 | ASTs and CFGs in JastAdd (Attributes, Rewrites) | HW2p1 | [Hedin-etal09] (Abstract Syntax, Attributes) | Ch 2.1 |
| Feb. 9 | ASTs and CFGs in JastAdd (Attributes, Rewrites) | HW2p2,HW2p3 | [Hedin-etal09] (Abstract Syntax, Attributes) | Ch 2.1 |
| Feb. 11 | Intraprocedural Data Flow Analysis (Blocks and Labels, Notation) | Ch 2.1 | ||
| Feb. 16 | Intraprocedural Data Flow Analysis (Blocks and Labels, Notation, Available Expressions, AE Analysis, Very Busy Expressions, Live Variables) | HW2p4 | Ch 2.1-2.1.1 | |
| Feb. 18 | Theory of Data Flow Analysis (Live Variables, ud and du chains, monotone frameworks) | Ch 2.1.4-5, 2.3 | ||
| Feb. 23 | Theory of AE and LV in JastAdd (videos, no in class lecture) | AE analysis in JastAdd video, LV analysis in JastAdd video | Ch 2.1.2-4 | |
| Feb. 25 | Theory of Data Flow Analysis (Monotone frameworks, Equation Solving) | Ch 2.3-2.4 | ||
| Mar. 1 | ( Monotone Frameworks), Calculational Proofs | HW3,p1-5 | [Gries91], [Dijisktra-Scholten90] | [Back-vonWright98] |
| Mar. 3 | Midterm Exam Review | Ch 1, 2.1 | ||
| Mar. 8 | Spring Break, no class | |||
| Mar. 10 | Spring Break, no class | |||
| Mar. 15 | Midterm Exam | Ch 1, 2.1 | ||
| Mar. 17 | Semantics Overview, Structural Operational Semantics (videos, no in class lecture) | HW3,p6 | Ch 2 | |
| Mar. 22 | Structural Operational Semantics | Ch 2.2 | ||
| Mar. 24 | Correctness of LV analysis | Ch 2.2.2 | ||
| Mar. 29 | Type Checking | HW3,p7 | Ch 2.3 | |
| Mar. 31 | Type Checking | Ch 2.3 | ||
| Apr. 5 | Type Checking and type checking in JastAdd | Ch 2.3 | ||
| Apr. 7 | Interprocedural Dataflow Analysis | Ch 2.5 | ||
| Apr. 12 | Interprocedural Dataflow Analysis | Ch 2.5 | ||
| Apr. 14 | Shape Analysis | Ch 2.6 | ||
| Apr. 19 | Shape Analysis | Ch 2.6 | [Manevich-etal05] | |
| Apr. 21 | Project presentations | HW 4 | ||
| Apr. 26 | Project presentations | |||
| Apr. 28, 7am | No class, study day |
Bibliography
- [Back-vonWright98]
- Ralph-Johan Back and Joakim von Wright. Refinement Calculus: A Systematic Introduction, section 4.2, Graduate Texts in Computer Science. Springer-Verlag, Berlin, 1998.
- [Dijkstra-Scholten90]
- Edsger W. Dijkstra and Carel S. Scholten. Predicate Calculus and program semantics, chapter 4, Springer-Verlag, NY, 1990.
- [Gries91]
- David Gries. "Teaching calculation and discrimination: A more effective curriculum." Communications of the ACM, 34(3):44-55, March 1991. http://dx.doi.org/10.1145/102868.102870
- [Hedin-etal09]
- Görel Hedin and others. "JastAdd Manual". http://jastadd.org/web/documentation/reference-manual.php Checked January 4, 2016.
- [Manevich-etal05]
- Roman Manevich and E. Yahav and G. Ramalingam and Mooly Sagiv. Predicate Abstraction and Canonical Abstraction for Singly-Linked Lists. In Verification, Model Checking, and Abstract Interpretation, Springer-Verlag, Lecture Notes in Computer Science, Vol. 3385, pages 181-198. http://dx.doi.org/10.1007/b105073
Previous syllabi from earlier offerings of the class are also available. See the courses's about page.
Last modified Tuesday, April 19, 2016.
This web page is for the Spring 2016 offering of COP 5021 at the University of Central Florida. The details of this course are subject to change as experience dictates. You will be informed of any changes. Please direct any comments or questions to Gary T. Leavens at leavens@eecs.ucf.edu. Some of the policies and web pages for this course are quoted or adapted from other courses I have taught, in particular, COP 4020 and Com S 641.