- Allgemein:
- 89-6201
- 4 h @ 45 min per week lecture (4 Std.)
Tuesday, 8.15 - 9.45 Uhr, room 13-222
Friday, 8.15 - 9.45 Uhr, room 42-110
2 h @ 45 min per week exercise
- A) The mathematically exact specification and verification of
algorithms has become increasingly important in theoretical
informatics, due to the rising complexity in the area of software
development. Various mathematical models of the term algorithm lead
to different specification and verification techniques. This
lecture presents important mathematical models of algorithm and the
specification and verification techniques based on each of them,
e.g. graph rewriting as computability model, and an introduction to
Algebraic Specification and Verification.
- B) Books:
Dörr, Heiko: Efficient graph rewriting and its implementation, Springer, 1995. INF 355/021.
Ehrig, Hartmut, Mahr, Bernd: Fundamentals of algebraic specification, Springer., 1985, INF 510/038.
Baader, Nipkow: Term Rewriting and All That, Cambridge UP, 1998
Börger, Stärk : Abstract State Machines Springer
Nissanke: Formal Specification Techniques and Applications Springer 99
Astesiano, Kreowski, Krieg-Brückner: Algebraic Foundations of System Specifications (IFIP)
- C) Software-Entwicklung 1, 2, Mathematik, Formale Grundlagen der Programmierung, Logik, Entwurf und Analyse von Algorithmen.
- E) Kernveranstaltung des Lehrgebietes.
- First lecture: 2007-10-23
- Further information: KIS
- Slides/Preparatory material:
Slides for on-line reading:
1-386
Slides for printing (4 per page):
1-386
Additional material:
ASM-examples ,
Refinement-Methods ,
Shortest Paths ,
printable.tex for rearranging slides for printing in further ways.
For other arrangements of the slides, you might consider the following
TeX-File as starting point, which is used to prepare the slides for
printing as above: printable.tex
