Loading…
CP 2016 has ended
Wednesday, September 7 • 08:45 - 09:45
Invited Talk: Horn Constraints for Software Verification and Synthesis
    See presentations
We will show how Horn constraints can be used to describe verification and synthesis problems, and how such constraints can be solved efficiently. In particular we will demonstrate how cardinality operators help to reason about quantitative properties and carry out counting-based correctness arguments, which are useful for the verification of information flow properties and parametrized systems.

Moderators
avatar for Pierre  Flener

Pierre Flener

Uppsala Universitet

Speakers
avatar for Andrey Rybalchenko

Andrey Rybalchenko

Senior Researcher, Microsoft Research
Andrey Rybalchenko is a senior researcher at Microsoft Research. He focuses on automated methods and tools for formal software and network verification. In the past, Andrey was a professor at Technische Universität München, a researcher at Max Planck Institute for Software Systems... Read More →


Wednesday September 7, 2016 08:45 - 09:45
Grand Amphi Lascrosses building

Attendees (18)