ACM Transactions on Programming Languages and Systems

Papers
(The median citation count of ACM Transactions on Programming Languages and Systems is 1. 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-03-01 to 2024-03-01.)
ArticleCitations
A Principled Approach to Selective Context Sensitivity for Pointer Analysis24
RustHorn: CHC-based Verification for Rust Programs22
Armed Cats16
Debugging Large-scale Datalog13
Obsidian12
Compositional Programming10
What’s Decidable About Causally Consistent Shared Memory?8
Gradualizing the Calculus of Inductive Constructions8
Inferring Lower Runtime Bounds for Integer Programs8
A Lightweight Formalism for Reference Lifetimes and Borrowing in Rust7
Ranking and Repulsing Supermartingales for Reachability in Randomized Programs6
Deep Dive into ZGC: A Modern Garbage Collector in OpenJDK6
Polymorphic Iterable Sequential Effect Systems6
Semantic Correctness of Dependence-based Slicing for Interprocedural, Possibly Nonterminating Programs5
Bounded Verification of Multi-threaded Programs via Lazy Sequentialization5
CHAD: Combinatory Homomorphic Automatic Differentiation5
An Extended Account of Trace-relating Compiler Correctness and Secure Compilation5
CSim 2 5
Symbolic Disintegration with a Variety of Base Measures5
TF-Coder: Program Synthesis for Tensor Manipulations5
Passport: Improving Automated Formal Verification Using Identifiers4
A Theory of Slicing for Imperative Probabilistic Programs4
Robustly Safe Compilation, an Efficient Form of Secure Compilation4
Revisiting Iso-Recursive Subtyping4
TaDA Live: Compositional Reasoning for Termination of Fine-grained Concurrent Programs3
Conditional Independence by Typing3
On Polymorphic Sessions and Functions3
A Verified Optimizer for Quantum Circuits3
Type Inference for C3
A Fresh Look at Zones and Octagons3
Fast Graph Simplification for Interleaved-Dyck Reachability3
Safe-by-default Concurrency for Modern Programming Languages3
Securing Interruptible Enclaved Execution on Small Microprocessors3
The Systematic Design of Responsibility Analysis by Abstract Interpretation2
Active Learning for Inference and Regeneration of Applications that Access Databases2
A Type Discipline for Message Passing Parallel Programs2
Nested Session Types2
Prophecy Made Simple2
Side-channel Elimination via Partial Control-flow Linearization2
Types for Complexity of Parallel Computation in Pi-calculus2
A Relational Program Logic with Data Abstraction and Dynamic Framing2
Session Coalgebras: A Coalgebraic View on Regular and Context-free Session Types1
Capturing Types1
Choral: Object-oriented Choreographic Programming1
Multiple Input Parsing and Lexical Analysis1
Chocola1
Focusing on Refinement Typing1
Containerless Plurals: Separating Number from Type in Object-Oriented Programming1
Armada: Automated Verification of Concurrent Code with Sound Semantic Extensibility1
Immutability and Encapsulation for Sound OO Information Flow Control1
A Programming Language for Data Privacy with Accuracy Estimations1
Optimizing Homomorphic Evaluation Circuits by Program Synthesis and Time-bounded Exhaustive Search1
SSProve: A Foundational Framework for Modular Cryptographic Proofs in Coq1
For a Few Dollars More: Verified Fine-Grained Algorithm Analysis Down to LLVM1
Satisfiability Modulo Ordering Consistency Theory for SC, TSO, and PSO Memory Models1
Generalized Points-to Graphs1
An Effective Fusion and Tile Size Model for PolyMage1
Typed–Untyped Interactions: A Comparative Analysis1
0.018397092819214