Modules

11 results

Elective Modules Informatics11

Formal Methods and their Applications (FMA)11

Theorie11

Accepted Elective in Formal Methods and their ApplicationsNo ratings for this module yet.Formal Methods and their Applications (FMA) › Theorieno date this semesterIN99517Anerkennung 2 FMA_THEONo ratings for this module yet.Formal Methods and their Applications (FMA) › Theorieno date this semesterIN99518Automata and Formal LanguagesNo ratings for this module yet.Formal Methods and their Applications (FMA) › TheorieYou learn how different classes of automata (finite, deterministic, nondeterministic, Büchi automata) are used as data structures for the representation and manipulation of (also infinite) sets and relations. You practice building and composing automata, automatic operations (e.g., boolean operations, joins) and the connection between automata and logic as well as their application in pattern matching, program verification and in problems such as Diophantine equations.8 ECTSruns this semesterIN2041Compiler Construction INo ratings for this module yet.Formal Methods and their Applications (FMA) › TheorieYou learn how compilers are built and how they translate programs from a higher programming language into machine instructions. In the end you will be able to explain the core components frontend, middleend and backend and implement a simple compiler for a small language and target architecture.5 ECTSno date this semesterIN2227Lambda CalculusNo ratings for this module yet.Formal Methods and their Applications (FMA) › TheorieYou learn the fundamentals of the lambda calculus as a model of programming languages. First you treat untyped lambda calculus, its reduction rules, evaluation strategies (e.g., call-by-value, call-by-name) and its Turing completeness. In the second part you learn typed lambda calculi, common type systems in functional languages and the connection between types and logic (Curry–Howard). In the end you can use lambda terms, translate them and prove their properties.5 ECTSno date this semesterIN2358
6 more in TheorieLogicNo ratings for this module yet.Formal Methods and their Applications (FMA) › TheorieYou learn the basics of propositional and predicate logic: syntax, semantics and formal proof systems. In the end you will be able to conduct proofs in deductive systems, demonstrate soundness and completeness, formalize problems and apply simple decision or semi-decision procedures such as resolution.8 ECTSno date this semesterIN2049Model CheckingNo ratings for this module yet.Formal Methods and their Applications (FMA) › TheorieYou will learn how to describe hardware and software systems with formal models and how to automatically verify these models using model checking methods to determine whether they satisfy desired properties. In the end you will be able to model simple systems, formulate properties in temporal logic, and explain basic model-checking algorithms as well as strategies against the state-space explosion problem and apply them to small examples.8 ECTSno date this semesterIN2050Petri NetsNo ratings for this module yet.Formal Methods and their Applications (FMA) › TheorieYou will become acquainted with Petri nets as a formal model for describing and analyzing concurrent systems. In the end you will be able to model simple systems with Petri nets, analyze small nets by hand, and select suitable automatic analysis techniques and software tools for larger nets to assess behavior and properties.5 ECTSno date this semesterIN2052Program OptimizationNo ratings for this module yet.Formal Methods and their Applications (FMA) › TheorieYou will learn methods and analyses to improve the runtime efficiency of programs. The module covers data-flow analyses, fixed-point calculations and optimizing transformations, as well as hardware-near techniques such as register allocation, instruction selection and scheduling. In the end you will be able to apply analyses to small programs and develop optimizations.8 ECTSruns this semesterIN2053SemanticsNo ratings for this module yet.Formal Methods and their Applications (FMA) › TheorieYou learn formal techniques for describing and analyzing the semantics of programming languages. In the end you will be able to understand and apply different semantics styles (operational, denotational, axiomatic) as well as define semantics for language constructs and prove properties such as type safety.8 ECTSno date this semesterIN2055Virtual MachinesNo ratings for this module yet.Formal Methods and their Applications (FMA) › TheorieYou learn how programs in different languages are mapped to code for idealized (virtual) machines via translation schemes. In the end you will be able to generate machine commands for excerpts of programs and develop translation schemes for given language constructs.6 ECTSno date this semesterIN2040