▶Japanese
Post to SNS
- Home
- > School of Computing
- > Graduate major in Mathematical and Computing Science
- > Software Verification
- School of Science
-
School of Engineering
- Undergraduate major in Mechanical Engineering
- Undergraduate major in Systems and Control Engineering
- Undergraduate major in Electrical and Electronic Engineering
- Undergraduate major in Information and Communications Engineering
- Undergraduate major in Industrial Engineering and Economics
- Common courses
- School of Materials and Chemical Technology
- School of Computing
- School of Life Science and Technology
- School of Environment and Society
- 工学院，物質理工学院，環境・社会理工学院共通科目
- Liberal arts and basic science courses
- First-Year Courses
- School of Science
- School of Engineering
- School of Materials and Chemical Technology
- School of Computing
- School of Life Science and Technology
-
School of Environment and Society
- Department of Architecture and Building Engineering
- Department of Civil and Environmental Engineering
- Department of Transdisciplinary Science and Engineering
- Department of Social and Human Sciences
- Department of Innovation Science
- Graduate major in Technology and Innovation Management
- Common courses
- Liberal arts and basic science courses
- Academic unit or major
- Graduate major in Mathematical and Computing Science
- Instructor(s)
- Minamide Yasuhiko Masuhara Hidehiko
- Class Format
- Lecture
- Media-enhanced courses
- Day/Period(Room No.)
- Tue7-8(W832) Fri7-8(W832)
- Group
- -
- Course number
- MCS.T509
- Credits
- 2
- Academic year
- 2016
- Offered quarter
- 2Q
- Syllabus updated
- 2016/4/27
- Lecture notes updated
- -
- Language used
- Japanese
- Access Index
-
Course description and aims
This course covers the theories for software verification such as operational semantics, Hoare logic, model checking, automata over infinite words.
Student learning outcomes
Students understand the theories related to software verification and get better understanding of various computation models.
Keywords
operational semantics, Hoare logic, model checking, automaton over infinite words
Competencies that will be developed
| ✔ Specialist skills | Intercultural skills | Communication skills | Critical thinking skills | Practical and/or problem-solving skills |
Class flow
Lectures will be given according to the following schedule. For the latter half, we choose several topics as such pushdown model checking, timed automata, and tree automata.
Course schedule/Required learning
| Course schedule | Required learning | |
|---|---|---|
| Class 1 | Semantics of programming languages: denotational semantics, operational semantics | Understand the basics of semantics of programming languages |
| Class 2 | Hoare Logic(1): | Understand the basics of Hoare logic |
| Class 3 | Hoare Logic(2): soundness and relative completeness | Understand the soundness of Hoare logic |
| Class 4 | Review: the theory of automata | Review the theory of automata |
| Class 5 | automata over infinite words(1) | Understand what are automata over infinite words |
| Class 6 | automata over infinite words(2) | Understand the basic theory of automata over infinite words |
| Class 7 | Temporal logic: LTL , CTL | Understand the basics of temporal logic |
| Class 8 | Model checking(1) | Understand the basics of model checking |
| Class 9 | Model checking(2) | Understand some algorithms for model checking |
Textbook(s)
None required.
Reference books, course materials, etc.
Course materials are provided during class.
The following is reference books related to this course.
*Formal Semantics of Programming Languages, Glynn Winskel, MIT Press, 1993.
*Automata Theory: An Algorithmic Approach, Javier Esparza.(https://www7.in.tum.de/~esparza/automatanotes.html)
Assessment criteria and methods
Students are assessed based on scores of exams and exercise problems.
Related courses
- MCS.T214 ： Theory of Automata and Languages
- MCS.T334 ： Compiler Construction
Prerequisites (i.e., required knowledge, skills, courses, etc.)
Students require the knowledge of automata and context-free grammars.
