16:59

[OOPSLA] Monadic and Comonadic Aspects of Dependency Analysis

ACM SIGPLAN

17:32

[OOPSLA] Scalable Linear Invariant Generation with Farkas’ Lemma

ACM SIGPLAN

23:22

[OOPSLA] Generic Go to Go: Dictionary-Passing, Monomorphisation, and Hybrid

ACM SIGPLAN

24:41

[OOPSLA] Neurosymbolic Repair for Low-Code Formula Languages

ACM SIGPLAN

18:29

[OOPSLA] SHARP: fast incremental context-sensitive pointer analysis for Java

ACM SIGPLAN

15:17

[OOPSLA] Modular Verification of Op-Based CRDTs in Separation Logic

ACM SIGPLAN

13:39

[OOPSLA] Oracle-Free Repair Synthesis for Floating-Point Programs

ACM SIGPLAN

16:10

[OOPSLA] Model Checking for a Multi-Execution Memory Model

ACM SIGPLAN

14:09

[OOPSLA] Coverage-guided tensor compiler fuzzing with joint IR-pass mutation

ACM SIGPLAN

16:03

[OOPSLA] Type-Directed Synthesis of Visualizations from Natural Language Queries

ACM SIGPLAN

13:28

[OOPSLA] Consistency-Preserving Propagation for SMT Solving of Concurrent Program Verification

ACM SIGPLAN

27:37

[OOPSLA] Reasoning about Distributed Reconfigurable Systems

ACM SIGPLAN

29:17

[OOPSLA] A Fast In-Place Interpreter for WebAssembly

ACM SIGPLAN

22:32

[OOPSLA] Optimal Heap Limits for Reducing Browser Memory Use

ACM SIGPLAN

25:16

[OOPSLA] The Road Not Taken: Exploring Alias Analysis Based Optimizations Missed by the Compiler

ACM SIGPLAN

29:35

[OOPSLA] Complexity-guided container replacement synthesis

ACM SIGPLAN

22:03

[OOPSLA] Katara: Synthesizing CRDTs with Verified Lifting

ACM SIGPLAN

36:29

[OOPSLA] Specification-Guided Component-Based Synthesis from Effectful Libraries

ACM SIGPLAN

30:05

[OOPSLA] C to checked C by 3c

ACM SIGPLAN

28:18

[OOPSLA] Solo: A Lightweight Static Analysis for Differential Privacy

ACM SIGPLAN

32:24

[OOPSLA] MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types

ACM SIGPLAN

29:08

[OOPSLA] Theoretical Foundations for Objects with Pattern Matching and GADT-Style Reasoning

ACM SIGPLAN

29:10

[OOPSLA] Coeffects for Sharing and Mutation

ACM SIGPLAN

31:31

[OOPSLA] Compilation of Dynamic Sparse Tensor Algebra

ACM SIGPLAN

25:12

[OOPSLA] Incremental Type-Checking for Free: Using Scope Graphs to Derive Incremental Type-Checkers

ACM SIGPLAN

30:41

[OOPSLA] UniRec: A Unimodular-Like Framework for Nested Recursions and Loops

ACM SIGPLAN

20:33

[OOPSLA] Checking Equivalence in a Non-strict Language

ACM SIGPLAN

30:51

[OOPSLA] Necessity Specifications for Robustness

ACM SIGPLAN

28:49

[OOPSLA] Quantitative strongest post: a calculus for reasoning about the flow of quantitative inform

ACM SIGPLAN

26:59

[OOPSLA] A Study of Inline Assembly in Solidity Smart Contracts

ACM SIGPLAN

30:53

[OOPSLA] Elipmoc: advanced decompilation of Ethereum smart contracts

ACM SIGPLAN

27:57

[OOPSLA] SigVM: Enabling Event-Driven Execution for Truly Decentralized Smart Contracts

ACM SIGPLAN

29:53

[OOPSLA] Neural Architecture Search using Property Guided Synthesis

ACM SIGPLAN

28:59

[OOPSLA] Synthesizing Axiomatizations using Logic Learning

ACM SIGPLAN

30:41

[OOPSLA] Synthesizing fine-grained synchronization protocols for implicit monitors

ACM SIGPLAN

26:36

[OOPSLA] Le Temps des Cerises: Efficient Temporal Stack Safety on Capability Machines using Directed

ACM SIGPLAN

30:00

[OOPSLA] Plausible sealing for gradual parametricity

ACM SIGPLAN

30:51

[OOPSLA] Purity of an ST monad: full abstraction by semantically typed back-translation

ACM SIGPLAN

28:53

[OOPSLA] Finding real bugs in big programs with incorrectness logic

ACM SIGPLAN

32:13

