🏠홈📊트렌드🏆논문👤마이
🎓
CS-Pedia
TrendsBest Papers
CS Conference Hub

Deadlines, Rankings
& Best Papers — all in one.

Acceptance rates · Best papers · Conference deadlines for CS researchers

← 학회 목록으로

OOPSLA

PL마감

ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications

📍 Oakland, CA, USA · 2026-10-03 ~ 2026-10-09

공식 웹사이트DBLP정보 오류 신고
키워드EfficientCompilerTestingSafetyFuzzing

기관 인정 현황?

BK21
4점
KIISE
최우수
KAIST
최우수
SNU
✓
POST
최우수

데드라인

2026 (first)
📍 Oakland, CA, USA
📝 Paper: 2025-10-10
📬 Notification: 2025-12-17
📅 학회: 2026-10-03 ~ 2026-10-09
2026 (second)
📍 Oakland, CA, USA
📝 Paper: 2026-03-17
📬 Notification: 2026-08-07
📅 학회: 2026-10-03 ~ 2026-10-09

데드라인은 변경될 수 있습니다. 제출 전 공식 웹사이트에서 최종 일정을 확인하세요.

Acceptance Rate?

채택률 데이터가 없습니다.

Research Trend?

Best Papers

🏆 2025Distinguished Paper Award
Automatic Linear Resource Bound Analysis for Rust via Prophecy Potentials
Lian & Wang
RustResource Analysis
🏆 2025Distinguished Paper Award
Incremental Bidirectional Typing via Order Maintenance
Porter, Kirisame, Wei, Panchekha & Omar
Type SystemsIncremental Computation
🏆 2024Distinguished Paper Award
Minotaur: A SIMD-Oriented Synthesizing Superoptimizer
Liu, Mada & Regehr
SIMDSuperoptimization
🏆 2024Distinguished Paper Award
VeriEQL: Bounded Equivalence Verification for Complex SQL Queries with Integrity Constraints
He, Zhao, Wang & Wang
SQL VerificationEquivalence Checking
🏆 2023Distinguished Paper Award
Algebro-Geometric Algorithms for Template-Based Synthesis of Polynomial Programs
Goharshady, Hitarth, Mohammadi & Motwani
Program SynthesisAlgebraic Geometry
🏆 2023Distinguished Paper Award
Grounded Copilot: How Programmers Interact with Code-Generating Models
Barke, James & Polikarpova
LLMCode Generation
🏆 2022Distinguished Paper Award
Complexity-Guided Container Replacement Synthesis
Wang, Yao, Tang, Shi & Zhang
Program SynthesisComplexity
🏆 2022Distinguished Paper Award
Finding Real Bugs in Big Programs with Incorrectness Logic
Le, Raad, Villard, Berdine, Dreyer & O'Hearn
Program AnalysisBug Detection
🏆 2021Distinguished Paper Award
Making Weak Memory Models Fair
Lahav, Namakonov, Oberhauser, Podkopaev & Vafeiadis
ConcurrencyMemory Models
🏆 2021Distinguished Paper Award
Study of the Subtyping Machine of Nominal Subtyping with Variance
Roth
Type TheorySubtyping

CS-Pedia — 한국 CS 연구자를 위한 학회 통합 플랫폼

데이터 출처: DBLP (CC0), OpenAlex (CC0), Semantic Scholar, aideadlin.es (MIT), 한국연구재단, 한국정보과학회, jeffhuang.com

제출 전 데드라인·학회 일정은 공식 웹사이트에서 반드시 확인하세요.

소개·개인정보 처리방침·이용약관·문의