[2608.20137] Formal Performance and Compile Time Guarantees for Compiler Optimization Heuristics

Skip to main content

Search arXiv

Press Enter to search · Advanced search

-->

Computer Science > Programming Languages

arXiv:2608.20137 (cs)

[Submitted on 20 Aug 2026]

Title:Formal Performance and Compile Time Guarantees for Compiler Optimization Heuristics

Authors:Nikil V. Shyamsunder<br>View a PDF of the paper titled Formal Performance and Compile Time Guarantees for Compiler Optimization Heuristics, by Nikil V. Shyamsunder

View PDF<br>HTML (experimental)

Abstract:Modern optimizing compilers rely on heuristic search algorithms for NP-hard optimization problems, which can result in poor generated-code performance and long or unpredictable compile times. These are considered bugs by users, but verified compilers rarely reason beyond semantic preservation. We propose verifying performance and compile time properties of compiler passes. As a proof-of-concept, we formulate inline expansion using a cost model estimating instruction-cache performance. We mechanize this in Rocq, prove semantic preservation of the inlining transformation, and verify the algorithm's monotone improvement, convergence-time bound, and performance bounds for intermediate and final solutions.

Comments:<br>To appear in Formal Methods in Computer-Aided Design 2026 (FMCAD '26) Student Forum. 3 pages

Subjects:

Programming Languages (cs.PL); Performance (cs.PF)

Cite as:<br>arXiv:2608.20137 [cs.PL]

(or<br>arXiv:2608.20137v1 [cs.PL] for this version)

https://doi.org/10.48550/arXiv.2608.20137

Focus to learn more

arXiv-issued DOI via DataCite (pending registration)

Submission history<br>From: Nikil Shyamsunder [view email]<br>[v1]<br>Thu, 20 Aug 2026 15:02:11 UTC (15 KB)

Full-text links:<br>Access Paper:

View a PDF of the paper titled Formal Performance and Compile Time Guarantees for Compiler Optimization Heuristics, by Nikil V. Shyamsunder<br>View PDF<br>HTML (experimental)<br>TeX Source

view license

Current browse context:

cs.PL

next >

new<br>recent<br>| 2026-08

Change to browse by:

cs<br>cs.PF

References & Citations

NASA ADS<br>Google Scholar

Semantic Scholar

export BibTeX citation<br>Loading...

BibTeX formatted citation

&times;

loading...

Data provided by:

Bookmark

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

Author

Venue

Institution

Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs .

Which authors of this paper are endorsers? |<br>Disable MathJax (What is MathJax?)

Major funding support from