Work

Faster Chaitin-like Register Allocation via Grammatical Decompositions of Control-Flow Graphs

Year: 2025

Type: conference-paper

Abstract: It is well-known that control-flow graphs (CFGs) of structured programs are sparse. This sparsity has been previously formalized in terms of graph parameters such as treewidth and pathwidth and used to design faster parameterized algorithms for numerous compiler optimization, model checking and program analysis tasks.

Source: ACM International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS)

DOI: 10.1145/3669940.3707286

Authors: Xuran Cai, Amir Kafshdar Goharshady, S. Hitarth, Chun Kit Lam

Institutions: Hong Kong University of Science and Technology, University of Oxford

Language: English

Topic: Logic, programming, and type systems

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

OpenAlex ID: W4407218672

FWCI: 1.982

Cites: 44

Cited by: 2

Related to: 10