RelSC is a new graph regression benchmark from program graphs with execution time labels, released in homogeneous (RelSC-H) and multi-relational (RelSC-M) variants to study representation effects.
Automatically deriving control-flow graph generators from operational semantics.Proceedings of the ACM on Programming Languages, 6(ICFP):742–771
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Benchmark Dataset for Graph Regression with Homogeneous and Multi-Relational Variants
RelSC is a new graph regression benchmark from program graphs with execution time labels, released in homogeneous (RelSC-H) and multi-relational (RelSC-M) variants to study representation effects.