Witnessing existential quantifiers with AE-VAL
Staff - Faculty of Informatics
Start date: 20 October 2016
End date: 21 October 2016
|
|||||||||||
|
|
|||||||||||
| Abstract: | |||||||||||
|
Various tasks in formal verification and synthesis rely on efficient techniques to remove existential quantifiers from formulas in First Order Logic. Additionally, modern quantifier elimination approaches are able to produce Skolem functions witnessing existential quantifiers. I present AE-VAL, a decision procedure for Linear Rational Arithmetic that enumerates models for quantified formulas and automatically constructs Skolem functions. In the talk, I demonstrate the use of AE-VAL for the tasks of "Realizability Checking and Synthesis of Contracts" and "Automatic Discovery of Simulation Relations". |
|||||||||||
|
|
|||||||||||
| Biography: | |||||||||||
|
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, 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 Software Model Checking, and Synthesis. |
|||||||||||
|
|
|||||||||||
|
|||||||||||
