An Automata-Theoretic Approach to Reasoning about Infinite-State Systems
No abstract available.
Related papers
- Weakly Acyclic Diagrams: A Data Structure for Infinite-State Symbolic Verification TACAS 2025
- A Generic Framework for Reasoning About Dynamic Networks of Infinite-State Processes TACAS 2007
- Reasoning About Data Trees Using CHCs CAV 2022
- StacKAT: Infinite State Network Verification PLDI 2025
- On Automation of CTL* Verification for Infinite-State Systems CAV 2015
- Efficient Loop Conditions for Bounded Model Checking Hyperproperties TACAS 2023
- Model Checking for Infinite State Systems Using Data Abstraction, Assumption-Commitment Style reasoning and Theorem Proving CAV 1995
- Abstract Symbolic Automata: Mixed syntactic/semantic similarity analysis of executables POPL 2015