The International Conference on Compiler Construction (CC) is interested in work on processing programs in the most general sense: analyzing, transforming or executing input that describes how a system operates, including traditional compiler construction as a special case.
CC is an ACM SIGPLAN conference, and implements guidelines and procedures recommended by SIGPLAN.
For more information, please consult the Call for Papers.
Sat 25 FebDisplayed time zone: Eastern Time (US & Canada) change
08:50 - 09:00 | |||
09:00 - 10:00 | |||
09:00 60mKeynote | Keynote: Automating Retargetable Compiler Construction with Hydride Research Papers |
10:20 - 11:20 | Vector & ParallelismResearch Papers at St. Laurent 3 Chair(s): Sebastian Hack Saarland University, Saarland Informatics Campus | ||
10:20 20mTalk | Java Vector API: Benchmarking and Performance Analysis Research Papers DOI | ||
10:40 20mTalk | Compiling Discrete Probabilistic Programs for Vectorized Exact Inference Research Papers DOI | ||
11:00 20mTalk | A Multi-threaded Fast Hardware Compiler for HDLs Research Papers Sheng-Hong Wang University of California, Hunter James Coffman University of California, Kenneth Mayer University of California, Sakshi Garg University of California, Jose Renau University of California DOI |
11:20 - 12:20 | |||
11:20 20mTalk | Efficiently Learning Locality Optimizations by Decomposing Transformation Domains Research Papers DOI | ||
11:40 20mTalk | A Deep Learning Model for Loop Interchange Research Papers Lina Mezdour NYU Abu Dhabi; ESI, Khadidja Kadem NYU Abu Dhabi; ESI, Massinissa Merouani NYU Abu Dhabi, Amina Selma Haichour ESI, Saman Amarasinghe Massachusetts Institute of Technology, Riyadh Baghdadi NYU Abu Dhabi DOI | ||
12:00 20mTalk | (De/Re)-Compositions Expressed Systematically via MDH-Based Schedules Research Papers Ari Rasch University of Muenster, Richard Schulze University of Muenster, Denys Shabalin Google, Anne Elster NTNU, Sergei Gorlatch University of Muenster, Mary Hall University of Utah DOI |
13:20 - 14:20 | |||
13:20 60mPanel | How will compilers change in the next 10 years? Research Papers P: Saman Amarasinghe Massachusetts Institute of Technology, P: Albert Cohen Google, P: Chen Ding University of Rochester, P: Sebastian Hack Saarland University, Saarland Informatics Campus, P: Mary Hall University of Utah |
14:20 - 15:20 | |||
14:20 20mTalk | A Sound and Complete Algorithm for Code Generation in Distance-Based ISA Research Papers Shu Sugita University of Tokyo, Toru Koizumi University of Tokyo, Ryota Shioya University of Tokyo, Hidetsugu Irie University of Tokyo, Shuichi Sakai University of Tokyo DOI | ||
14:40 20mTalk | Matching Linear Algebra and Tensor Code to Specialized Hardware Accelerators Research Papers Pablo Antonio Martínez University of Murcia, Jackson Woodruff University of Edinburgh, Jordi Armengol-Estapé University of Edinburgh, Gregorio Bernabé University of Murcia, José Manuel García University of Murcia, Michael F. P. O'Boyle University of Edinburgh DOI | ||
15:00 20mTalk | Torchy: A Tracing JIT Compiler for PyTorch Research Papers Nuno P. Lopes INESC-ID; Instituto Superior Técnico - University of Lisbon DOI |
15:40 - 16:40 | BackendResearch Papers at St. Laurent 3 Chair(s): Yufei Ding University of California at Santa Barbara | ||
15:40 20mTalk | A Symbolic Emulator for Shuffle Synthesis on the NVIDIA PTX Code Research Papers Kazuaki Matsumura Barcelona Supercomputing Center, Simon Garcia de Gonzalo Sandia National Laboratories, Antonio J. Peña Barcelona Supercomputing Center DOI | ||
16:00 20mTalk | Register Allocation for Compressed ISAs in LLVM Research Papers DOI | ||
16:20 20mTalk | RL4ReAl: Reinforcement Learning for Register Allocation Research Papers S. VenkataKeerthy IIT Hyderabad, Siddharth Jain IIT Hyderabad, Anilava Kundu IIT Hyderabad, Rohit Aggarwal IIT Hyderabad, Albert Cohen Google, Ramakrishna Upadrasta IIT Hyderabad DOI |
16:40 - 17:40 | Code Size & BugsResearch Papers at St. Laurent 3 Chair(s): Fernando Magno Quintão Pereira Federal University of Minas Gerais | ||
16:40 20mTalk | Automatically Localizing Dynamic Code Generation Bugs in JIT Compiler Back-End Research Papers DOI | ||
17:00 20mTalk | HyBF: A Hybrid Branch Fusion Strategy for Code Size Reduction Research Papers Rodrigo C. O. Rocha University of Edinburgh, Charitha Saumya Purdue University, Kirshanthan Sundararajah Purdue University, Pavlos Petoumenos University of Manchester, Milind Kulkarni Purdue University, Michael F. P. O'Boyle University of Edinburgh DOI | ||
17:20 20mTalk | Linker Code Size Optimization for Native Mobile Applications Research Papers Gai Liu ByteDance, Umar Farooq ByteDance, Chengyan Zhao ByteDance, Xia Liu ByteDance, Nian Sun ByteDance DOI |
Sun 26 FebDisplayed time zone: Eastern Time (US & Canada) change
08:30 - 09:00 | |||
08:30 30mMeeting | Business Meeting Research Papers |
09:00 - 10:00 | |||
09:00 60mTalk | Invited Talk: Quantum Computing Research Papers |
10:20 - 11:20 | Domain Specific LanguagesResearch Papers at St. Laurent 3 Chair(s): Martin Kong The Ohio State University | ||
10:20 20mTalk | Building a Compiled Query Engine in Python Research Papers DOI | ||
10:40 20mTalk | Codon: A Compiler for High-Performance Pythonic Applications and DSLs Research Papers Ariya Shajii Exaloop, Gabriel Ramirez Massachusetts Institute of Technology, Haris Smajlović University of Victoria, Jessica Ray Massachusetts Institute of Technology, Bonnie Berger Massachusetts Institute of Technology, Saman Amarasinghe Massachusetts Institute of Technology, Ibrahim Numanagić University of Victoria DOI | ||
11:00 20mTalk | MOD2IR: High-Performance Code Generation for a Biophysically Detailed Neuronal Simulation DSL Research Papers George Mitenkov Imperial College London, Ioannis Magkanaris EPFL, Omar Awile EPFL, Pramod Kumbhar EPFL, Felix Schürmann EPFL, Alastair F. Donaldson Imperial College London DOI |
11:20 - 12:20 | OptimizationsResearch Papers at St. Laurent 3 Chair(s): Louis-Noël Pouchet Colorado State University, USA | ||
11:20 20mTalk | A Hotspot-Driven Semi-automated Competitive Analysis Framework for Identifying Compiler Key Optimizations Research Papers Wenlong Mu East China Normal University, Yilei Zhang East China Normal University, Bo Huang East China Normal University, Jianmei Guo East China Normal University, Shiqiang Cui Hangzhou Hongjun Microelectronics Technology DOI | ||
11:40 20mTalk | LAGrad: Statically Optimized Differentiable Programming in MLIR Research Papers DOI | ||
12:00 20mTalk | Lazy Evaluation for the Lazy: Automatically Transforming Call-by-Value into Call-by-Need Research Papers Breno Campos Ferreira Guimarães Federal University of Minas Gerais, Fernando Magno Quintão Pereira Federal University of Minas Gerais DOI |
Accepted Papers
Call for Papers
Original contributions are solicited on the topics of interest which include, but are not limited to:
- Compilation and interpretation techniques, including program representation, analysis, and transformation; code generation, optimization, and synthesis; the verification thereof
- Run-time techniques, including memory management, virtual machines, and dynamic and just-in-time compilation
- Programming tools, including refactoring editors, checkers, verifiers, compilers, debuggers, and profilers
- Techniques, ranging from programming languages to micro-architectural support, for specific domains such as secure, parallel, distributed, embedded or mobile environments
- Design and implementation of novel language constructs, programming models, and domain-specific languages
- Implications to compiler construction from emerging or non-conventional applications (e.g., deep learning, quantum computing, DNA computing, etc.)
CC is an ACM SIGPLAN conference, and implements guidelines and procedures recommended by SIGPLAN. Prospective authors should be aware of ACM’s Copyright policies. Proceedings will be made available online in the ACM digital library from one week before to one week after the conference.
Submission Guidelines
Submission URL: https://cc23.hotcrp.com
All submissions must be made electronically through the conference submission website and include an abstract (100–400 words), author contact information, the full list of authors and their affiliations. Full paper submissions must be in PDF formatted printable on both A4 and US letter size paper.
All papers must be prepared in ACM Conference Format using the 2-column acmart format: use the options \documentclass[sigplan,10pt,review,anonymous]{acmart} for Latex, and interim-layout.docx for Word. Important note: The Word template (interim-layout.docx) on the ACM website uses 9pt font; you need to increase it to 10pt.
Papers should contain a maximum of 10 pages of text (in a typeface no smaller than 10 point) or figures, NOT INCLUDING references. There is no page limit for references and they must include the name of all authors (do not use et al.).
Appendices are not allowed, but the authors may submit anonymous supplementary material, such as proofs, source code, or data sets; all supplementary material must be in PDF or ZIP format. Looking at supplementary material is at the discretion of the reviewers.
Papers may be resubmitted to the submission site multiple times up until the deadline, but the last version submitted before the deadline will be the version reviewed. Papers that exceed the length requirement, that deviate from the expected format, or that are submitted late will be rejected.
CC follows ACM’s Copyright Policies. Prospective authors should adhere to SIGPLAN’s Republication Policy and to ACM’s Policy and Procedures on Plagiarism.
By submitting your article to an ACM Publication, you are hereby acknowledging that you and your co-authors are subject to all ACM Publications Policies, including ACM's new Publications Policy on Research Involving Human Participants and Subjects. Alleged violations of this policy or any ACM Publications Policy will be investigated by ACM and may result in a full retraction of your paper, in addition to other potential penalties, as per ACM Publications Policy.
Please ensure that you and your co-authors obtain an ORCID ID, so you can complete the publishing process for your accepted paper. ACM has been involved in ORCID from the start and we have recently made a commitment to collect ORCID IDs from all of our published authors. The collection process has started and will roll out as a requirement throughout 2022. We are committed to improve author discoverability, ensure proper attribution and contribute to ongoing community efforts around name normalization; your ORCID ID will help in these efforts.
Double-Blind Reviewing Process
CC uses a double-blind reviewing process. Authors will need to identify any potential conflicts of interest with PC, as defined in the SIGPLAN policy.
To facilitate the double-blind reviewing process, submissions (including supplementary material) should not reveal the identity of the authors in any way. Authors should leave out author names and affiliations from the body of their submission. They should also ensure that any references to authors’ own related work should be in the third person (e.g., not “We build on our previous work …” but rather “We build on the work of …”).
The purpose of this process is to help the PC and external reviewers come to an initial judgment about the paper without bias, not to make it impossible for them to discover the authors if they were to try. Nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing the paper more difficult. In particular, important background references should not be omitted or anonymized.
Artifact Evaluation
Authors are encouraged to submit their artifacts for the Artifact Evaluation (AE). The Artifact Evaluation process begins after the acceptance notification, and is run by a separate committee whose task is to assess how the artifacts support the work described in the papers.
To ease the organization of the AE committee, we kindly ask authors to indicate at the time they submit the paper, whether they are interested in submitting an artifact.
Papers that go through the Artifact Evaluation process successfully will receive a seal of approval printed on the papers themselves.
Authors of accepted papers are encouraged, but not required, to make these materials publicly available upon publication of the proceedings, by including them as “source materials” in the ACM Digital Library.
Additional information will be made available later.
Publication Date
The official publication date is the date the proceedings are made available in the ACM Digital Library. This date may be up to two weeks prior to the first day of your conference. The official publication date affects the deadline for any patent filings related to published work. For those rare conferences whose proceedings are published in the ACM Digital Library after the conference is over, the official publication date remains the first day of the conference.
Information to Authors
Authors of accepted submissions will be required to choose one of the following options:
- Author retains copyright of the work and grants ACM a non-exclusive permission-to-publish license (and, optionally, licenses the work with a Creative Commons license)
- Author retains copyright of the work and grants ACM an exclusive permission-to-publish license
- Author transfers copyright of the work to ACM
For more information, please refer to ACM’s Copyright Policy and the ACM Author Rights.
Authors with questions on this Call for Papers are encouraged to contact the Program Chairs by email.