TOPLAS（CCF A）（共 197 篇）
202619 篇 · 48(1)
Navigating Mixed-Typed Migration with Profilers
TOPLAS 48(1)2026
Scaling Inter-procedural Dataflow Analysis on the Cloud
TOPLAS 48(1)2026
An Axiomatic Basis for Computer Programming on Relaxed Hardware Architectures: The AxSL Logics
TOPLAS 48(1)2026
A Sound Type System for Secure Currency Flow
TOPLAS 48(1)2026
Denotation-based Compositional Compiler Verification
TOPLAS 48(1)2026
Fair Termination of Asynchronous Binary Sessions
TOPLAS 48(2)2026
Guiding LLM-Based Loop Invariant Synthesis via Feedback on Local Reasoning Errors
TOPLAS 48(2)2026
StreamAlloc: A Framework for Analyzing and Transforming CUDA Code to Enable Asynchronous Execution
TOPLAS 48(2)2026
Project Everest: Perspectives from Developing Industrial-Grade High-Assurance Software
TOPLAS 48(2)2026
A Typed Intermediate Representation for Dynamic Languages
TOPLAS 48(2)2026
<i>Vy</i>
ZX: Formal Verification of a Graphical Quantum Language
TOPLAS 48(3)2026
The Linear Session Abstract Machine
TOPLAS 48(3)2026
<scp>Coma</scp>
, an Intermediate Verification Language with Explicit Abstraction Barriers
TOPLAS 48(3)2026
A Formal Framework for Typing and Cast Semantics in SQL Engines
TOPLAS ACM Transactions on Programming Languages and Systems2026
Cut-Shortcut Whole-Program Pointer Analysis: Re-Imagining Context-Sensitivity without Contexts
TOPLAS 48(3)2026
Constructive characterisations of the
<scp>must</scp>
-preorder for asynchrony
TOPLAS ACM Transactions on Programming Languages and Systems2026
Compositional Shape Analysis with Shared Abduction and Biabductive Loop Acceleration
TOPLAS ACM Transactions on Programming Languages and Systems2026
Compiling with the Sequent Calculus
TOPLAS ACM Transactions on Programming Languages and Systems2026
Formal Autograding in a Classroom (Extended Version)
TOPLAS 48(3)2026
202520 篇 · ACM Transactions on Programming Languages and Systems
Modal Crash Types for WAR-Aware Intermittent Computing
TOPLAS ACM Transactions on Programming Languages and Systems2025
Synthesizing Invariants for Polynomial Programs by Semidefinite Programming
TOPLAS 47(1)2025
Generic Bidirectional Typing for Dependent Type Theories
TOPLAS 47(1)2025
Will It Fit? Verifying Heap Space Bounds of Concurrent Programs under Garbage Collection
TOPLAS 47(1)2025
Polynomial Bounds of CFLOBDDs against BDDs
TOPLAS 47(2)2025
Observational Equality Meets CIC
TOPLAS 47(2)2025
A Brookes-Style Denotational Semantics for Release/Acquire Concurrency
TOPLAS 47(2)2025
Scoped Effects, Scoped Operations, and Parameterized Algebraic Theories
TOPLAS 47(2)2025
Circuit Width Estimation via Effect Typing and Linear Dependency
TOPLAS 47(3)2025
Trocq: Proof Transfer for Free, Beyond Equivalence and Univalence
TOPLAS 47(3)2025
Sound Static Data Race Verification for C: Is the Race Lost?
TOPLAS 47(3)2025
A Modular Approach to Metatheoretic Reasoning for Extensible Languages
TOPLAS 47(3)2025
Rate-Based Session Types for IoT Systems
TOPLAS 47(3)2025
Outcome Logic: A Unified Approach to the Metatheory of Program Logics with Branching Effects
TOPLAS 47(3)2025
Changing of the Seasons at TOPLAS
TOPLAS 47(3)2025
Monadic Intersection Types, Relationally, and Ordered
TOPLAS 47(4)2025
Type-Safe Compilation of Dynamic Inheritance via Merging
TOPLAS 47(4)2025
Editorial: Embracing the Empirical with the New PL Experiments Track
TOPLAS 47(4)2025
Editorial: New Year, New Paper Tracks
TOPLAS 47(4)2025
Squibs and Discussions at TOPLAS
TOPLAS 47(4)2025
202415 篇 · 46(1)
LoRe: A Programming Model for Verifiably Safe Local-first Software
TOPLAS 46(1)2024
Choral: Object-oriented Choreographic Programming
TOPLAS 46(1)2024
Locally Abstract, Globally Concrete Semantics of Concurrent Programming Languages
TOPLAS 46(1)2024
Interactive Abstract Interpretation with Demanded Summarization
TOPLAS 46(1)2024
Adversities in Abstract Interpretation - Accommodating Robustness by Abstract Interpretation
TOPLAS 46(2)2024
Homeostasis: Design and Implementation of a Self-Stabilizing Compiler
TOPLAS 46(2)2024
CFLOBDDs: Context-Free-Language Ordered Binary Decision Diagrams
TOPLAS 46(2)2024
Decomposition-based Synthesis for Applying Divide-and-Conquer-like Algorithmic Paradigms
TOPLAS 46(2)2024
Proving Correctness of Parallel Implementations of Transition System Models
TOPLAS 46(3)2024
Limits and Difficulties in the Design of Under-Approximation Abstract Domains
TOPLAS 46(3)2024
(De/Re)-Composition of Data-Parallel Computations via Multi-Dimensional Homomorphisms
TOPLAS 46(3)2024
<i>TeraHeap</i>
: Exploiting Flash Storage for Mitigating DRAM Pressure in Managed Big Data Frameworks
TOPLAS 46(4)2024
Gradual C0: Symbolic Execution for Gradual Verification
TOPLAS 46(4)2024
A Layered Approach to Intensional Analysis in Type Theory
TOPLAS 46(4)2024
Universal Composability Is Robust Compilation
TOPLAS 46(4)2024
202321 篇 · 45(1)
The Tortoise and the Hare Algorithm for Finite Lists, Compositionally
TOPLAS 45(1)2023
Immutability and Encapsulation for Sound OO Information Flow Control
TOPLAS 45(1)2023
Towards Porting Operating Systems with Program Synthesis
TOPLAS 45(1)2023
Satisfiability Modulo Ordering Consistency Theory for SC, TSO, and PSO Memory Models
TOPLAS 45(1)2023
Typed–Untyped Interactions: A Comparative Analysis
TOPLAS 45(1)2023
Omnisemantics: Smooth Handling of Nondeterminism
TOPLAS 45(1)2023
A Derivative-based Parser Generator for Visibly Pushdown Grammars
TOPLAS 45(2)2023
A First-order Logic with Frames
TOPLAS 45(2)2023
Contextual Linear Types for Differential Privacy
TOPLAS 45(2)2023
Synchronous Deterministic Parallel Programming for Multi-Cores with ForeC
TOPLAS 45(2)2023
Side-channel Elimination via Partial Control-flow Linearization
TOPLAS 45(2)2023
Optimization-Aware Compiler-Level Event Profiling
TOPLAS 45(2)2023
Passport: Improving Automated Formal Verification Using Identifiers
TOPLAS 45(2)2023
Multiple Input Parsing and Lexical Analysis
TOPLAS 45(3)2023
SSProve: A Foundational Framework for Modular Cryptographic Proofs in Coq
TOPLAS 45(3)2023
Optimizing Homomorphic Evaluation Circuits by Program Synthesis and Time-bounded Exhaustive Search
TOPLAS 45(3)2023
A Model Checker for Operator Precedence Languages
TOPLAS 45(3)2023
Prisma : A Tierless Language for Enforcing Contract-client Protocols in Decentralized Applications
TOPLAS 45(3)2023
Capturing Types
TOPLAS 45(4)2023
Exploiting Partially Context-sensitive Profiles to Improve Performance of Hot Code
TOPLAS 45(4)2023
Focusing on Refinement Typing
TOPLAS 45(4)2023
202222 篇 · 44(1)
Bounded Abstract Effects
TOPLAS 44(1)2022
What’s Decidable About Causally Consistent Shared Memory?
TOPLAS 44(2)2022
Gradualizing the Calculus of Inductive Constructions
TOPLAS 44(2)2022
Prophecy Made Simple
TOPLAS 44(2)2022
Fast Graph Simplification for Interleaved-Dyck Reachability
TOPLAS 44(2)2022
TF-Coder: Program Synthesis for Tensor Manipulations
TOPLAS 44(2)2022
Armada: Automated Verification of Concurrent Code with Sound Semantic Extensibility
TOPLAS 44(2)2022
Solving Program Sketches with Large Integer Values
TOPLAS 44(2)2022
Types for Complexity of Parallel Computation in Pi-calculus
TOPLAS 44(3)2022
Nested Session Types
TOPLAS 44(3)2022
Strong-separation Logic
TOPLAS 44(3)2022
Runtime Complexity Bounds Using Squeezers
TOPLAS 44(3)2022
For a Few Dollars More: Verified Fine-Grained Algorithm Analysis Down to LLVM
TOPLAS 44(3)2022
Session Coalgebras: A Coalgebraic View on Regular and Context-free Session Types
TOPLAS 44(3)2022
Introduction to the Special Issue on ESOP 2021
TOPLAS 44(3)2022
CHAD: Combinatory Homomorphic Automatic Differentiation
TOPLAS 44(3)2022
Revisiting Iso-Recursive Subtyping
TOPLAS 44(4)2022
Two Parametricities Versus Three Universal Types
TOPLAS 44(4)2022
Deep Dive into ZGC: A Modern Garbage Collector in OpenJDK
TOPLAS 44(4)2022
Containerless Plurals: Separating Number from Type in Object-Oriented Programming
TOPLAS 44(4)2022
A Type Discipline for Message Passing Parallel Programs
TOPLAS 44(4)2022
A Relational Program Logic with Data Abstraction and Dynamic Framing
TOPLAS 44(4)2022
202121 篇 · 43(1)
Robustly Safe Compilation, an Efficient Form of Secure Compilation
TOPLAS 43(1)2021
<b>CSim</b>
<sup>
<i>2</i>
</sup>
TOPLAS 43(1)2021
Polymorphic Iterable Sequential Effect Systems
TOPLAS 43(1)2021
A Lightweight Formalism for Reference Lifetimes and Borrowing in Rust
TOPLAS 43(1)2021
Ranking and Repulsing Supermartingales for Reachability in Randomized Programs
TOPLAS 43(2)2021
A Programming Language for Data Privacy with Accuracy Estimations
TOPLAS 43(2)2021
On Polymorphic Sessions and Functions
TOPLAS 43(2)2021
Armed Cats
TOPLAS 43(2)2021
Securing Interruptible Enclaved Execution on Small Microprocessors
TOPLAS 43(3)2021
A Fresh Look at Zones and Octagons
TOPLAS 43(3)2021
Compositional Programming
TOPLAS 43(3)2021
Safe-by-default Concurrency for Modern Programming Languages
TOPLAS 43(3)2021
Completeness and Complexity of Reasoning about Call-by-Value in Hoare Logic
TOPLAS 43(4)2021
RustHorn: CHC-based Verification for Rust Programs
TOPLAS 43(4)2021
TaDA Live: Compositional Reasoning for Termination of Fine-grained Concurrent Programs
TOPLAS 43(4)2021
An Extended Account of Trace-relating Compiler Correctness and Secure Compilation
TOPLAS 43(4)2021
Introduction to the Special Section on ESOP 2020
TOPLAS 43(4)2021
On Time-sensitive Control Dependencies
TOPLAS 44(1)2021
Conditional Independence by Typing
TOPLAS 44(1)2021
The Systematic Design of Responsibility Analysis by Abstract Interpretation
TOPLAS 44(1)2021
Bounded Verification of Multi-threaded Programs via Lazy Sequentialization
TOPLAS 44(1)2021
202014 篇 · 42(2)
A Principled Approach to Selective Context Sensitivity for Pointer Analysis
TOPLAS 42(2)2020引用 65
Obsidian
TOPLAS 42(3)2020引用 55
Debugging Large-scale Datalog
TOPLAS 42(2)2020引用 17
Symbolic Disintegration with a Variety of Base Measures
TOPLAS 42(2)2020引用 15
Inferring Lower Runtime Bounds for Integer Programs
TOPLAS 42(3)2020引用 13
Type Inference for C
TOPLAS 42(3)2020引用 8
Generalized Points-to Graphs
TOPLAS 42(2)2020引用 7
Active Learning for Inference and Regeneration of Applications that Access Databases
TOPLAS 42(4)2020引用 7
A Theory of Slicing for Imperative Probabilistic Programs
TOPLAS 42(2)2020引用 6
An Effective Fusion and Tile Size Model for PolyMage
TOPLAS 42(3)2020引用 5
Semantic Correctness of Dependence-based Slicing for Interprocedural, Possibly Nonterminating Programs
TOPLAS 42(4)2020引用 5
Chocola
TOPLAS 42(4)2020引用 2
Interprocedural Context-Unbounded Program Analysis Using Observation Sequences
TOPLAS 42(4)2020引用 1
Corrigendum to “Type-driven Gradual Security with References,” by Toro et al., ACM Transactions on Programming Languages and Systems (TOPLAS) Volume 40, Issue 4, Article No. 16
TOPLAS 42(2)2020
201925 篇 · 41(1)
Optimal Choice of When to Garbage Collect
TOPLAS 41(1)2019
Practical Subtyping for Curry-Style Languages
TOPLAS 41(1)2019
Rethinking Incremental and Parallel Pointer Analysis
TOPLAS 41(1)2019
Context-Free Session Type Inference
TOPLAS 41(2)2019
A Classical Sequent Calculus with Dependent Types
TOPLAS 41(2)2019
Probabilistic Termination by Monadic Affine Sized Typing
TOPLAS 41(2)2019
ML, Visibly Pushdown Class Memory Automata, and Extended Branching Vector Addition Systems with States
TOPLAS 41(2)2019
Editorial
TOPLAS 41(2)2019
CSS Minification via Constraint Solving
TOPLAS 41(2)2019
A Machine-Learning Algorithm with Disjunctive Model for Data-Driven Program Analysis
TOPLAS 41(2)2019
Higher-order Demand-driven Program Analysis
TOPLAS 41(3)2019
Static Identification of Injection Attacks in Java
TOPLAS 41(3)2019
PYE
TOPLAS 41(3)2019
Failure Recovery in Resilient X10
TOPLAS 41(3)2019
Combinatorial Register Allocation and Instruction Scheduling
TOPLAS 41(3)2019
Analysis and Optimization of Task Granularity on the Java Virtual Machine
TOPLAS 41(3)2019
Non-polynomial Worst-Case Analysis of Recursive Programs
TOPLAS 41(4)2019
Environmental Bisimulations for Probabilistic Higher-order Languages
TOPLAS 41(4)2019
On the Impact of Programming Languages on Code Quality
TOPLAS 41(4)2019
Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth
TOPLAS 41(4)2019
Behavioural Equivalence via Modalities for Algebraic Effects
TOPLAS 42(1)2019
Modular Product Programs
TOPLAS 42(1)2019
Consistent Subtyping for All
TOPLAS 42(1)2019
Reasoning about a Machine with Local Capabilities
TOPLAS 42(1)2019
Introduction to the Special Issue on ESOP 2018
TOPLAS 42(1)2019
201820 篇 · 40(1)
Constraint-Based Refactoring
TOPLAS 40(1)2018
Conditioning in Probabilistic Programming
TOPLAS 40(1)2018
A Logical Analysis of Framing for Specifications with Pure Method Calls
TOPLAS 40(2)2018
Cross-Language Interoperability in a Multi-Language Runtime
TOPLAS 40(2)2018
Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs
TOPLAS 40(2)2018
Program Synthesis for Program Analysis
TOPLAS 40(2)2018
POP-PL
TOPLAS 40(3)2018
Modular Termination Verification of Single-Threaded and Multithreaded Programs
TOPLAS 40(3)2018
Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components
TOPLAS 40(3)2018
A Theoretical Foundation of Sensitivity in an Abstract Interpretation Framework
TOPLAS 40(3)2018
Editor's Foreword to “Static Backward Slicing of Non-Deterministic Programs and Systems”
TOPLAS 40(3)2018
Static Backward Slicing of Non-deterministic Programs and Systems
TOPLAS 40(3)2018
Adaptive Static Analysis via Learning with Bayesian Optimization
TOPLAS 40(4)2018
Corrigendum to “Cross-Language Interoperability in a Multi-Language Runtime”, by Grimmer et al., ACM Transactions on Programming Languages and Systems (TOPLAS) Volume 40, Issue 2, Article No. 8
TOPLAS 40(4)2018
Transactional Sapphire
TOPLAS 40(4)2018
Rigorous Estimation of Floating-Point Round-Off Errors with Symbolic Taylor Expansions
TOPLAS 41(1)2018
Dynamic Deadlock Verification for General Barrier Synchronisation
TOPLAS 41(1)2018
Interconnectability of Session-Based Logical Processes
TOPLAS 40(4)2018
Type-Driven Gradual Security with References
TOPLAS 40(4)2018
Feature-Specific Profiling
TOPLAS 41(1)2018
201720 篇 · 39(2)
Towards a Compiler for Reals
TOPLAS 39(2)2017引用 104
Don’t Sit on the Fence
TOPLAS 39(2)2017引用 91
Precise Predictive Analysis for Discovering Communication Deadlocks in MPI Programs
TOPLAS 39(4)2017引用 68
From Clarity to Efficiency for Distributed Algorithms
TOPLAS 39(3)2017引用 53
Sound Non-Statistical Clustering of Static Analysis Alarms
TOPLAS 39(4)2017引用 51
On Subtyping-Relation Completeness, with an Application to Iso-Recursive Types
TOPLAS 39(1)2017引用 25
Multiple Facets for Dynamic Information Flow with Exceptions
TOPLAS 39(3)2017引用 25
Polymorphic Manifest Contracts, Revised and Resolved
TOPLAS 39(1)2017引用 20
Bit-Precise Procedure-Modular Termination Analysis
TOPLAS 40(1)2017引用 19
SPL
TOPLAS 39(1)2017引用 17
Verifying Invariants of Lock-Free Data Structures with Rely-Guarantee and Refinement Types
TOPLAS 39(3)2017引用 13
SHErrLoc
TOPLAS 39(4)2017引用 12
Scaling Reliably
TOPLAS 39(4)2017引用 11
A Simple, Possibly Correct LR Parser for C11
TOPLAS 39(4)2017引用 11
The Chemical Approach to Typestate-Oriented Programming
TOPLAS 39(3)2017引用 10
Limitations of Partial Compaction
TOPLAS 39(1)2017引用 5
Newtonian Program Analysis via Tensor Product
TOPLAS 39(2)2017引用 5
Programs from Proofs
TOPLAS 39(2)2017引用 4
Verifying Reliability Properties Using the Hyperball Abstract Domain
TOPLAS 40(1)2017引用 1
Foreword
TOPLAS 39(1)2017