[OOPSLA] Fractional Resources in Unbounded Separation Logic

ACM SIGPLAN

31:58

[OOPSLA] Proving Hypersafety Compositionally

ACM SIGPLAN

27:12

[OOPSLA] Bugs in Quantum computing platforms: an empirical study

ACM SIGPLAN

24:36

[OOPSLA] Tower: Data Structures in Quantum Superposition

ACM SIGPLAN

32:48

[OOPSLA] Verified Compilation of Quantum Oracles

ACM SIGPLAN

31:06

[OOPSLA] AnICA: Analyzing Inconsistencies in Microarchitectural Code Analyzers

ACM SIGPLAN

38:19

[OOPSLA] Seq2Parse: Neurosymbolic Parse Error Repair

ACM SIGPLAN

29:24

[OOPSLA] BFF: Foundational and Automated Verification of Bitfield-Manipulating Programs

ACM SIGPLAN

27:05

[OOPSLA] Compositional Virtual Timelines: Verifying Dynamic-Priority Partitions with Algorithmic Tem

ACM SIGPLAN

31:38

[OOPSLA] Linear types for large-scale systems verification

ACM SIGPLAN

29:36

[OOPSLA] Effects,capabilities,and boxes: from scope-based reasoning to type-based reasoning and back

ACM SIGPLAN

28:01

[OOPSLA] First-class Names for Effect Handlers

ACM SIGPLAN

31:53

[OOPSLA] High-Level Effect Handlers in C++

ACM SIGPLAN

26:03

[OOPSLA] Semi-symbolic Inference for Efficient Streaming Probabilistic Programming

ACM SIGPLAN

33:44

[OOPSLA] Symbolic Execution for Randomized Programs

ACM SIGPLAN

30:15

[OOPSLA] This Is the Moment for Probabilistic Loops

ACM SIGPLAN

23:53

[OOPSLA] A Concurrent Program Logic with a Future and History

ACM SIGPLAN

28:00

[OOPSLA] CAAT: Consistency as a Theory

ACM SIGPLAN

30:08

[OOPSLA] Implementing and Verifying Release-Acquire Transactional Memory in C11

ACM SIGPLAN

26:04

[OOPSLA] Data-Driven Lemma Synthesis for Interactive Proofs

ACM SIGPLAN

32:49

[OOPSLA] Intrinsically-Typed Definitional Interpreters à la Carte

ACM SIGPLAN

24:32

[OOPSLA] Proof transfer for fast certification of multiple approximate neural networks

ACM SIGPLAN

31:56

[OOPSLA] Can Guided Decomposition Help End-Users Write Larger Block-Based Programs? A Mobile Robot E

ACM SIGPLAN

26:58

[OOPSLA] Compositional Embeddings of Domain-Specific Languages

ACM SIGPLAN

28:57

[OOPSLA] Language-parametric static semantic code completion

ACM SIGPLAN

29:35

[OOPSLA] Overwatch: Learning Patterns in Code Edit Sequences

ACM SIGPLAN

22:05

[OOPSLA] Satisfiability Modulo Fuzzing: A Synergistic Combination of SMT Solving and Fuzzing

ACM SIGPLAN

32:03

[OOPSLA] Synthesizing Code Quality Rules from Examples

ACM SIGPLAN

27:29

[OOPSLA] C4: verified transactional objects

ACM SIGPLAN

31:43

[OOPSLA] Concurrent Size

ACM SIGPLAN

26:42

[OOPSLA] Veracity: Declarative Multicore Programming with Commutativity

ACM SIGPLAN

29:46

[OOPSLA] On incorrectness logic for Quantum programs

ACM SIGPLAN

27:53

[OOPSLA] Weighted programming: a programming paradigm for specifying mathematical models

ACM SIGPLAN

28:28

[OOPSLA] Wildcards Need Witness Protection

ACM SIGPLAN

28:22

[OOPSLA] Automated transpilation of imperative to functional code using neural-guided program synthe

ACM SIGPLAN

28:36

[OOPSLA] Synthesis-Powered Optimization of Smart Contracts via Data Type Refactoring

ACM SIGPLAN

28:14

[OOPSLA] Synthesizing Abstract Transformers

ACM SIGPLAN

30:37

[OOPSLA] Indexing the Extended Dyck-CFL Reachability for Context-Sensitive Program Analysis

ACM SIGPLAN

27:26

[OOPSLA] The Essence of Online Data Processing

ACM SIGPLAN

14:58

[OOPSLA] Taming Transitive Redundancy for Context-Free Language Reachability

ACM SIGPLAN

27:31

[OOPSLA] A Bunch of Sessions: A Propositions-as-Sessions Interpretation of Bunched Implications in

ACM SIGPLAN