Infopaket

Software-oriented logics

ОК.15

Обов’язкова дисципліна для ОП

Second

2021/2022

2 Semester

3

PLO01. Know and systematically apply methods of analysis and modeling of the application area, identifying information needs and collecting source data for software design. PLO08. To carry out analytical research of parameters of software systems for their validation and verification, to carry out the analysis of the chosen ones methods, means of automated design and implementation of software. PLO13. Acquire new scientific and professional knowledge in the field of applied logic, improve skills, predict the development of software systems and information technology.

Full-time form

1. Know: basic concepts of discrete mathematics, programming, system programming and operational systems. 2. Be able to: build mathematical models corresponding areas, create specifications and perform verification on the models. 3. Have basic skills: programming in C, C ++, Java.

The purpose of the discipline - is an in-depth study of mathematical logic, namely program-oriented logic. In the applied aspect, the apparatus of mathematical logic is necessary for adequate modeling of various subject areas, formulation of property specifications and creation of modern software and information systems. As a result of studying the discipline, the student must: know the basic logical languages and means of these languages to perform problem analysis, mathematical models of relevant subject areas; be able to create specifications and verify models, solve problems of verification of specifications on models, program in procedural, functional, logical and object-oriented styles, compile written reports.

1. Papadimitriou C.R. Computational complexity. – Addison-Wesley/ - 1994. -532 p. 2. Fisher M.J., Ladner R.E. Propositional Modal Logic of Programs. . In Proc. 9-th ACM Ann. Symposium on Theory of Computing. – 1977. - P. 286 -294. 3. Fisher M.J., Ladner R.E. Propositional Dynamic Logic of regular programs. J. Comp. System Sci. - 1979. - v.18. - N 2. - P. 194-211. 4. Goldblatt R. Logics of Time and Computation. - Lecture Notes. - N 7. Center for the Study Of Language and Information. - 1987. - P. 1-27. 5. Ben-Ari M. Mathematical Logic for Computer Science. - Prentice Hall International (UK) Ltd. – 1993. - 305 p. 6. Bryant R.E. Symbolic Boolean Manipulation with Ordered Binary Decision Diagrams. - Scool of Comp. Science, Carnegi Mellon University, Pittsburg. - 1992 (june). - 34 p.

Lectures, classes, independent work, tests, homework, defense of homework, exam.

- Semester assessment: 1. Test 1: LO 1.1, LO1.2 - 10 points / 6 points. 2. Test 2: LO1.3 - 10 points / 6 points. 3. Homework 1-7: LO1.1, LO1.2, LO1.3-10 points / 6 points. 4. Protection of homework 1 (project): LO2.1, LO3.1, LO4.1, LO4.2 - 11 points / 6 points. 5. Protection of homework 2 (project): LO2.1, LO3.1, LO4.1, LO4.2 - 8 points / 5 points. 6. Protection of homework 3 (project): LO2.1, LO3.1, LO4.1, LO4.2 - 11 points / 6 points. In one of the forms of control, the student has the right to replace it with a certificate with the possibility of obtaining 9 points. To exercise this right, the student must, by 1st of January of the current year, write and attach to the classroom a statement with his personal signature. Final assessment (in the form of an exam): - maximum number of points: 40 points; - learning outcomes which shall be assessed: LO1.1, LO1.2, LO1.3, LO2.1.

Ukrainian