会议信息

PLDI 2027: ACM SIGPLAN conference on Programming Language Design and Implementation

请登录查看会议网址
免费注册：查看官网链接、跟踪截稿日期，并接收邮件提醒。
注册 登录
嵌入截止倒计时徽章
PLDI
用 API 获取这条数据
搜索与榜单列表完全无需凭证；本页的完整详情需要一把免费 API 密钥。详见开发者接入页。
截稿日期:
2026-11-12 还有 42 天
通知日期:
2027-03-04
会议日期:
2027-06-05
会议地点:
Atlanta, Georgia, USA
届数:
CCF: A   ICORE: A*   QUALIS: A1   浏览: 259087   关注: 75   参加: 2

会伴指数 (CP-I)

94.1 / 100
全站第 18 名 / 共 5,689 个会议 · 前 1%

软件工程 第 3 / 247

学术认可 (35%)
100
投稿选择性 (20%)
89
会议传承 (20%)
100
社区关注 (10%)
64
资料公开度 (15%)
100

用到的输入: 收录等级：CCF A, QUALIS A1 · 录用率：21.3%（有记录的 5 届的均值） · 有据可查的届次：48 · 在会伴关注它的研究者：75 人 · 过去 24 个月打开过本页的研究者：18 人

置信度 100% —— 分数中有多大比例来自实际观测到的数据，而不是中性基准。 这个分数是怎么算出来的 · 查看完整榜单 · 算法版本 1.1 · 算于 2026-10-01

征稿

PLDI 2027 (ACM SIGPLAN conference on Programming Language Design and Implementation) is a CCF A / ICORE A* / QUALIS A1 conference held in Atlanta, Georgia, USA on 2027-06-05. The paper submission deadline is 2026-11-12. Acceptance notifications are sent on 2027-03-04.

Welcome to the home page of the 48th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI 2027)! PLDI is the premier forum in the field of programming languages and programming systems research, covering the areas of design, implementation, theory, applications, and performance. PLDI 2027 will be held at the Hyatt Regency Atlanta in Atlanta, Georgia, USA, from June 5–11, 2027. PLDI 2027 is part of the Federated Computing Research Conference (FCRC), a week-long event that will bring together PLDI, ISCA, PADS, STOC, SPAA, SIGMETRICS, and other conferences and workshops.
由 Admin Agent 最后更新于

录用率

平均录用率: 21.2% 14 年间 (1995–2009).

年份提交数录用数录用率(%)
20091964120.9%
20081843418.5%
20071784525.3%
20061693621.3%
20051352820.7%
20031312821.4%
20021692816.6%
20011443020.8%
20001733017.3%
19991302620%
19981363122.8%
19971583119.6%
19961122825%
19951052826.7%

最佳论文

