Sound and Precise Symbolic Automata Model for Stateful Software Systems
Open Access
- 24 July 2026
- book chapter
- Published by Springer Nature
- p. 73-99
Abstract
Verifying stateful software systems remains challenging due to complex control structures and intricate state interactions, often necessitating pre-existing behavioral models. We introduce , an abstract interpreter that automatically derives sound and precise symbolic finite automata models. In tests on real-world applications, generates sound and precise automata within minutes and, when employed in dynamic model checking, achieves 1.6 $$\times $$ –3.4 $$\times $$ code coverage compared to the state of the art. These findings demonstrate that can effectively connect code to model-based verification for stateful software systems.
Keywords
This publication has 57 references indexed in Scilit:
- Automated Verification of Monotonic Data Structure Traversals in C2025
- Fast Approximations of Quantifier Elimination2023
- Learning Deterministic Variable Automata over Infinite Alphabets2019
- The Learnability of Symbolic Automata2018
- A Generic Algorithm for Learning Symbolic Automata from Membership Queries2017
- Z3: An Efficient SMT Solver2008
- Guided Static AnalysisLecture Notes in Computer Science, 2007
- Trace Partitioning in Abstract Interpretation Based Static Analyzers2005
- The SLAM Toolkit2001
- Counterexample-Guided Abstraction Refinement2000