Space Efficient Reachability Analysis Through Use of Pseudo-Root States
No abstract available.
Related papers
- Reachability Analysis Using Message Passing over Tree Decompositions CAV 2020
- Introspective pushdown analysis of higher-order programs ICFP 2012
- Syntax-Driven Reachable State Space Construction of Synchronous Reactive Programs CAV 2005
- Harnessing Static Analysis to Help Learn Pseudo-Inverses of String Manipulating Procedures for Automatic Test Generation VMCAI 2020
- BRICK: Path Enumeration Based Bounded Reachability Checking of C Program (Competition Contribution) TACAS 2022
- On Bounding Time and Space for Multiprocessor Garbage Collection PLDI 1999
- Efficient Dynamic Error Reduction for Hybrid Systems Reachability Analysis TACAS 2018
- Analysis of recursive state machines TOPLAS 2005