Computing Reachable Control States of Systems Modeled with Uninterpreted Functions and Infinite Memory
Abstract elided by the publisher.
Related papers
- Verification under TSO with an infinite Data Domain TACAS 2024
- Automatic Synthesis of Piecewise Linear Quadratic Invariants for Programs VMCAI 2015
- Directed Reachability for Infinite-State Systems TACAS 2021
- Verification of Infinite-State Systems by Combining Abstraction and Reachability Analysis CAV 1999
- Quantitative Supermartingale Certificates CAV 2025
- Decidable Synthesis of Programs with Uninterpreted Functions CAV 2020
- RINO: Robust INner and Outer Approximated Reachability of Neural Networks Controlled Systems CAV 2022
- Modeling and Verifying Systems Using a Logic of Counter Arithmetic with Lambda Expressions and Uninterpreted Functions CAV 2002