Title:

Formal Program Analysis

Code:FAD
Ac.Year:2009/2010
Sem:Winter
Curriculums:
ProgrammeField/
Specialization
YearDuty
CSE-PHD-4DVI4-Elective
Language of Instruction:Czech
Completion:examination (verbal)
Type of
instruction:
Hour/semLecturesSeminar
Exercises
Laboratory
Exercises
Computer
Exercises
Other
Hours:260000
 ExamsTestsExercisesLaboratoriesOther
Points:1000000
Guarantor:Vojnar Tomáš, prof. Ing., Ph.D. (DITS)
Faculty:Faculty of Information Technology BUT
Department:Department of Intelligent Systems FIT BUT
 
Learning objectives:
  The goal of the course is to acquaint the students with principles, possibilities, and restrictions of the currently most successful methods known, resp. being studied, in the area of applying formal methods for an automated analysis and verification of programs.
Description:
  An overview of various methods of analysis and verification of programs with formal roots. Model checking of finite-state systems: the basic principles, specification of properties to be verified, temporal logics, the state explosion problem and existing approaches to solving it (esp. partial order reduction and symbolic verification based on binary decision diagrams). Predicate abstraction. Various ways of static analysis, dataflow analyses, bug pattern analyses, abstract interpretation. SAT solving and SMT solving. Dynamic analyses.
Knowledge and skills required for the course:
  Acquaintance with basics of logics, algebra, graph theory, theory of formal languages and automata, compilers, and computability and complexity.
Subject specific learning outcomes and competencies:
  Acquaintance with possibilities, limitations, and principles of the state-of-the-art methods of program analysis on a formal basis. Ability to apply them in advanced projects and an overall knowledge of the way these techniques can evolve in the future.
Generic learning outcomes and competencies:
  A deeper ability to read and create formal texts.
Syllabus of lectures:
 
  1. An overview of the existing methods of formal analysis and verification of programs, their possibilities, advantages and disadvantages.
  2. Temporal logics CTL, LTL, and CTL*.
  3. Explicit-state CTL* model checking.
  4. The state explosion problem and possibilities of fighting it. Partial order reduction.
  5. Binary decision diagrams (BDDs).
  6. Symbolic verification based on BDDs.
  7. The automata-theoretic approach to LTL model checking.
  8. Automated abstraction with a stress on predicate abstraction, Craig interpolants.
  9. SAT solving, SMT solving.
  10. Classical dataflow analyses (such as live variables, available expressions, etc.) as well as some selected, more advanced dataflow analyses (like some pointer analyses).
  11. A note on abstract interpretation.
  12. Static analyses based on searching for bug patterns.
  13. Dynamic analyses.
Syllabus - others, projects and individual work of students:
 
  1. To read and understand a state-of-the-art research paper (or papers) from the area of model checking, theorem proving, static or dynamic analysis and to write a report based on the paper (papers) read.
Fundamental literature:
 
  • Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking, MIT Press, 2000. ISBN 0-262-03270-8
  • Berard, B., Bidoit, M., Finkel, A., Laroussinie, F., Petit, A., Petrucci, L., Schnoebelen, P., McKenzie, P.: Systems and Software Verification: Model-Checking Techniques and Tools, Springer-Verlag, 2001. ISBN 3-540-41523-8
  • Monin, J.F., Hinchey, M.G.: Understanding Formal Methods, Springer-Verlag, 2003. ISBN 1-852-33247-6
  • Valmari, A.: The State Explosion Problem. In Reisig, W., Rozenberg, G.: Lectures on Petri Nets I: Basic Models, Lecture Notes in Computer Science, č.1491, s. 429-528. Springer-Verlag, 1998. ISBN 3-540-65306-6
  • Nielson, F., Nielson, H.R., Hankin, C.: Principles of Program Analysis, Springer-Verlag, 2005. ISBN 3-540-65410-0
  • Schwartzbach, M.I.: Lecture Notes on Static Analysis, BRICS, Department of Computer Science, University of Aarhus, Denmark, 2006.
Study literature:
 
  • Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking, MIT Press, 2000. ISBN 0-262-03270-8
  • Nielson, F., Nielson, H.R., Hankin, C.: Principles of Program Analysis, Springer-Verlag, 2005. ISBN 3-540-65410-0
Controlled instruction:
  Lectures and a preparation of a report.
Progress assessment:
  Discussions within the lectures, a check of the prepared report.
 

Your IPv4 address: 54.82.99.169
Switch to https

DNSSEC [dnssec]