Seminars at the Faculty of Informatics

Speaker: Grigory Fedyukovich
á University of Washington, USA
Date: Wednesday, May 11, 2016
Place: USI Lugano Campus, room SI-013, Informatics building (Via G. Buffi 13)
Time: 13:30



In this talk, I present a novel approach for automated incremental verification that employs both reusable and relational specifications of software to incrementally verify pairs of programs with possibly nested loops. It analyzes two programs, P - the one already verified, and Q - the one needed to be verified, and proceeds by detecting an abstraction ▒P of P and a simulation ┴, such that ▒P simulates Q via ┴. The key idea behind our simulation synthesis is to drive construction of both ▒P and ┴ by the safe inductive invariants of P, thus guaranteeing the property preservations by the results. Finally, our approach allows effective lifting of the safe inductive invariants of P to Q using only ▒P and ┴. Based on our evaluation, in many cases when the absolute equivalence between programs cannot be proven, our approach is able to establish the property directed equivalence, confirming that the program Q is safe.



Grigory Fedyukovich is a postdoc at PLSE lab of University of Washington, USA, working with Prof. Rastislav Bodik. He completed the PhD at Formal Verification Lab of Universita della Svizzera Italiana (USI), Lugano, Switzerland (2015), under supervision of Prof. Natasha Sharygina. He graduated from Saint Petersburg State University, Russia (2008), and also did two internships at Institute of Cybernetics, Estonia (2009); and at National University of Singapore (2010).

The main focus of his research is Interpolation-based Incremental Model Checking, and Inductive Simulation Synthesis for establishing Program Equivalence.


Host: Prof. Natasha Sharygina