A Generic Framework for Reasoning About Dynamic Networks of Infinite-State Processes
No abstract available.
DOI 10.1007/978-3-540-71209-1_54
Related papers
- Concurrent NetKAT - Modeling and analyzing stateful, concurrent networks ESOP 2022
- Reducing liveness to safety in first-order logic POPL 2018
- An Automata-Theoretic Approach to Reasoning about Infinite-State Systems CAV 2000
- An inductive synthesis framework for verifiable reinforcement learning PLDI 2019
- Probabilistic Bisimulation for Parameterized Systems - (with Applications to Verifying Anonymous Protocols) CAV 2019
- Compiling Discrete Probabilistic Programs for Vectorized Exact Inference CC 2023
- Weighted NetKAT: A Programming Language for Quantitative Network Verification PLDI 2026
- Quorum Tree Abstractions of Consensus Protocols ESOP 2023