Quantitative abstraction refinement

DOI10.1145/2429069.2429085zbMath1301.68244OpenAlexW2116888614MaRDI QIDQ2931788

Arjun Radhakrishna, Pavol Černý, Thomas A. Henzinger

Publication date: 27 November 2014

Published in: Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2429069.2429085

zbMATH Keywords

refinementabstractionquantitative analysis

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (4)

Introduction to Model Checking ⋮ Unnamed Item ⋮ Replacing conjectures by positive knowledge: inferring proven precise worst-case execution time bounds using symbolic execution ⋮ Faster algorithms for quantitative verification in bounded treewidth graphs

This page was built for publication: Quantitative abstraction refinement