年份最佳论文
2026Towards Removing Undef Values From LLVM IR
2026Modular GPU Programming with Typed Perspectives
2026Categorical Semantics of Probabilistic Symbolic Execution
2026Verification of Recursively Defined Quantum Circuits
2026Synthesizing Backward Error Bounds, Backward
2026Bonsai: Compiling Queries to Pruned Tree Traversals
2026Enumerating Ill-Typed Programs for Testing Type Analyzers
2026MatchBox: A Semantic Foundation for Data Plane Portability
2026Cobble: Compiling Block Encodings for Quantum Computational Linear Algebra
2026VerusBelt: A Semantic Foundation for Verus's Proof-Oriented Extensions to the Rust Type System
2025AWDIT: An Optimal Weak Database Isolation Tester
2025Practical Type Inference with Levels
2025Verifying General-Purpose RCU for Reclamation in Relaxed Memory Separation Logic
2025Principal Type Inference under a Prefix: A Fresh Look at Static Overloading
2025Tree Borrows
2025Destabilizing Iris
2024V-Star: Learning Visibly Pushdown Grammars from Program Inputs
2024Verified Extraction from Coq to OCaml
2023Covering All the Bases: Type-Based Verification of Test Input Generators
2023An Automata-Based Framework for Verification and Bug Hunting in Quantum Circuits
2023Synthesizing MILP Constraints for Efficient and Robust Optimization
2023CryptOpt: Verified Compilation with Randomized Program Search for Cryptographic Primitives
2023Mosaic: An Interoperable Compiler for Tensor Algebra
2022Visualization Question Answering Using Introspective Program Synthesis
2022Synthesizing Analytical SQL Queries from Computation Demonstration
2022Finding Typing Compiler Bugs
2022Kleene Algebra Modulo Theories: A Framework for Concrete KATs
2022Low-Latency, High-Throughput Garbage Collection
2022RustHornBelt: A Semantic Foundation for Functional Verification of Rust Programs with Unsafe Code
2021Unleashing the Hidden Power of Compiler Optimization on Binary Code Difference: An Empirical Study
2021Alive2: Bounded Translation Validation for LLVM
2021High Performance Correctly Rounded Math Libraries for 32-bit Floating Point Representations
2021Specification Synthesis with Constrained Horn Clauses
2021RefinedC: Automating the Foundational Verification of C Code with Refined Ownership Types
2021Quantum Abstract Interpretation
2021Perceus: Garbage Free Reference Counting with Reuse
2021Cyclic Program Synthesis
2020Validating SMT solvers via semantic fusion
2020Armada: low-effort verification of high-performance concurrent programs
2020Data-driven inference of representation invariants
2020From folklore to fact: comparing implementations of stacks and continuations Authors: Kavon Farvardin, John Reppy
2020Fast graph simplification for interleaved Dyck-reachability
2020From folklore to fact: comparing implementations of stacks and continuations
2019Optimization and Abstraction: A Synergistic Approach for Analyzing Neural Network Robustness
2019Low-Latency Graph Streaming using Compressed Purely-Functional Trees
2019Continuously Reasoning about Programs using Differential Bayesian Inference
2019Towards Certified Separate Compilation for Concurrent Programs
2019An Inductive Synthesis Framework for Verifiable Reinforcement Learning
2019A Typed, Algebraic Approach to Parsing
2018A data-driven CHC solver
2018The semantics of transactions and weak memory in x86, Power, ARM, and C++
2018Program synthesis using conflict-driven learning
2017Bringing the web up to speed with WebAssembly
2017Repairing sequential consistency in C/C++11
2017Low Overhead Dynamic Binary Translation on ARM
2017Compiling without continuations
2016Types from data: Making structured data first-class citizens in F#
2016Transactional Data Structure Libraries
2016Into the Depths of C: Elaborating the De Facto Standards
2016Assessing the limits of program-specific garbage collection performance
2015Automatically Improving Accuracy for Floating Point Expressions
2015Diagnosing Type Errors with Class
2015Provably Correct Peephole Optimizations with Alive
2014Improving JavaScript Performance by Deconstructing the Type System
2014On Abstraction Refinement for Program Analyses in Datalog
2014Compiler validation via equivalence modulo inputs
2013Static Analysis for Probabilistic Programs: Inferring Whole Program Properties from Finitely Many Paths
2013CLAP: Recording Local Executions to Reproduce Concurrency Failures
2013Reconciling Exhaustive Pattern Matching with Objects
2013A General Constraint-centric Scheduling Framework for Spatial Architectures
2012Concurrent Data Representation Synthesis
2011Data Representation Synthesis
2010Safe to the last instruction: automated verification of a type-safe operating system
2009Binary analysis for measurement and attribution of program performance
2007The ant and the grasshopper: fast and accurate pointer analysis for millions of lines of code
2007Fault-tolerant typed assembly language
2005Programming by sketching for bit-streaming programs
2005Automatic pool allocation: improving performance by controlling data structure layout in the heap
2004Cloning-based context-sensitive pointer alias analysis using binary decision diagrams
2003Automatically proving the correctness of compiler optimizations
2000Dynamo: a transparent dynamic optimization system
1999Whole Program Paths

看过这个的人也在看

相关会议

相关期刊

评论 0

暂无评论。

请登录后发表评论