cse6323-001-2015 fall syllabus.pdf - Automated Software...

Automated Software Engineering (CSE6323)
University of Texas at Arlington
Computer Science and Engineering
Instructor: Taylor Johnson
Email Address: [email protected] (replace firstname with Taylor and lastname with
Johnson and note there is no mavs subdomain)
Office Number: Engineering Research Building 559 (ERB 559)
Office Telephone Number: 817­272­3610 (note: voicemail is never checked, email me if you
miss me)
Faculty Profile:
Section Information: CSE 6323­001, Fall 2015 ( TBD )
Course Website:
Time and Place of Class Meetings: Tuesdays/Thursdays 3:30pm­4:50pm, UTA ­ Woolf Hall
210 (WH 210)
Office Hours: ERB559, Tuesdays/Thursdays 10am­11am and by appointment (email me to
schedule by appointment)
Graduate Teaching Assistant (GTA): TBD
Graduate Teaching Assistant Email Address:
Graduate Teaching Assistant Office Hours: TBD, ERB 562
Course Schedule ( Syllabus ; note that all information appearing on this website
supersedes that appearing in the syllabus PDF, that is, this website is more up­to­
date): The instructor for this course reserves the right to adjust this schedule in any way that
serves the educational needs of the students enrolled in this course. All assignments and due
dates are approximate at this point and will be updated on this website as the semester
progresses. All readings refer to the Alur required textbook unless otherwise noted.
Date Content Resources / Readings Assignments
8/27
Introduction and Course
Overview: What is
automated software
engineering and what
are formal methods?
(First Day of Classes)
Alur Chapter 1
9/1
Math review:
propositional logic and
set theory
Reading: Aho and Ullman, Chapter 12
(particularly 12.2, 12.3, and 12.4, remainder
may be skimmed, except skip 12.6, as they will
come up again later in the course) and Chapter
14 (14.1, 14.2, 14.3, 14.4); Additional
References: Lee and Seshia, Appendix B
Homework 1
Assigned (files
on
BlackBoard)
9/3
Math review: first­order
logic and higher­order
logic
Reading: Aho and Ullman, Chapter 12
(particularly 12.2, 12.3, and 12.4, remainder
may be skimmed, except skip 12.6, as they will
come up again later in the course) and Chapter
14 (14.1, 14.2, 14.3, 14.4); Additional
References: Lee and Seshia, Appendix B
9/8
Math review: automata
theory and formal
languages
Reading: Aho and Ullman, Chapter 12
(particularly 12.2, 12.3, and 12.4, remainder
may be skimmed, except skip 12.6, as they will
come up again later in the course) and Chapter
14 (14.1, 14.2, 14.3, 14.4); Additional
References: Lee and Seshia, Appendix B
Homework 1

9/10
Formal models:
transition systems
Reading: Alur, Chapters 2 and 4 (skim chapter
4); Additional References: Lee and Seshia,
Chapters 3 and 5 (and partly 6)
Due;
Homework 2
Assigned (files
on
BlackBoard)
9/15
Formal models:
synchronous networks
and transition systems
Reading: Alur, Chapters 2 and 4 (skim chapter
4); Additional References: Lee and Seshia,
Chapters 3 and 5 (and partly 6)
9/17
Formal specifications:
safety
Reading: Alur, Section 3.1, Section 5.1;
Additional References: Lee and Seshia, Chapter
13
9/22
Formal methods for
safety: inductive
invariant proofs
Reading: Alur, Section 3.2
Homework 2
Due;
Homework 3
Assigned (files
on
BlackBoard)
9/24
Formal methods for
safety: reachability
analysis
Reading: Alur, Section 3.3
9/29
Formal models:
asynchronous networks
and transition systems
Reading: Alur, Section 5.2
10/1
Formal specifications:
liveness, linear
temporal logic (LTL),
and computation tree
logic (CTL)
Reading: Alur, Section 5.2
10/6
Formal methods for
liveness: LTL model
checking and
repeatability analysis
Reading: Alur, Section 5.3
Homework 4
Assigned (files
on
BlackBoard)
10/8
Automated/interactive
theorem proving:
overview