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