Main content
This entry is from Winter semester 2020/21 and might be obsolete. No current equivalent could be found.
CS 522 — Computer-assisted Theorem Proving
(dt. Rechnergestützte Beweissysteme)
Level, degree of commitment | Advanced module, compulsory elective module |
Forms of teaching and learning, workload |
Lecture (4 SWS), recitation class (2 SWS), 270 hours (90 h attendance, 180 h private study) |
Credit points, formal requirements |
9 CP Course requirement(s): Successful completion of at least 50 percent of the points from the weekly exercises as well as at least 2 presentations of the tasks. Examination type: Oral or written examination |
Language, Grading |
German,The grading is done with 0 to 15 points according to the examination regulations for the degree program B.Sc. Computer Science. |
Duration, frequency |
One semester, alle 3 bis 4 Semester |
Person in charge of the module's outline | Prof. Dr. H.-Peter Gumm |
Contents
- Sequential calculus for Propositional and Predicate Logic
- Resolution Methods for Predicate Logic
- Specifying and Proving in PVS
- Typed Logic and Type Correctness Conditions
- Equality, Rewrite-Systems,
- Decision Procedures, Nelson-Oppen, Shostak Algorithm
- Induction and Higher Order Logic
- Synthesis of Programs and Data Types
- Co-Datatypes
- Intuitionistic Logic and Intuitionistic Calculi
- Implementation of Non-Standard Logics in Jape
- Hardware Synthesis: The Lambda System
Qualification Goals
- Formal specification of proof tasks,
- Methods, calculations and algorithms for computer-aided proof,
- Dealing with industrial strength interactive proof systems,
- Special logics and their treatments,
- Training scientific skills (recognition, formulation, problem solving, abstraction),
- Training of oral communication skills in the labs by practicing free speech and discussion in front of an audience.
Prerequisites
None. The competences taught in the following modules are recommended: Theoretical Computer Science, Logic.
Applicability
The module can be attended at FB12 in study program(s)
- B.Sc. Computer Science
- M.Sc. Computer Science
- M.Sc. Mathematics
- LAaG Computer Science
When studying B.Sc. Computer Science, this module can be attended in the study area Compulsory Elective Modules in Computer Science.
The module can also be used in other study programs (export module).
The module is assigned to Theoretical Computer Science. Further information on eligibility can be found in the description of the study area.
Recommended Reading
- N.Shankar: Specification and Proof with PVS (http://fm.csl.sri.com/SSFT15/PVScourse.pdf)
- M. Hofmann: Vorlesungsskript Rechnergestütztes Beweisen, 2006
- F.v.Henke, K.Pfeifer: PVS Einführung. 2006
- S. Owre, J. Rushby, et al: A tutorial introduction to PVS, 1996
- W. Schreiner: The RISC ProofNavigator, Tutorial and Manual, RISC, 2008.
Please note:
This page describes a module according to the latest valid module guide in Winter semester 2020/21. Most rules valid for a module are not covered by the examination regulations and can therefore be updated on a semesterly basis. The following versions are available in the online module guide:
- Winter 2016/17
- Summer 2018
- Winter 2018/19
- Winter 2019/20
- Winter 2020/21
- Summer 2021
- Winter 2021/22
- Winter 2022/23
- Winter 2023/24 (no corresponding element)
The module guide contains all modules, independent of the current event offer. Please compare the current course catalogue in Marvin.
The information in this online module guide was created automatically. Legally binding is only the information in the examination regulations (Prüfungsordnung). If you notice any discrepancies or errors, we would be grateful for any advice.