Automata-based Quantitative Verification
Suguman Bansal

TL;DR
This paper introduces a novel automata-theoretic framework called comparator automata that generalizes quantitative verification across various cost models, integrating structural and numerical analysis for improved scalability and efficiency.
Contribution
The paper presents comparator automata, a new automata-based framework that unifies structural and numerical phases in quantitative analysis, overcoming limitations of specialized and disparate techniques.
Findings
Generalizes across multiple cost models
Improves complexity-theoretic bounds
Enhances scalability and robustness
Abstract
Quantitative analysis of computing systems is an emerging area in automated formal analysis. Such properties address aspects such as costs and rewards, quality measures, resource consumption, distance metrics, etc. Existing solutions for problems in quantitative analysis face two challenges, namely lack of generalizability and separation-of-techniques. Lack of generalizability refers to the issue that solution approaches are specialized to cost model. Different cost models deploy such disparate algorithms that there is no transfer of knowledge from one cost model to another. Separation-of-techniques refers to the inherent dichotomy in solving problems in quantitative analysis. Most algorithms comprise of a structural phase which reasons about the structure of the quantitative system(s) using techniques from automata or graphs, and a numerical phase, which reasons about the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFormal Methods in Verification · Logic, programming, and type systems · Software Testing and Debugging Techniques
