Published August 20, 2025
| Version v2
Software
Open
Artifact of "Fast Client-Driven CFL-Reachability via Regularization-Based Graph Simplification"
Authors/Creators
- 1. SKLP, Institute of Computing Technology, CAS, China
- 2. University of Chinese Academy of Sciences, China
- 3. Chongqing University, China
- 4. Zhongguancun Laboratory, China
-
5.
UNSW Sydney
Description
This artifact accompanies the paper “Fast Client-Driven CFL-Reachability via Regularization-Based Graph Simplification”, accepted to OOPSLA’25. Please refer to the accompanying documentation for instructions on reproducing our experiments using the provided Docker image.
Files
readme.pdf
Files
(520.9 MB)
| Name | Size | Download all |
|---|---|---|
|
md5:1ebbd3e34237af26da5dc08a4e440464
|
35.1 kB | Download |
|
md5:1c7ae048e6512cbb87476d02c576cdcb
|
519.9 MB | Download |
|
md5:37953bcc087d98b15dcc7b8e70cb460d
|
1.0 MB | Preview Download |