Obtaining Memory-Efficient Reachability Graph Representations Using the Sweep-Line Method
Abstract elided by the publisher.
Related papers
- Automated Generation of a Progress Measure for the Sweep-Line Method TACAS 2004
- A Sweep-Line Method for State Space Exploration TACAS 2001
- Compiler Support to Customize the Mark and Sweep Algorithm ISMM 1998
- Efficient Register Allocation via Coloring Using Clique Separators TOPLAS 1994
- Mostly concurrent compaction for mark-sweep GC ISMM 2004
- Recursive State Machine Guided Graph Folding for Context-Free Language Reachability PLDI 2023
- Practical memory leak detection using guarded value-flow analysis PLDI 2007
- Connectivity graphs: a method for proving deadlock freedom based on separation logic POPL 2022