|Monday||2:30 PM - 5:30 PM||lesson||Lecture Hall I|
|Wednesday||4:30 PM - 6:30 PM||lesson||Lecture Hall I|
The class presents problems and methods for system analysis and verification,
by automated reasoning techniques, such as theorem proving applied to deductive verification or model checking.
The students learn to solve the problems arising when expressing the behavior of systems in logical formulae, and to design automated reasoners capable to handle such formulae efficiently.
Proof procedures in propositional and first-order logic. First-order theories.
Hoare logic, annotations, partial and total correctness, states, paths, invariants. Verification conditions for partial and total correctness: generation and proof of validity.
Decision procedures for equality, data structures, fragments of arithmetic, and their combination.
The grade is given by 30% C1 + 30% C2 + 40% P, where C1 is the midterm exam, C2 is the final exam and P is a project. The grade thus generated is registered at the first exam session in June.
For all other sessions, the grade is given by 100% E, where E is a written test, hard enough to match the difficulty of C1 + C2 + P.
Registration: all grades will be registered.
Withdrawal: Students may withdraw by informing the instructor.
Cheating: All tests and projects are individual work. Cheating is strictly forbidden and will determine lowering of grades.
Strada le Grazie 15
VAT number 01541040232
Italian Fiscal Code 93009870234
© 2020 | Verona University | Credits