Quantitative abstraction refinement

DOI10.1145/2429069.2429085MaRDI QIDQ2931788zbMATH OpenOpenAlexFDO

Authors Pavol Černý, Arjun Radhakrishna, 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

abstractionquantitative analysisrefinement

Mathematics Subject Classification ID

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

Recommendations

• A framework for verification of software with time and probabilities
• scientific article; zbMATH DE number 1670775
• Automatic Abstraction Refinement for Timed Automata
• scientific article; zbMATH DE number 2090706
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems

Cited in

(7)

• Faster algorithms for quantitative verification in bounded treewidth graphs
• An abstraction-refinement framework for trigger querying
• QUICr: A Reusable Library for Parametric Abstraction of Sets and Numbers
• Introduction to model checking
• A framework for verification of software with time and probabilities
• Replacing conjectures by positive knowledge: inferring proven precise worst-case execution time bounds using symbolic execution
• Approximate learning of limit-average automata

This page was built for publication: Quantitative abstraction refinement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2931788)