Course of Automatic Software Verification (Verifica Automatica del Software)
First Year of the Laurea Magistrale in Ingegneria Informatica.
6 cfu (crediti formativi). Code: 8039737.
Settore Scientifico Disciplinare: Sistemi di Elaborazione delle Informazioni.
60 hours of face-to-face teaching (unique module).
Contratto integrativo: Proofs of Properties of Programs
(Dr. Ing. Xxx Yyy) (5 hours).
25.09.17 to 20.01.18
Tuesday 11:30-13:15 (Room B5)
Friday 11:30-13:15 (Room B12)
Same time and place as the exams of the course: Automi e Linguaggi.
Please, visit that site.
You should register using the online system http://delphi.uniroma2.it
and send to the teacher (email@example.com)
seven days before the day of the call an email
with the subject: asv2018_Lastname_Firstname_RegistrationNumber
and the message:
'Desidero prenotarmi per l'appello del day/month/year.
Ho svolto il take-home-exam da solo. First_name Family_name'
You should attach (in .pdf format) a report of the solutions of the take-home-exam.
Normally, you cannot register to more than one exam calls per exam session
and no more than three exam calls per academic year.
On the day of the written exam you should hand-in a paper report
with the solution of the take-home-exam.
On the day of the oral exam you should come with a PC with the programs
of the project A1 (or the projects A1 and A2), ready for execution.
course offers an overview of the methods for the definition
of the semantics of the imperative, functional, logic, and concurrent programming languages.
Those methods deepen the logical and algebraic understanding of various techniques
for specifying and verifying properties of programs written in those languages.
Some programming projects and the use of suitable software tools will
reinforce the understanding of the theoretical notions.
Syllabus and Exam Questions.
Take-home-exam: to be done by yourself.
2. Structural induction and rule induction.
3. Operational, denotational, and axiomatic semantics of an imperative language.
Hoare's triples for partial correctness.
4. Operational and denotational semantics of a first order functional language.
5. Domain theory. Proofs of properties of functional programs.
6. Operational and denotational semantics of a higher order functional language.
7. Operational and denotational semantics of Horn-clause programs.
8. Milner's calculus for communicating concurrent processes.
9. mu-calculus and proofs of communicating processes. Software model checking.
for the course: Fundamentals
notions of Computer Science. Algorithms and Data Structures.
Elements of Algebra and elements of Predicate Calculus.
Attendance to lectures is compulsory.
Previous Exam Questions
Statistics of the outcome of previous exam sessions.
(i) Marks: 18 - 20: 10 exercises of the take-home-exam + Project A1 + Written and Oral Exam.
(ii) Marks: 21 - 25: 10 exercises of the take-home-exam + Projects A1 and A2 + Written and Oral Exam.
(iii) Marks: 26 – 30L: all exercises of the take-home-exam + Projects A1 and A2 + Written and Oral Exam.
[P1] Pettorossi, A.: Semantics of Programming Languages. Third Edition, Aracne Editrice, 2016.
[P2] Pettorossi, A.: Elements of Computability, Decidability, and Complexity, Fifth Edition.
Aracne Editrice, 2016.
[PP] Pettorossi, A., Proietti, M.: First Order Predicate Calculus and Logic Programming,
Fourth Edition, Aracne Editrice, 2016.
Book for further reading:
[Wi] Winskel, G.: The Formal Semantics of Programming Languages: An Introduction,
The MIT Press (1993) (Also available in Italian).