Output details
11 - Computer Science and Informatics
University of Birmingham
Assume-Guarantee Verification for Probabilistic Systems
<11>Paper at top verification conference TACAS (24% acceptance rate), short-listed for the 2010 EASST Best Paper award, and journal version now accepted to Information & Computation. Presents the first practical and fully-automated technique for compositional verification of systems with both probabilistic and nondeterministic behaviour, a problem well-known to be hard and with little prior progress. A novel assume-guarantee framework is proposed, implemented and successfully applied to several large case studies. Follow-up work (QEST'10, FASE’11, TACAS’11) expanded the framework and added automatic generation of assumptions through algorithmic learning. Led to an invited tutorial at the CONNECT summerschool.