scholar.google.com › citations
Jul 14, 2024 · In this paper, we provide a well-designed verified validation framework for affine scheduling in polyhedral compilation, fully mechanized in Coq ...
Jul 29, 2024 · It is parameterized over the concrete definitions and proofs of the instruction language to be reusable. As shown in our evaluation, the ...
Verified Validation for Affine Scheduling in Polyhedral Compilation
link.springer.com › content › pdf
Abstract. Structural nested loops can be abstracted into polyhedral models, based on which one can perform aggressive loop optimizations;.
The validator takes two polyhedral models (before and after auto-transformation like pluto's core algorithm), and output their equivalence (equal or unknown).
Bang, S., Nam, S., Chun, I., Jhoo, H.Y., Lee, J.: Smt-based translation validation for machine learning compiler. · Bernstein, A.J.: Analysis of programs for ...
[PDF] Verified Validation for Polyhedral Scheduling - Xuyang Li
blog.xu-yang.me › assets › pdf › P...
Human needs highly optimized compilation techniques for modern software. • Nested loops are optimization targets due to its heavy numerical computation.
Missing: Affine | Show results with:Affine
Aug 15, 2024 · To bridge this gap, this work provides a general verified validation framework based on Bernstein's conditions for affine scheduling, the core ...
Our generator accepts arbitrary affine scheduling functions. Non-unimodular scheduling functions such as i ↦→ 2i will produce correct but possibly ...
Verified Validation for Affine Scheduling in Polyhedral Compilation. X Li, H Liang, X Feng. International Symposium on Theoretical Aspects of Software ...
Verified Validation for Affine Scheduling in Polyhedral Compilation. Xuyang ... Towards Certified Separate Compilation for Concurrent Programs. Hanru ...