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-11-01 to 2025-11-01.)
ArticleCitations
Sound Static Data Race Verification for C: Is the Race Lost?16
A Derivative-based Parser Generator for Visibly Pushdown Grammars16
Prophecy Made Simple15
Bounded Verification of Multi-threaded Programs via Lazy Sequentialization14
Omnisemantics: Smooth Handling of Nondeterminism13
Nested Session Types13
On Time-sensitive Control Dependencies12
Runtime Complexity Bounds Using Squeezers12
Rate-Based Session Types for IoT Systems11
Conditional Independence by Typing11
Synthesizing Invariants for Polynomial Programs by Semidefinite Programming10
A Layered Approach to Intensional Analysis in Type Theory10
A Type Discipline for Message Passing Parallel Programs10
An Extended Account of Trace-relating Compiler Correctness and Secure Compilation9
A Modular Approach to Metatheoretic Reasoning for Extensible Languages9
Deep Dive into ZGC: A Modern Garbage Collector in OpenJDK8
Universal Composability Is Robust Compilation8
Observational Equality Meets CIC7
Types for Complexity of Parallel Computation in Pi-calculus7
Outcome Logic: A Unified Approach to the Metatheory of Program Logics with Branching Effects6
Generic Bidirectional Typing for Dependent Type Theories6
(De/Re)-Composition of Data-Parallel Computations via Multi-Dimensional Homomorphisms6
Optimizing Homomorphic Evaluation Circuits by Program Synthesis and Time-bounded Exhaustive Search5
Strong-separation Logic5
Choral: Object-oriented Choreographic Programming5
What’s Decidable About Causally Consistent Shared Memory?5
Two Parametricities Versus Three Universal Types5
For a Few Dollars More: Verified Fine-Grained Algorithm Analysis Down to LLVM5
Contextual Linear Types for Differential Privacy5
LoRe: A Programming Model for Verifiably Safe Local-first Software4
Trocq: Proof Transfer for Free, Beyond Equivalence and Univalence4
Passport: Improving Automated Formal Verification Using Identifiers4
Prisma : A Tierless Language for Enforcing Contract-client Protocols in Decentralized Applications4
Polynomial Bounds of CFLOBDDs against BDDs4
Towards Porting Operating Systems with Program Synthesis3
The Systematic Design of Responsibility Analysis by Abstract Interpretation3
A Brookes-Style Denotational Semantics for Release/Acquire Concurrency3
Multiple Input Parsing and Lexical Analysis2
A Relational Program Logic with Data Abstraction and Dynamic Framing2
Locally Abstract, Globally Concrete Semantics of Concurrent Programming Languages2
Satisfiability Modulo Ordering Consistency Theory for SC, TSO, and PSO Memory Models2
A Model Checker for Operator Precedence Languages2
Gradual C0: Symbolic Execution for Gradual Verification2
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 Tortoise and the Hare Algorithm for Finite Lists, Compositionally2
Capturing Types2
Side-channel Elimination via Partial Control-flow Linearization2
SSProve: A Foundational Framework for Modular Cryptographic Proofs in Coq2
0.043133020401001