Quantitative abstraction refinement
From MaRDI portal
Publication:2931788
DOI10.1145/2429069.2429085zbMath1301.68244MaRDI 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
68Q25: Analysis of algorithms and problem complexity
68W05: Nonnumerical algorithms
68Q60: Specification and verification (program logics, model checking, etc.)
68Q65: Abstract data types; algebraic specification
68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
Related Items
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, Introduction to Model Checking