Enea Zaffanella (Master Degree in Computer Science, University of Pisa, 1993; PhD in Computer Science, University of Leeds, 2002) since 2006 is an Associate Professor in Computer Science at the University of Parma; from 2002 to 2006 he has been an Assistant Professor in the same university. Since more than a decade he is doing research in the field of formal methods for programming languages, in particular for program analysis and abstract interpretation. He has coauthored more than 30 publications on international journals and proceedings of international conferences, as well as many communications to international workshops and technical reports. He took part in several national and international research projects: ESPRIT Basic Research Action n. 6707 ('ParForce'); COFIN99 'Automatic Program Certification by Abstract Interpretation'; COFIN00 'Abstract Interpretation, type systems and control-flow analysis'; COFIN01 'Aggregate- and Number-Reasoning for Computing: from Decision Algorithms to Constraint Programming with Multisets, Sets, and Maps'; COFIN02 'Constraint-Based Verification of Reactive Systems'; COFIN04 'Abstract Interpretation: Design and Applications'; Integrated Action Italy-Spain IT229 'Advanced Development Environments for Logic Programs'. He collaborates to the design and development of software for the static analysis of programs: China (http://www.cs.unipr.it/China/), an innovative static analyser for constraint logic languages; the Parma Polyhedra Library (PPL, http://www.cs.unipr.it/ppl/), a modern, robust and efficient C++ library for the representation and manipulation of several numeric abstractions that are of interest in program analysis; PURRS (http://www.cs.unipr.it/purrs/), an interdisciplinary project for the automatic solution or approximation of recurrence relations; CLAIR (http://www.cs.unipr.it/clair/), a prototype analyzer for imperative languages.
Formal methods for the analysis and verification of programs
Abstract Interpretation: domains and abstract operators
Semantics of programming languages
(Constraint) Logic Programming
Mercoledì, alle ore 14:30, previo appuntamento via email.