Write a Blog >>
VMCAI 2017
Sun 15 - Tue 17 January 2017
co-located with POPL 2017
Sun 15 Jan 2017 16:00 - 16:30 at Amphitheater 44 - Decision procedures Chair(s): Andreas Podelski

2.5 player parity games combine the challenges posed by 2.5 player reachability games and the qualitative analysis of parity games. These two types of problems are best approached with different types of algorithms: strategy improvement algorithms for 2.5 player reachability games and recursive algorithms for the qualitative analysis of parity games. We present a method that—in contrast to existing techniques—tackles both aspects with the best suited approach and works exclusively on the 2.5 player game itself. The resulting technique is powerful enough to handle games with several million states.

slides (sven-vmcai.pdf)627KiB

Sun 15 Jan

VMCAI-2017-papers
16:00 - 17:30: VMCAI - Decision procedures at Amphitheater 44
Chair(s): Andreas PodelskiUniversity of Freiburg, Germany
VMCAI-2017-papers148449240000016:00 - 16:30
Talk
Ernst Moritz HahnState Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Sven ScheweUniversity of Liverpool, Andrea TurriniState Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Lijun ZhangInstitute of Software, Chinese Academy of Sciences
File Attached
VMCAI-2017-papers148449420000016:30 - 17:00
Talk
Andrew ReynoldsEPFL, Radu IosifVERIMAG, CNRS, Université Grenoble-Alpes, Cristina SerbanVERIMAG, CNRS, Université Grenoble-Alpes
File Attached
VMCAI-2017-papers148449600000017:00 - 17:30
Talk
Supratik ChakrabortyIIT Bombay, Ashutosh Gupta, Rahul JainTata Institute of Fundamental Research
File Attached