A course is the basic teaching unit, it's design as a medium for a student to acquire comprehensive knowledge and skills indispensable in the given field. A course guarantor is responsible for the factual content of the course.
For each course, there is a department responsible for the course organisation. A person responsible for timetabling for a given department sets a time schedule of teaching and for each class, s/he assigns an instructor and/or an examiner.
Expected time consumption of the course is expressed by a course attribute extent of teaching. For example, extent = 2 +2 indicates two teaching hours of lectures and two teaching hours of seminar (lab) per week.
At the end of each semester, the course instructor has to evaluate the extent to which a student has acquired the expected knowledge and skills. The type of this evaluation is indicated by the attribute completion. So, a course can be completed by just an assessment ('pouze zápočet'), by a graded assessment ('klasifikovaný zápočet'), or by just an examination ('pouze zkouška') or by an assessment and examination ('zápočet a zkouška') .
The difficulty of a given course is evaluated by the amount of ECTS credits.
The course is in session (cf. teaching is going on) during a semester. Each course is offered either in the winter ('zimní') or summer ('letní') semester of an academic year. Exceptionally, a course might be offered in both semesters.
The subject matter of a course is described in various texts.
NI-APR Selected Methods for Program Analysis Extent of teaching: 2P+1C Instructor: Křikava F. Completion: Z,ZK Department: 18101 Credits: 5 Semester: L Annotation:
Program analysis studies program behavior with the aim of code optimization and error detection. Students will learn static program analysis, which approximates program behavior without the need to actually run the program, as well as dynamic program analysis which analyse programs at runtime. Students will be introduced to the common techniques and algorithms and use them on some classical problems.
Lecture syllabus:
1. Introduction to program analysis 2. Type analysis 1 3. Type analysis 2 4. Lattices 5. Fixed points 6. Dataflow analysis 1 7. Dataflow analysis 2 8. Interprocedural analysis 9. Control flow analysis 10. Abstract interpretation 11. Dynamic analysis 12. Introduction to symbolic execution Seminar syllabus:
1. The ?C language 2. Lattices 3. Dataflow analysis 4. Path sensitivity 5. Pointer analysis 6. Dynamic analysis Literature:
1. Anders M?ller and Michael I Schwartzbach. ?Static Program Analysis.? Department of Computer Science, Aarhus University, 2018. 2. Cooper, K. - Torczon, L. : Engineering: A Compiler (2nd Edition). Morgan Kaufmann, 2011. ISBN 978-0120884780. Requirements:
BI-OOP, BI-PPA, NI-MPJ
Informace o předmětu a výukové materiály naleznete na https://courses.fit.cvut.cz/NI-APR/ <https://courses.fit.cvut.cz/NI-APR/ The course is also part of the following Study plans:
Study Plan Study Branch/Specialization Role Recommended semester NI-TI.2023 Computer Science V 2 NI-TI.2020 Computer Science V 2 NI-SI.2020 Software Engineering (in Czech) V 2 NI-NPVS.2020 Design and Programming of Embedded Systems V 2 NI-SPOL.2020 Unspecified Branch/Specialisation of Study VO 2 NI-SP.2020 System Programming PS 2 NI-ZI.2020 Knowledge Engineering V 2 NI-PB.2020 Computer Security V 2 NI-MI.2020 Managerial Informatics V 2 NI-TI.2018 Computer Science V 2 NIE-DBE.2023 Digital Business Engineering VO 2 NI-SPOL.2020 Unspecified Branch/Specialisation of Study VO 2 NI-WI.2020 Web Engineering V 2 NI-SP.2023 System Programming PS 2 NI-PSS.2020 Computer Systems and Networks V 2
Page updated 19. 4. 2024, semester: L/2020-1, L/2021-2, Z/2023-4, Z/2024-5, Z/2019-20, Z/2022-3, L/2019-20, L/2022-3, Z/2020-1, Z/2021-2, L/2023-4, Send comments to the content presented here to Administrator of study plans Design and implementation: J. Novák, I. Halaška