ACM Transactions on Programming Languages and Systems

Papers
(The median citation count of ACM Transactions on Programming Languages and Systems is 2. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2021-12-01 to 2025-12-01.)
ArticleCitations
A Derivative-based Parser Generator for Visibly Pushdown Grammars17
Sound Static Data Race Verification for C: Is the Race Lost?16
Prophecy Made Simple15
Bounded Verification of Multi-threaded Programs via Lazy Sequentialization14
Omnisemantics: Smooth Handling of Nondeterminism13
Nested Session Types13
Runtime Complexity Bounds Using Squeezers12
On Time-sensitive Control Dependencies12
Conditional Independence by Typing11
Rate-Based Session Types for IoT Systems11
A Type Discipline for Message Passing Parallel Programs10
Synthesizing Invariants for Polynomial Programs by Semidefinite Programming10
A Modular Approach to Metatheoretic Reasoning for Extensible Languages9
A Layered Approach to Intensional Analysis in Type Theory9
Universal Composability Is Robust Compilation8
Deep Dive into ZGC: A Modern Garbage Collector in OpenJDK8
Types for Complexity of Parallel Computation in Pi-calculus7
Observational Equality Meets CIC6
(De/Re)-Composition of Data-Parallel Computations via Multi-Dimensional Homomorphisms6
Generic Bidirectional Typing for Dependent Type Theories6
Outcome Logic: A Unified Approach to the Metatheory of Program Logics with Branching Effects6
Two Parametricities Versus Three Universal Types5
Choral: Object-oriented Choreographic Programming5
Contextual Linear Types for Differential Privacy5
What’s Decidable About Causally Consistent Shared Memory?5
Strong-separation Logic5
For a Few Dollars More: Verified Fine-Grained Algorithm Analysis Down to LLVM5
Prisma : A Tierless Language for Enforcing Contract-client Protocols in Decentralized Applications4
Optimizing Homomorphic Evaluation Circuits by Program Synthesis and Time-bounded Exhaustive Search4
LoRe: A Programming Model for Verifiably Safe Local-first Software4
Trocq: Proof Transfer for Free, Beyond Equivalence and Univalence4
Polynomial Bounds of CFLOBDDs against BDDs4
Towards Porting Operating Systems with Program Synthesis3
Passport: Improving Automated Formal Verification Using Identifiers3
Monadic Intersection Types, Relationally and Ordered3
A Model Checker for Operator Precedence Languages2
SSProve: A Foundational Framework for Modular Cryptographic Proofs in Coq2
A Brookes-Style Denotational Semantics for Release/Acquire Concurrency2
CFLOBDDs: Context-Free-Language Ordered Binary Decision Diagrams2
Type-Safe Compilation of Dynamic Inheritance via Merging2
Introduction to the Special Issue on ESOP 20212
The Systematic Design of Responsibility Analysis by Abstract Interpretation2
Capturing Types2
A Relational Program Logic with Data Abstraction and Dynamic Framing2
Multiple Input Parsing and Lexical Analysis2
Side-channel Elimination via Partial Control-flow Linearization2
Locally Abstract, Globally Concrete Semantics of Concurrent Programming Languages2
Satisfiability Modulo Ordering Consistency Theory for SC, TSO, and PSO Memory Models2
0.04512095451355