3:33

TaDA Live: Compositional Reasoning for Termination of Fine-grained Concurrent Programs (Teaser)

ACM SIGPLAN

5:00

Gradualizing the Calculus of Inductive Constructions (Teaser)

ACM SIGPLAN

4:43

A cost-aware logical framework (Teaser)

ACM SIGPLAN

4:40

A formal foundation for symbolic evaluation with merging (Teaser)

ACM SIGPLAN

3:48

A Relational Theory of Effects and Coeffects (Teaser)

ACM SIGPLAN

5:01

A Separation Logic for Negative Dependence (Teaser)

ACM SIGPLAN

4:26

Connectivity Graphs: A Method for Proving Deadlock Freedom Based on Separation Logic (Teaser)

ACM SIGPLAN

5:22

Extending Intel-x86 Consistency and Persistency: Formalising the Semantics of Intel-x86 Me (Teaser)

ACM SIGPLAN

5:01

Formal Metatheory of Second-Order Abstract Syntax (Teaser)

ACM SIGPLAN

4:44

One Polynomial Approximation to Produce Correctly Rounded Results of an Elementary Functio (Teaser)

ACM SIGPLAN

5:00

Induction Duality: Primal-Dual Search for Invariants (Teaser)

ACM SIGPLAN

4:20

Interval Universal Approximation for Neural Networks (Teaser)

ACM SIGPLAN

4:15

On Incorrectness Logic and Kleene Algebra With Top and Tests (Teaser)

ACM SIGPLAN

7:20

On Type-Cases, Union Elimination, and Occurrence Typing (Teaser)

ACM SIGPLAN

5:01

Partial (In)Completeness in Abstract Interpretation (Teaser)

ACM SIGPLAN

4:00

Pirouette: Higher-Order Typed Functional Choreographies (Teaser)

ACM SIGPLAN

5:15

Profile Inference Revisited (Teaser)

ACM SIGPLAN

4:51

Provably Correct, Asymptotically Efficient, Higher-Order Reverse-Mode Automatic Differenti (Teaser)

ACM SIGPLAN

5:04

Reasoning about “Reasoning about Reasoning”: Semantics and Contextual Equivalence for Prob (Teaser)

ACM SIGPLAN

4:56

Relational E-Matching (Teaser)

ACM SIGPLAN

2:20

Quantum Information Effects (Teaser)

ACM SIGPLAN

4:59

Simuliris: A Separation Logic Framework for Verifying Concurrent Program Optimizations (Teaser)

ACM SIGPLAN

4:24

Solving String Constraints With Regex-Dependent Functions Through Transducers With Priorit (Teaser)

ACM SIGPLAN

4:45

Dependently-Typed Data Plane Programming (Teaser)

ACM SIGPLAN

4:23

Fair termination of binary sessions (Teaser)

ACM SIGPLAN

4:56

The Leaky Semicolon: Compositional Semantic Dependencies for Relaxed-Memory Concurrency (Teaser)

ACM SIGPLAN

3:51

Quantum Separation Logic: A Framework for Local Reasoning of Quantum Programs (Teaser)

ACM SIGPLAN

4:14

Property-Directed Reachability as Abstract Interpretation in the Monotone Theory (Teaser)

ACM SIGPLAN

3:55

Return of CFA: Call-Site Sensitivity Can Be Superior to Object Sensitivity Even for Object (Teaser)

ACM SIGPLAN

3:49

A Separation Logic for Heap Space under Garbage Collection (Teaser)

ACM SIGPLAN

4:25

What's Decidable about Linear Loops? (Teaser)

ACM SIGPLAN

4:57

From Enhanced Coinduction towards Enhanced Induction (Teaser)

ACM SIGPLAN

4:58

Truly Stateless, Optimal Dynamic Partial Order Reduction (Teaser)

ACM SIGPLAN

4:59

VIP: Verifying Real-World C Idioms with Integer-Pointer Casts (Teaser)

ACM SIGPLAN

4:58

Symmetries in Reversible Programming: From Symmetric Rig Groupoids to Reversible Programmi (Teaser)

ACM SIGPLAN

4:37

Concurrent Incorrectness Separation Logic (Teaser)

ACM SIGPLAN

4:49

Isolation Without Taxation: Near Zero Cost Transitions for WebAssembly and SFI (Teaser)

ACM SIGPLAN

4:00

Learning Formulas in Finite Variable Logics (Teaser)

ACM SIGPLAN

4:16

SolType: Refinement Types for Solidity (Teaser)

ACM SIGPLAN

4:35

Observational Equality: Now For Good (Teaser)

ACM SIGPLAN

4:36

Solving Constrained Horn Clauses Modulo Algebraic Data Types and Recursive Functions (Teaser)

ACM SIGPLAN

4:56

Certifying Derivation of State Machines from Coroutines (Teaser)

ACM SIGPLAN

5:00

Verified Compilation of C Programs with a Nominal Memory Model (Teaser)

ACM SIGPLAN

5:00

Layered and Object-Based Game Semantics (Teaser)

ACM SIGPLAN

5:00

Context-Bounded Verification of Thread Pools (Teaser)

ACM SIGPLAN

5:00

Efficient Algorithms for Dynamic Bidirected Dyck-Reachability (Teaser)

ACM SIGPLAN

4:23

Fully abstract models for effectful λ-calculi via category-theoretic logical relations (Teaser)

ACM SIGPLAN

4:58

Static Prediction of Parallel Computation Graphs (Teaser)

ACM SIGPLAN

4:57

Twist: Sound Reasoning for Purity and Entanglement in Quantum Programs (Teaser)

ACM SIGPLAN

5:01

Staging with Class (Teaser)

ACM SIGPLAN

4:53

Verified Tensor-Program Optimization Via High-level Scheduling Rewrites (Teaser)

ACM SIGPLAN

4:53

Oblivious Algebraic Data Types (Teaser)

ACM SIGPLAN

4:56

Bottom-up Synthesis of Recursive Functional Programs using Angelic Execution (Teaser)

ACM SIGPLAN

4:54

A Dual Number Abstraction for Static Analysis of Clarke Jacobians (Teaser)

ACM SIGPLAN

4:15

Logarithm and Program Testing (Teaser)

ACM SIGPLAN

4:54

Subcubic Certificates for CFL Reachability (Teaser)

ACM SIGPLAN

5:00

The Decidability and Complexity of Interleaved Bidirected Dyck Reachability (Teaser)

ACM SIGPLAN

5:00

Moebius: Metaprogramming using Contextual Types (Teaser)

ACM SIGPLAN

4:57

Type-Level Programming with Match Types (Teaser)

ACM SIGPLAN

4:39

Visibility Reasoning for Concurrent Snapshot Algorithms (Teaser)

ACM SIGPLAN

4:52

A Fine-Grained Computational Interpretation of Girard's Intuitionistic Proof-Nets (Teaser)

ACM SIGPLAN

4:59

Effectful Program Distancing (Teaser)

ACM SIGPLAN

4:58

PRIMA: General and Precise Neural Network Certification via Scalable Convex Hull Approxima (Teaser)

ACM SIGPLAN

2:22

Safe, Modular Packet Pipeline Programming (Teaser)

ACM SIGPLAN

5:24

Semantics for Variational Quantum Programming (Teaser)

ACM SIGPLAN