Key papers

• Folding an e-graph in pure egglog (2026)
  Zeng Ren et al.
  5.01
• Trustworthy Runtime Verification via Bisimulation (Extended Experience Report) (2026)
  Ryan G. Scott et al.
  5.01
• Fixed-Set Robustness in Programming by Example: Example Corruption and Semantic Partition Recovery (2026)
  Yuan Si et al.
  4.39
• Cross-Dialect Generalization Without Retraining: Benchmarks and Evaluation of Schema-Derived Constrained Decoding for MLIR (2026)
  Plawan Kumar Rath
  4.39
• Oracular Programming: A Modular Foundation for Building LLM-Enabled Software (2025)
  Jonathan Laurent et al.
  3.59
• Weakly Non-Negative Supermartingales for Omega-Regular Verification (2026)
  Toru Takisaka et al.
  3.51
• Decode-Time Grammars: Constrained LLM Generation over a Refinement Order of Grammar Fragments (2026)
  Shuoming Zhang et al.
  3.51
• Extended Abstract: From Pattern Unification Towards Pattern Matching Unification (2026)
  David Richter et al.
  3.51
• Formal Verification of an Out-of-Order Multiprocessor against an In-Order Weak-Memory ISA (2026)
  Janggun Lee et al.
  3.51
• High-Level Synthesis of Efficient Pipelines with Visibility Control (2026)
  Jungin Rhee et al.
  3.51
• VirtualSet: Typed Ontology Worlds as an LLM Generation Target for Grounded Queries and Guarded Decisions (2026)
  Qunhui Zhang
  3.51
• Build-Authorized Evidence for Opaque Calls: A Fail-Closed Rewrite-Authority Boundary (2026)
  Zhonghua Yi (Toka Language Research Group)
  3.51
• Pie: A Programmable Serving System for Emerging LLM Applications (2025)
  In Gim et al.
  3.10
• Pearl: Automatic Code Optimization Using Deep Reinforcement Learning (2025)
  Djamel Rassem Lamouri et al.
  2.87
• Pydrofoil: accelerating Sail-based instruction set simulators (2025)
  Carl Friedrich Bolz-Tereick and Luke Panayi and Ferdia McKeogh and Tom Spink and Martin Berger
  2.71
• Nautilus: An Auto-Scheduling Tensor Compiler for Efficient Tiled GPU Kernels (2026)
  Yifan Zhao et al.
  1.83
• Debugging code world models (2026)
  Babak Rahmani
  1.72
• Misquoted No More: Securely Extracting F* Programs with IO (2026)
  Cezar-Constantin Andrici et al.
  1.72
• Prioritizing Configuration Relevance via Compiler-Based Refined Feature Ranking (2026)
  Federico Bruzzone et al.
  1.67
• ACT: Automatically Generating Compiler Backends from Tensor Accelerator ISA Descriptions (2025)
  Devansh Jain et al.
  1.50
• Synergy-Guided Compiler Auto-Tuning of Nested LLVM Pass Pipelines (2025)
  Haolin Pan et al.
  1.50
• A Hybrid, Knowledge-Guided Evolutionary Framework for Personalized Compiler Auto-Tuning (2025)
  Haolin Pan et al.
  1.50
• Comparative analysis of large data processing in Apache Spark using Java, Python and Scala (2025)
  Ivan Borodii et al.
  1.50
• Automated Code Repair for C/C++ Static Analysis Alerts (2025)
  David Svoboda et al.
  1.39
• The Secrets Must Not Flow: Scaling Security Verification to Large Codebases (extended version) (2025)
  Linard Arquint et al.
  1.33
• SoliDiffy: AST Differencing for Solidity Smart Contracts (2024)
  Mojtaba Eshghie et al.
  0.94
• MetaFFI -- Multilingual Indirect Interoperability System (2024)
  Tsvi Cherny-Shahar et al.
  0.78
• Denotation-based Compositional Compiler Verification (2024)
  Zhang Cheng et al.
  0.56
• Programming Not Only by Example (2017)
  Hila Peleg et al.
  0.00
