Formal Methods in Computer Science WM-I-S1-MFINF
This course introduces selected formal methods used in computer science and their mathematical foundations. It covers various models of computation—including automata, Turing machines, recursive functions, lambda calculus, term calculus, basic concepts of type theory, and selected logical systems—as well as the connections between these formalisms, programming languages, and methods of representing computation.
The course presents methods for formally describing program behavior, specifying program properties, and reasoning about correctness. It is complemented by selected models of concurrency, the fundamental concepts of category theory, and examples of their application in computer science.
The aim of the course is to familiarize students with various approaches to the mathematical and formal modeling of computation and to develop the ability to select and apply specific formal methods to the analysis of problems in computer science.
(in Polish) Dyscyplina naukowa, do której odnoszą się efekty uczenia się
(in Polish) E-Learning
(in Polish) Grupa przedmiotów ogólnouczenianych
Course coordinators
(in Polish) Opis nakładu pracy studenta w ECTS
Subject level
Learning outcome code/codes
Type of subject
Preliminary Requirements
Learning outcomes
LECTURE
The student:
W1 – characterizes selected formal models of computation and explains their fundamental properties and applications in computer science (I1_W14),
W2 – describes selected logical formalisms, calculi, and type systems used to represent and analyze computations (I1_W14),
W3 – explains fundamental methods for the formal description of program behavior, the specification of program properties, and reasoning about program correctness (I1_W14).
LABORATORY
The student:
U1 – applies selected formal models and methods to represent and analyze computations (I1_U18),
U2 – applies selected logical formalisms, calculi, and type systems to solve problems related to the formal foundations of computer science (I1_U18),
U3 – utilizes selected computer science methods and tools to model, analyze, and verify the properties of programs and computational processes (I1_U18).
Assessment criteria
For all learning outcomes, the following assessment criteria are adopted for all forms of verification:
grade 5: fully achieved (no obvious shortcomings),
grade 4.5: achieved almost fully and criteria for awarding a higher grade are not met,
grade 4: largely achieved and the criteria for a higher grade are not met,
grade 3.5: largely achieved with a clear majority of positives and the criteria for granting a higher grade are not met,
grade 3: achieved for most of the cases covered by the verification and criteria for a higher grade are not met,
grade 2: not achieved for most of the cases covered by the verification.
Additional information
Additional information (registration calendar, class conductors, localization and schedules of classes), might be available in the USOSweb system: