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 2020-11-01 to 2024-11-01.)
ArticleCitations
RustHorn: CHC-based Verification for Rust Programs30
Armed Cats16
What’s Decidable About Causally Consistent Shared Memory?14
Ranking and Repulsing Supermartingales for Reachability in Randomized Programs12
A Lightweight Formalism for Reference Lifetimes and Borrowing in Rust12
Compositional Programming11
Gradualizing the Calculus of Inductive Constructions10
Polymorphic Iterable Sequential Effect Systems10
Passport: Improving Automated Formal Verification Using Identifiers9
Deep Dive into ZGC: A Modern Garbage Collector in OpenJDK9
Bounded Verification of Multi-threaded Programs via Lazy Sequentialization8
TF-Coder: Program Synthesis for Tensor Manipulations7
Fast Graph Simplification for Interleaved-Dyck Reachability6
Securing Interruptible Enclaved Execution on Small Microprocessors6
An Extended Account of Trace-relating Compiler Correctness and Secure Compilation6
Semantic Correctness of Dependence-based Slicing for Interprocedural, Possibly Nonterminating Programs5
Conditional Independence by Typing5
CFLOBDDs: Context-Free-Language Ordered Binary Decision Diagrams5
On Polymorphic Sessions and Functions5
CSim 2 5
CHAD: Combinatory Homomorphic Automatic Differentiation5
Robustly Safe Compilation, an Efficient Form of Secure Compilation5
Capturing Types4
The Systematic Design of Responsibility Analysis by Abstract Interpretation4
Revisiting Iso-Recursive Subtyping4
A Fresh Look at Zones and Octagons4
TaDA Live: Compositional Reasoning for Termination of Fine-grained Concurrent Programs4
A Verified Optimizer for Quantum Circuits3
Side-channel Elimination via Partial Control-flow Linearization3
Active Learning for Inference and Regeneration of Applications that Access Databases3
SSProve: A Foundational Framework for Modular Cryptographic Proofs in Coq3
Safe-by-default Concurrency for Modern Programming Languages3
Typed–Untyped Interactions: A Comparative Analysis3
Choral: Object-oriented Choreographic Programming3
A Programming Language for Data Privacy with Accuracy Estimations3
A Type Discipline for Message Passing Parallel Programs2
Satisfiability Modulo Ordering Consistency Theory for SC, TSO, and PSO Memory Models2
Types for Complexity of Parallel Computation in Pi-calculus2
Decomposition-based Synthesis for Applying Divide-and-Conquer-like Algorithmic Paradigms2
Contextual Linear Types for Differential Privacy2
Nested Session Types2
A Model Checker for Operator Precedence Languages2
Chocola2
For a Few Dollars More: Verified Fine-Grained Algorithm Analysis Down to LLVM2
Omnisemantics: Smooth Handling of Nondeterminism2
Prophecy Made Simple2
A Relational Program Logic with Data Abstraction and Dynamic Framing2
0.023317813873291