• Polymorphic Type Inference for Machine Code (2016)
  Matthew Noonan et al.
  —
• Trace Typing: An Approach for Evaluating Retrofitted Type Systems (Extended Version) (2016)
  Esben Andreasen et al.
  —
• Prutor: A System for Tutoring CS1 and Collecting Student Programs for Analysis (2016)
  Rajdeep Das et al.
  —
• Data optimizations for constraint automata (2016)
  Sung-Shik T.Q. Jongmans (Open University of the Netherlands et al.
  —
• FEAST: An Automated Feature Selection Framework for Compilation Tasks (2016)
  Pai-Shun Ting et al.
  —
• Deep Probabilistic Programming (2017)
  Dustin Tran et al.
  —
• Transition Watchpoints: Teaching Old Debuggers New Tricks (2017)
  Kapil Arya (Northeastern University et al.
  —
• Stepwise Debugging of Answer-Set Programs (2017)
  Johannes Oetsch et al.
  —
• SPARK: Static Program Analysis Reasoning and Retrieving Knowledge (2017)
  Wasuwee Sodsong et al.
  —
• Active Learning of Points-To Specifications (2017)
  Osbert Bastani et al.
  —
• Neural Program Search: Solving Programming Tasks from Description and Examples (2018)
  Illia Polosukhin et al.
  —
• Technical Report about Tiramisu: a Three-Layered Abstraction for Hiding Hardware Complexity from DSL Compilers (2018)
  Riyadh Baghdadi et al.
  —
• Proceedings Third Workshop on Models for Formal Analysis of Real Systems and Sixth International Workshop on Verification and Program Transformation (2018)
  John P. Gallagher et al.
  —
• Lolisa: Formal syntax and semantics for a subset of the solidity programming language in Mathematical Tool Coq (2018)
  Zheng Yang et al.
  —
• An Executable Operational Semantics for Rust with the Formalization of Ownership and Borrowing (2018)
  Shuanglong Kan et al.
  —
• From high-level inference algorithms to efficient code (2018)
  Rajan Walia et al.
  —
• An Introduction to Probabilistic Programming (2018)
  Jan-Willem van de Meent et al.
  —
• Codestitcher: Inter-Procedural Basic Block Layout Optimization (2018)
  Rahman Lavaee et al.
  —
• Lightweight Interactive Proving inside an Automatic Program Verifier (2018)
  Sylvain Dailler (Inria et al.
  —
• CRAQL: A Composable Language for Querying Source Code (2019)
  Blake Johnson et al.
  —
• Neural Reverse Engineering of Stripped Binaries using Augmented Control Flow Graphs (2019)
  Yaniv David et al.
  —
• Dijkstra Monads for All (2019)
  Kenji Maillard et al.
  —
• Compiler-assisted Adaptive Program Scheduling in big.LITTLE Systems (2019)
  Marcelo Novaes et al.
  —
• Connecting Program Synthesis and Reachability: Automatic Program Repair using Test-Input Generation (2019)
  ThanhVu Nguyen and Westley Weimer and Deepak Kapur and Stephanie Forrest
  —
• Which of My Transient Type Checks Are Not (Almost) Free? (2019)
  Isaac Oscar Gariano et al.
  —
• Deep Generation of Coq Lemma Names Using Elaborated Terms (2020)
  Pengyu Nie et al.
  —
• Pika parsing: reformulating packrat parsing as a dynamic programming algorithm solves the left recursion and error recovery problems (2020)
  Luke A. D. Hutchison
  —
• Sham: A DSL for Fast DSLs (2020)
  Rajan Walia (Indiana University et al.
  —
• ReLoC Reloaded: A Mechanized Relational Logic for Fine-Grained Concurrency and Logical Atomicity (2020)
  Dan Frumin et al.
  —
• Symbolic Execution and Debugging Synchronization (2020)
  Andrea Fioraldi
  —
• Compiling a Higher-Order Smart Contract Language to LLVM (2020)
  Vaivaswatha Nagaraj et al.
  —