Quantitative Verification: From Model Checking to Model Measuring

Lead Research Organisation: University of Oxford
Department Name: Computer Science

Abstract

Enabling engineers, programmers, and researchers to automaticallyverify the correctness of the computer systems that they design is oneof the Grand Challenges of computing research. The scientific andeconomic importance of this goal has long been recognised, yet despitesubstantial progress in basic and applied research over the last fewdecades, much work remains ahead of us. The aim of this project is toaddress the issue of quantitative verification and analysis ofreal-time and probabilistic systems, from the development of novel andfundamental algorithms all the way to the design and implementation oftools.The software research outcomes will be evaluated in collaboration withmy industrial partners, which include Airbus UK, NASA JPL, andTraceTronic, an automotive engineering firm. We will apply theverification technology to case studies derived from actual products,which is an essential part of the validation process of this researchenterprise.Ultimately, the principles and software tools arising from thisresearch will enable software firm to enhance the quality of theirsafety-critical products, potentially averting loss of life and/ormajor financial disasters.

Publications

10 25 50
publication icon
Wachter B (2013) Verifying multi-threaded software with impact in 2013 Formal Methods in Computer-Aided Design, FMCAD 2013

publication icon
Bouyer P (2012) On termination and invariance for faulty channel machines in Formal Aspects of Computing

publication icon
Kiefer S (2012) Three tokens in Herman's algorithm in Formal Aspects of Computing

publication icon
Kiefer S (2012) Algorithmic probabilistic game semantics Playing games with automata in Formal Methods in System Design

publication icon
Akshay S (2015) Reachability problems for Markov chains in Information Processing Letters

publication icon
Jenkins M (2011) The church synthesis problem with metric in Leibniz International Proceedings in Informatics, LIPIcs

publication icon
Galby E (2015) On matrix powering in low dimensions in Leibniz International Proceedings in Informatics, LIPIcs

publication icon
Ouaknine J (2013) A Static Analysis Framework for Livelock Freedom in CSP in Logical Methods in Computer Science

publication icon
Kiefer S (2013) On the Complexity of Equivalence and Minimisation for Q-weighted Automata in Logical Methods in Computer Science

publication icon
Palikareva H (2012) SAT-solving in CSP trace refinement in Science of Computer Programming

 
Description We have developed a series algorithms for online monitoring, model checking, model measuring, and synthesis for quantitative systems, particularly real-time and probabilistic systems. In doing so, we have answered a series of open decidability and complexity questions.
Exploitation Route The algorithms should be implemented and investigated on real-world systems.
Sectors Aerospace, Defence and Marine,Digital/Communication/Information Technologies (including Software),Transport,Other