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-08-01 to 2025-08-01.)
ArticleCitations
A Derivative-based Parser Generator for Visibly Pushdown Grammars44
Prophecy Made Simple16
Sound Static Data Race Verification for C: Is the Race Lost?15
Nested Session Types14
On Time-sensitive Control Dependencies12
Bounded Verification of Multi-threaded Programs via Lazy Sequentialization12
Runtime Complexity Bounds Using Squeezers12
Omnisemantics: Smooth Handling of Nondeterminism12
Conditional Independence by Typing11
A Type Discipline for Message Passing Parallel Programs10
Rate-Based Session Types for IoT Devices9
Synthesizing Invariants for Polynomial Programs by Semidefinite Programming9
An Extended Account of Trace-relating Compiler Correctness and Secure Compilation8
A Layered Approach to Intensional Analysis in Type Theory8
A Modular Approach to Metatheoretic Reasoning for Extensible Languages8
Universal Composability Is Robust Compilation7
Generic Bidirectional Typing for Dependent Type Theories7
Types for Complexity of Parallel Computation in Pi-calculus7
Deep Dive into ZGC: A Modern Garbage Collector in OpenJDK7
Observational Equality Meets CIC6
Safe-by-default Concurrency for Modern Programming Languages6
Strong-separation Logic5
Outcome Logic: A Unified Approach to the Metatheory of Program Logics with Branching Effects5
For a Few Dollars More: Verified Fine-Grained Algorithm Analysis Down to LLVM5
(De/Re)-Composition of Data-Parallel Computations via Multi-Dimensional Homomorphisms5
Choral: Object-oriented Choreographic Programming5
Contextual Linear Types for Differential Privacy4
What’s Decidable About Causally Consistent Shared Memory?4
Two Parametricities Versus Three Universal Types4
Optimizing Homomorphic Evaluation Circuits by Program Synthesis and Time-bounded Exhaustive Search4
Prisma : A Tierless Language for Enforcing Contract-client Protocols in Decentralized Applications3
LoRe: A Programming Model for Verifiably Safe Local-first Software3
The Systematic Design of Responsibility Analysis by Abstract Interpretation3
Passport: Improving Automated Formal Verification Using Identifiers3
Polynomial Bounds of CFLOBDDs against BDDs3
Trocq: Proof Transfer for Free, Beyond Equivalence and Univalence3
Towards Porting Operating Systems with Program Synthesis3
A Brookes-Style Denotational Semantics for Release/Acquire Concurrency3
CFLOBDDs: Context-Free-Language Ordered Binary Decision Diagrams2
Locally Abstract, Globally Concrete Semantics of Concurrent Programming Languages2
Introduction to the Special Issue on ESOP 20212
Gradual C0: Symbolic Execution for Gradual Verification2
Side-channel Elimination via Partial Control-flow Linearization2
A Relational Program Logic with Data Abstraction and Dynamic Framing2
A Model Checker for Operator Precedence Languages2
The Tortoise and the Hare Algorithm for Finite Lists, Compositionally2
SSProve: A Foundational Framework for Modular Cryptographic Proofs in Coq2
Satisfiability Modulo Ordering Consistency Theory for SC, TSO, and PSO Memory Models2
Capturing Types2
Multiple Input Parsing and Lexical Analysis2
0.042857885360718