UTFacultiesEEMCSDisciplines & departmentsFormal Methods and ToolsGroup colloquiumOn Correctness, Precision, and Performance in Quantitative Verification

On Correctness, Precision, and Performance in Quantitative Verification by Arnd Hartmanns, Assistant Professor (University of Twente)

Quantitative verification tools compute probabilities, expected rewards, or steady-state values for formal models of stochastic and timed systems. Exact results often cannot be obtained efficiently, so most tools use floating-point arithmetic in iterative algorithms that approximate the quantity of interest. Correctness is thus defined by the desired precision and determines performance. In this talk, I will report on the experimental evaluation of these trade-offs performed in QComp 2020: the second friendly competition of tools for the analysis of quantitative formal models. I will survey the precision guarantees—ranging from exact rational results to statistical confidence statements—offered by the nine participating tools. They gave rise to a performance evaluation using five tracks with varying correctness criteria, of which I will present the results.