Verifying Infinitely Many Programs at Once
Abstract elided by the publisher.
Related papers
- Reducing liveness to safety in first-order logic POPL 2018
- Verifying Infinite State Processes with Sequential and Parallel Composition POPL 1995
- Indexed codata types ICFP 2016
- Verifying Systems with Infinite but Regular State Spaces CAV 1998
- Transitive Closures of Regular Relations for Verifying Infinite-State Systems TACAS 2000
- Verifying Safety Properties of a Class of Infinite-State Distributed Algorithms CAV 1995
- Verifying First-Order Temporal Properties of Infinite-State Systems via Timers and Rankings TACAS 2026
- Semantics of Sets of Programs OOPSLA 2025