default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDProceedings of the ACM on Programming Languages, Volume 9
Volume 9, Number POPL, 2025
- Ian Erik Varatalu
, Margus Veanes, Juhan P. Ernits:
RE#: High Performance Derivative-Based Regex Matching with Intersection, Complement, and Restricted Lookarounds. 1-32 - Margus Veanes, Thomas Ball, Gabriel Ebner, Ekaterina Zhuchko:
Symbolic Automata: Omega-Regularity Modulo Theories. 33-66 - Louis Narmour, Tomofumi Yuki, Sanjay V. Rajopadhye:
Maximal Simplification of Polyhedral Reductions. 67-94 - Roland Leißa, Marcel Ullrich, Joachim Meyer, Sebastian Hack:
MimIR: An Extensible and Type-Safe Intermediate Representation for the DSL Age. 95-125 - Orpheas van Rooij, Robbert Krebbers:
Affect: An Affine Type and Effect System. 126-154 - Kengo Hirata, Chris Heunen:
Qurts: Automatic Quantum Uncomputation by Affine Types with Lifetime. 155-182 - Yiyun Liu, Jonathan Chan, Stephanie Weirich:
Consistency of a Dependent Calculus of Indistinguishability. 183-209 - Joris Ceulemans, Andreas Nuyts, Dominique Devriese:
BiSikkel: A Multimode Logical Framework in Agda. 210-240 - Shadaj Laddad, Alvin Cheung, Joseph M. Hellerstein, Mae Milano:
Flo: A Semantic Foundation for Progressive Stream Processing. 241-270 - Ellie Y. Cheng, Eric Atkinson, Guillaume Baudart, Louis Mandel, Michael Carbin:
Inference Plans for Hybrid Particle Filtering. 271-299 - Max Vistrup, Michael Sammler, Ralf Jung:
Program Logics à la Carte. 300-331 - Vikraman Choudhury, Simon J. Gay:
The Duality of λ-Abstraction. 332-361 - Chris Martens, Robert J. Simmons, Michael Arntzenius:
Finite-Choice Logic Programming. 362-390 - Freek Verbeek, Md Syadus Sefat, Zhoulai Fu, Binoy Ravindran:
On Extending Incorrectness Logic with Backwards Reasoning. 391-415 - Jason Z. S. Hu, Brigitte Pientka:
A Dependent Type Theory for Meta-programming with Intensional Analysis. 416-445 - Patrick Cousot, Jeffery Wang:
Calculational Design of Hyperlogics by Abstract Interpretation. 446-478 - Neta Elad, Sharon Shoham:
Axe 'Em: Eliminating Spurious States with Induction Axioms. 479-508 - Giovanna Kobus Conrado, Adam Husted Kjelstrøm, Jaco van de Pol, Andreas Pavlogiannis:
Program Analysis via Multiple Context Free Language Reachability. 509-538 - Noam Zilberstein, Dexter Kozen, Alexandra Silva, Joseph Tassarotti:
A Demonic Outcome Logic for Randomized Nondeterminism. 539-568 - Thibault Dardinier, Michael Sammler, Gaurav Parthasarathy, Alexander J. Summers, Peter Müller:
Formal Foundations for Translational Separation Logic Verifiers. 569-599 - Cheng Zhang, Tobias Kappé, David E. Narváez, Nico Naus:
CF-GKAT: Efficient Validation of Control-Flow Transformations. 600-626 - Xiaojia Rao, Stefan Radziuk, Conrad Watt, Philippa Gardner:
Progressful Interpreters for Efficient WebAssembly Mechanisation. 627-655 - Aïna Linn Georges, Benjamin Peters, Laila Elbeheiry, Leo White, Stephen Dolan, Richard A. Eisenberg, Chris Casinghino, François Pottier, Derek Dreyer:
Data Race Freedom à la Mode. 656-686 - Joomy Korkut, Kathrin Stark, Andrew W. Appel:
A Verified Foreign Function Interface between Coq and C. 687-717 - Balder ten Cate, Tobias Kappé:
Algebras for Deterministic Computation Are Inherently Incomplete. 718-744 - Rida Ait El Manssour, George Kenison, Mahsa Shirmohammadi, Anton Varonka:
Simple Linear Loops: Algebraic Invariants and Applications. 745-771 - Eric Giovannini, Tingting Ding, Max S. New:
Denotational Semantics of Gradual Typing using Synthetic Guarded Domain Theory. 772-801 - Jacob Prinz, Henry Blanchette, Leonidas Lampropoulos:
Pantograph: A Fluid and Typed Structure Editor. 802-831 - Jai Arora, Sirui Lu, Devansh Jain, Tianfan Xu, Farzin Houshmand, Phitchaya Mangpo Phothilimthana, Mohsen Lesani, Praveen Narayanan, Karthik Srinivasa Murthy, Rastislav Bodík, Amit Sabne, Charith Mendis:
TensorRight: Automated Verification of Tensor Graph Rewrites. 832-863 - Daniel Gratzer:
A Modal Deconstruction of Löb Induction. 864-892 - Xaver Fabian, Marco Patrignani, Marco Guarnieri, Michael Backes:
Do You Even Lift? Strengthening Compiler Security Guarantees against Spectre Attacks. 893-922 - Parosh Aziz Abdulla, Yo-Ga Chen, Yu-Fang Chen, Lukás Holík, Ondrej Lengál, Jyun-Ao Lin, Fang-Yi Lo, Wei-Lun Tsai:
Verifying Quantum Circuits with Level-Synchronized Tree Automata. 923-953 - Litao Zhou, Bruno C. d. S. Oliveira:
QuickSub: Efficient Iso-Recursive Subtyping. 954-985 - Umang Mathur, David Mestel, Mahesh Viswanathan:
The Decision Problem for Regular First Order Theories. 986-1012 - Sergey Goncharov, Stelios Tsampas, Henning Urbat:
Abstract Operational Methods for Call-by-Push-Value. 1013-1039 - Thien Udomsrirungruang, Nobuko Yoshida:
Top-Down or Bottom-Up? Complexity Analyses of Synchronous Multiparty Session Types. 1040-1071 - Matthew Amy, Joseph Lunderville:
Linear and Non-linear Relational Analyses for Quantum Program Optimization. 1072-1103 - Fabian Zaiser, Andrzej S. Murawski, C.-H. Luke Ong:
Guaranteed Bounds on Posterior Distributions of Discrete Probabilistic Programs with Loops. 1104-1135 - Naoki Kobayashi:
On Decidable and Undecidable Extensions of Simply Typed Lambda Calculus. 1136-1166 - Martin Avanzini, Gilles Barthe, Davide Davoli, Benjamin Grégoire:
A Quantitative Probabilistic Relational Hoare Logic. 1167-1195 - Philipp G. Haselwarter, Kwing Hei Li, Alejandro Aguirre, Simon Oddershede Gregersen, Joseph Tassarotti, Lars Birkedal:
Approximate Relational Reasoning for Higher-Order Probabilistic Programs. 1196-1226 - Yingte Xu, Gilles Barthe, Li Zhou:
Automating Equational Proofs in Dirac Notation. 1227-1259 - Rini Banerjee, Kayvan Memarian, Dhruv C. Makwana, Christopher Pulte, Neel Krishnaswami, Peter Sewell:
Fulminate: Testing CN Separation-Logic Specifications in C. 1260-1292 - Santiago Arranz-Olmos, Gilles Barthe, Lionel Blatter, Benjamin Grégoire, Vincent Laporte:
Preservation of Speculative Constant-Time by Compilation. 1293-1325 - Yonghyun Kim, Minki Cho, Jaehyung Lee, Jinwoo Kim, Taeyoung Yoon, Youngju Song, Chung-Kil Hur:
Archmage and CompCertCast: End-to-End Verification Supporting Integer-Pointer Casting. 1326-1354 - Roberto Giacobazzi, Francesco Ranzato:
The Best of Abstract Interpretations. 1355-1385 - Andrea Colledan, Ugo Dal Lago:
Flexible Type-Based Resource Estimation in Quantum Circuit Description Languages. 1386-1416 - Philipp Stassen, Rasmus Ejlers Møgelberg, Maaike Zwart, Alejandro Aguirre, Lars Birkedal:
Modelling Recursion and Probabilistic Choice in Guarded Type Theory. 1417-1445 - Nico Lehmann, Cole Kurashige, Nikhil Akiti, Niroop Krishnakumar, Ranjit Jhala:
Generic Refinement Types. 1446-1474 - Yongwei Yuan, Zhe Zhou, Julia Belyakova, Suresh Jagannathan:
Derivative-Guided Symbolic Execution. 1475-1505 - Sören van der Wall, Roland Meyer:
SNIP: Speculative Execution and Non-Interference Preservation for Compiler Transformations. 1506-1535 - Philippe Heim, Rayna Dimitrova:
Translation of Temporal Logic for Efficient Infinite-State Reactive Synthesis. 1536-1567 - Arthur Correnson, Bernd Finkbeiner:
Coinductive Proofs for Temporal Hyperliveness. 1568-1595 - Jack Liell-Cock, Sam Staton:
Compositional Imprecise Probability: A Solution from Graded Monads and Markov Categories. 1596-1626 - Beniamino Accattoli, Adrienne Lancelot, Giulio Manzonetto, Gabriele Vanoni:
Interaction Equivalence. 1627-1656 - Donnacha Oisín Kidney, Nicolas Wu:
Formalising Graph Algorithms with Coinduction. 1657-1686 - Jan van Brügge, James McKinna, Andrei Popescu, Dmitriy Traytel:
Barendregt Convenes with Knaster and Tarski: Strong Rule Induction for Syntax with Bindings. 1687-1718 - Jialu Bao, Emanuele D'Osualdo, Azadeh Farzan:
Bluebell: An Alliance of Relational Lifting and Independence for Probabilistic Reasoning. 1719-1749 - Yue Yao, Grant Iraci, Cheng-En Chuang, Stephanie Balzer, Lukasz Ziarek:
Semantic Logical Relations for Timed Message-Passing Protocols. 1750-1781 - Lena Verscht, Benjamin Lucien Kaminski:
A Taxonomy of Hoare-Like Logics: Towards a Holistic View using Predicate Transformers and Kleene Algebras with Top and Tests. 1782-1811 - Yoonseung Kim, Sung-Hwan Lee, Yonghyun Kim, Chung-Kil Hur:
VeriRT: An End-to-End Verification Framework for Real-Time Distributed Systems. 1812-1839 - Dhruv Nevatia, Si Liu, David A. Basin:
Reachability Analysis of the Domain Name System. 1840-1870 - Rupak Majumdar, V. R. Sathiyanarayana:
Sound and Complete Proof Rules for Probabilistic Termination. 1871-1902 - Yu Zhang, Jérémie Koenig, Zhong Shao, Yuting Wang:
Unifying Compositional Verification and Certified Compilation with a Three-Dimensional Refinement Algebra. 1903-1933 - Chenyu Zhou, Yuzhou Fang, Jingbo Wang, Chao Wang:
An Incremental Algorithm for Algebraic Program Analysis. 1934-1961 - Clement Blaudeau, Didier Rémy, Gabriel Radanne:
Avoiding Signature Avoidance in ML Modules with Zippers. 1962-1991 - Qiyuan Xu, David Sanán, Zhe Hou, Xiaokun Luan, Conrad Watt, Yang Liu:
Generically Automating Separation Logic by Functors, Homomorphisms, and Modules. 1992-2024 - Takeshi Tsukada, Hiroshi Unno, Oded Padon, Sharon Shoham:
A Primal-Dual Perspective on Program Verification Algorithms. 2025-2056 - Yufan Cai, Zhe Hou, David Sanán, Xiaokun Luan, Yun Lin, Jun Sun, Jin Song Dong:
Automated Program Refinement: Guide and Verify Code Large Language Model with Refinement Calculus. 2057-2089 - Pavel Golovin, Michalis Kokologiannakis, Viktor Vafeiadis:
RELINCHE: Automatically Checking Linearizability under Relaxed Memory Consistency. 2090-2117 - Shengyi Jiang, Chen Cui, Bruno C. d. S. Oliveira:
Bidirectional Higher-Rank Polymorphism with Intersection and Union Types. 2118-2148 - Evgenii Moiseenko, Matteo Meluzzi, Innokentii Meleshchenko, Ivan Kabashnyi, Anton Podkopaev, Soham Chakraborty:
Relaxed Memory Concurrency Re-executed. 2149-2175 - Michael D. Adams, Eric Griffis, Thomas Porter, Sundara Vishnu Satish, Eric Zhao, Cyrus Omar:
Grove: A Bidirectionally Typed Collaborative Structure Editor Calculus. 2176-2204 - Ruifeng Xie, Tom Schrijvers, Zhenjiang Hu:
Biparsers: Exact Printing for Data Synchronisation. 2205-2231 - Iason Marmanis, Michalis Kokologiannakis, Viktor Vafeiadis:
Model Checking C/C++ with Mixed-Size Accesses. 2232-2252 - Josselin Poiret, Gaëtan Gilbert, Kenji Maillard, Pierre-Marie Pédrot, Matthieu Sozeau, Nicolas Tabareau, Éric Tanter:
All Your Base Are Belong to Us: Sort Polymorphism for Proof Assistants. 2253-2281 - George Zakhour, Pascal Weisenburger, Jahrim Gabriele Cesario, Guido Salvaneschi:
Dis/Equality Graphs. 2282-2305 - Taro Sekiyama, Hiroshi Unno:
Algebraic Temporal Effects: Temporal Verification of Recursively Typed Higher-Order Programs. 2306-2336 - Clément Allain, Frédéric Bour, Basile Clément, François Pottier, Gabriel Scherer:
Tail Modulo Cons, OCaml, and Relational Separation Logic. 2337-2363
Volume 9, Number OOPSLA1, 2025
- Robert Dickerson, Prasita Mukherjee, Benjamin Delaware:
KestRel: Relational Verification using E-Graphs for Program Alignment. 1073-1100 - Cody Rivera, Bishnu Bhusal, Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan:
Checking δ-Satisfiability of Reals with Integrals. 704-729 - Donguk Kim, Minseok Jeon, Doha Hwang, Hakjoo Oh:
PAFL: Enhancing Fault Localizers by Leveraging Project-Specific Fault Patterns. 1378-1405 - Yile Gu, Ian Neal, Jiexiao Xu, Shaun Christopher Lee, Ayman Said, Musa Haydar, Jacob Van Geffen, Rohan Kadekodi, Andrew Quinn, Baris Kasikci:
Scalable and Accurate Application-Level Crash-Consistency Testing via Representative Testing. 477-506 - Shuyang Liu, Doug Lea, Jens Palsberg:
Soundness of Predictive Concurrency Analyses. 590-616 - Zhineng Zhong, Ziqi Zhang, Hanqin Guan, Ding Li:
Orax: A Feedback-Driven Framework for Efficiently Solving Satisfiability Modulo Theories and Oracles. 676-703 - Eric Mugnier, Emmanuel Anaya Gonzalez, Nadia Polikarpova, Ranjit Jhala, Yuanyuan Zhou:
Laurel: Unblocking Automated Verification with Large Language Models. 1519-1545 - Jinwoo Kim, Shaan Nagy, Thomas Reps, Loris D'Antoni:
Semantics of Sets of Programs. 844-870 - Shanto Rahman, Sachit Kuhar, Berk Çirisci, Pranav Garg, Shiqi Wang, Xiaofei Ma, Anoop Deoras, Baishakhi Ray:
UTFix: Change Aware Unit Test Repairing using LLM. 143-168 - Vimala Soundarapandian, Kartik Nagar, Aseem Rastogi, K. C. Sivaramakrishnan:
Automatically Verifying Replication-Aware Linearizability. 871-897 - Ziyi Yang, Ilya Sergey:
Inductive Synthesis of Inductive Heap Predicates. 169-195 - Minsung Cho, John Gouwar, Steven Holtzen:
Scaling Optimization over Uncertainty via Compilation. 1546-1574 - Jay Richards, Daniel Wright, Simon Cooksey, Mark Batty:
Symbolic MRD: Dynamic Memory, Undefined Behaviour, and Extrinsic Choice. 1858-1882 - Sam Stites, John M. Li, Steven Holtzen:
Multi-Language Probabilistic Programming. 1239-1266 - Tianchi Li, Xin Zhang:
Combining Formal and Informal Information in Bayesian Program Analysis via Soft Evidences. 1774-1801 - Avaljot Singh, Yasmin Sarita, Charith Mendis, Gagandeep Singh:
Automated Verification of Soundness of DNN Certifiers. 1802-1830 - Anan Kabaha, Dana Drachsler-Cohen:
Guarding the Privacy of Label-Only Access to Neural Network Classifiers via iDP Verification. 1184-1212 - Zongjie Li, Daoyuan Wu, Shuai Wang, Zhendong Su:
API-Guided Dataset Synthesis to Finetune Large Code Models. 786-815 - Ahan Gupta, Yueming Yuan, Devansh Jain, Yuhao Ge, David Aponte, Yanqi Zhou, Charith Mendis:
SPLAT: A Framework for Optimised GPU Code-Generation for SParse reguLar ATtention. 1632-1660 - Qihao Lian, Di Wang:
Automatic Linear Resource Bound Analysis for Rust via Prophecy Potentials. 1406-1433 - Guanqin Zhang, Zhenya Zhang, H. M. N. Dilum Bandara, Shiping Chen, Jianjun Zhao, Yulei Sui:
Efficient Incremental Verification of Neural Networks Guided by Counterexample Potentiality. 85-112 - Kazuki Watanabe, Sebastian Junges, Jurriaan Rot, Ichiro Hasuo:
A Unifying Approach to Product Constructions for Quantitative Temporal Inference. 1575-1603 - Daniël A. A. Pelsmaeker, Aron Zwaan, Casper Bach Poulsen, Arjan J. Mooij:
Language-Parametric Reference Synthesis. 1213-1238 - Aleksandr Fedchin, Alexander Y. Bai, Jeffrey S. Foster:
Metamorph: Synthesizing Large Objects from Dafny Specifications. 759-785 - Pedro H. Azevedo de Amorim:
Denotational Foundations for Expected Cost Analysis. 280-306 - Andreas Lööw:
The Simulation Semantics of Synthesisable Verilog. 1295-1320 - Yuchen Jiang, Runze Xue, Max S. New:
Notions of Stack-Manipulating Computation and Relative Monads. 563-589 - Thomas Bagrel, Arnaud Spiwack:
Destination Calculus: A Linear 𝜆-Calculus for Purely Functional Memory Writes. 253-279 - Yi-Zhen Tsai, Jiasi Chen, Mohsen Lesani:
Hambazi: Spatial Coordination Synthesis for Augmented Reality. 307-336 - Elaine Li, Felix Stutz, Thomas Wies, Damien Zufferey:
Characterizing Implementability of Global Protocols with Infinite States and Data. 1434-1463 - Wenhao Tang, Leo White, Stephen Dolan, Daniel Hillerström, Sam Lindley, Anton Lorenzen:
Modal Effect Types. 1130-1157 - Yao Feng, Jun Zhu, André Platzer, Jonathan Laurent:
Adaptive Shielding via Parametric Safety Proofs. 816-843 - Yikun Hu, Yituo He, Wenyu He, Haoran Li, Yubo Zhao, Shuai Wang, Dawu Gu:
Binary Cryptographic Function Identification via Similarity Analysis with Path-Insensitive Emulation. 28-56 - Hanzhang Wang, Wei Peng, Wenwen Wang, Yunping Lu, Pen-Chung Yew, Weihua Zhang:
JavART: A Lightweight Rule-Based JIT Compiler using Translation Rules Extracted from a Learning Approach. 113-142 - Anurudh Peduri, Ina Schaefer, Michael Walter:
QbC: Quantum Correctness by Construction. 534-562 - Kevin Batz, Joost-Pieter Katoen, Francesca Randone, Tobias Winkler:
Foundations for Deductive Verification of Continuous Probabilistic Programs: From Lebesgue to Riemann and Back. 421-448 - Vincent Beardsley, Chris Xiong, Ada Lamba, Michael D. Bond:
Carapace: Static-Dynamic Information Flow Control in Rust. 364-392 - William T. Hallahan, Ranjit Jhala, Ruzica Piskac:
Counterexample-Guided Inference of Modular Specifications. 1689-1716 - Yuchen Ji, Ting Dai, Zhichao Zhou, Yutian Tang, Jingzhu He:
Artemis: Toward Accurate Detection of Server-Side Request Forgeries through LLM-Assisted Inter-procedural Path-Sensitive Taint Analysis. 1349-1377 - Adam T. Geller, Sean Bocirnea, Chester J. F. Gould, Paulette Koronkevich, William J. Bowman:
Type-Preserving Flat Closure Optimization. 649-675 - Sam Cohen, Ravi Chugh:
Code Style Sheets: CSS for Code. 196-224 - Philipp Schuster, Marius Müller, Klaus Ostermann, Jonathan Immanuel Brachthäuser:
Compiling Classical Sequent Calculus to Stock Hardware: The Duality of Compilation. 1746-1773 - Giuseppe Castagna, Loïc Peyrot:
Polymorphic Records for Dynamic Languages. 1464-1491 - Dongjae Lee, Janggun Lee, Taeyoung Yoon, Minki Cho, Jeehoon Kang, Chung-Kil Hur:
Lilo: A Higher-Order, Relational Concurrent Separation Logic for Liveness. 1267-1294 - G. A. Kavvos:
Adequacy for Algebraic Effects Revisited. 927-955 - Shuo Ding, Qirun Zhang:
Fast Constraint Synthesis for C++ Function Templates. 225-252 - Arjun Ramesh, Tianshu Huang, Jaspreet Riar, Ben L. Titzer, Anthony Rowe:
Unveiling Heisenbugs with Diversified Execution. 393-420 - Wu Angela Li, Konstantinos Mamouras:
Efficient Algorithms for the Uniform Tokenization Problem. 1492-1518 - Ivan Kuraj, John K. Feser, Nadia Polikarpova, Armando Solar-Lezama:
Peepco: Batch-Based Consistency Optimization. 1101-1129 - Abtin Molavi, Amanda Xu, Swamit Tannu, Aws Albarghouthi:
Dependency-Aware Compilation for Surface Code Quantum Architectures. 57-84 - Matthew Lutze, Philipp Schuster, Jonathan Immanuel Brachthäuser:
The Simple Essence of Monomorphization. 1015-1041 - Aman Nougrahiya, V. Krishna Nandivada:
IncIDFA: An Efficient and Generic Algorithm for Incremental Iterative Dataflow Analysis. 617-648 - Xiong Xu, Jean-Pierre Talpin, Shuling Wang, Hao Wu, Bohua Zhan, Xinxin Liu, Naijun Zhan:
HpC: A Calculus for Hybrid and Mobile Systems. 1158-1183 - Mahdi Ghorbani, Emilien Bauer, Tobias Grosser, Amir Shaikhha:
Compressed and Parallelized Structured Tensor Algebra. 1717-1745 - Jihee Park, Insu Yun, Sukyoung Ryu:
Bridging the Gap between Real-World and Formal Binary Lifting through Filtered-Simulation. 898-926 - Adithya Murali, Hrishikesh Balakrishnan, Aaron Councilman, P. Madhusudan:
FO-Complete Program Verification for Heap Logics. 730-758 - Flavio Ascari, Roberto Bruni, Roberta Gori, Francesco Logozzo:
Revealing Sources of (Memory) Errors via Backward Analysis. 1321-1348 - Yedi Zhang, Lei Huang, Pengfei Gao, Fu Song, Jun Sun, Jin Song Dong:
Verification of Bit-Flip Attacks against Quantized Neural Networks. 984-1014 - Jessica Shi, Cassia Torczon, Harrison Goldstein, Benjamin C. Pierce, Andrew Head:
QED in Context: An Observation Study of Proof Assistant Users. 337-363 - Lauren Pick, Amanda Xu, Ankush Desai, Sanjit A. Seshia, Aws Albarghouthi:
Checking Observational Correctness of Database Systems. 1661-1688 - Nicholas V. Lewchenko, Gowtham Kaki, Bor-Yuh Evan Chang:
Bolt-On Strong Consistency: Specification, Implementation, and Verification. 1604-1631 - Tony Law, Delphine Demange, Sandrine Blazy:
A Mechanized Semantics for Dataflow Circuits. 507-533 - Shenghao Yuan, Zhuoruo Zhang, Jiayi Lu, David Sanán, Rui Chang, Yongwang Zhao:
A Complete Formal Semantics of eBPF Instruction Set Architecture for Solana. 1-27 - Willow Ahrens, Teodoro Fields Collin, Radha Patel, Kyle Deeds, Changwan Hong, Saman P. Amarasinghe:
Finch: Sparse and Structured Tensor Programming with Control Flow. 1042-1072 - Matthew Sotoudeh:
Pathological Cases for a Class of Reachability-Based Garbage Collectors. 449-476 - Ruixin Wang, Zhongkai Zhao, Le Fang, Nan Jiang, Yiling Lou, Lin Tan, Tianyi Zhang:
Show Me Why It's Correct: Saving 1/3 of Debugging Time in Program Repair with Interactive Runtime Comparison. 1831-1857 - Kanghee Park, Xuanyu Peng, Loris D'Antoni:
LOUD: Synthesizing Strongest and Weakest Specifications. 956-983
Volume 9, Number PLDI, 2025
- Yufei Liang, Teng Zhang, Ganlin Li, Tian Tan, Chang Xu, Chun Cao, Xiaoxing Ma, Yue Li:
Pointer Analysis for Database-Backed Applications. 1417-1441 - Alonso Rodríguez-Iglesias, Santoshkumar T. Tongli, Emily Tucker, Louis-Noël Pouchet, Gabriel Rodríguez, Juan Touriño:
Modular Construction and Optimization of the UZP Sparse Format for SpMV on CPUs. 2106-2130 - Benjamin Quiring, David Van Horn, John H. Reppy, Olin Shivers:
Webs and Flow-Directed Well-Typedness Preserving Program Transformations. 748-772 - Dan Plyukhin, Gul Agha, Fabrizio Montesi:
CRGC: Fault-Recovering Actor Garbage Collection in Pekko. 945-969 - Fabian Stemmler, Michael Schwarz, Julian Erhard, Sarah Tilscher, Helmut Seidl:
Taking Out the Toxic Trash: Recovering Precision in Mixed Flow-Sensitive Static Analyses. 1167-1193 - Yuantian Ding, Xiaokang Qiu:
A Concurrent Approach to String Transformation Synthesis. 2131-2155 - Gabriel Ebner, Guido Martínez, Aseem Rastogi, Thibault Dardinier, Megan Frisella, Tahina Ramananandro, Nikhil Swamy:
PulseCore: An Impredicative Concurrent Separation Logic for Dependently Typed Programs. 1516-1539 - Oghenevwogaga Ebresafe, Ian Zhao, Ende Jin, Arthur Bright, Charles Jian, Yizhou Zhang:
Certified Compilers à la Carte. 372-395 - Rohan Yadav, Michael Garland, Alex Aiken, Michael Bauer:
Task-Based Tensor Computations on Modern GPUs. 396-420 - Dorian Lesbre, Matthieu Lemerre, Hichem Rami Ait El Hara, François Bobot:
Relational Abstractions Based on Labeled Union-Find. 1194-1219 - Mark Moeller, Tiago Ferreira, Thomas Lu, Nate Foster, Alexandra Silva:
Active Learning of Symbolic NetKAT Automata. 1119-1142 - Qian Chen, Chenqi Cui, Fengjuan Gao, Yu Wang, Ke Wang, Linzhang Wang:
Solving Floating-Point Constraints with Continuous Optimization. 725-747 - Ariel E. Kellison, Laura Zielinski, David Bindel, Justin Hsu:
Bean: A Language for Backward Error Analysis. 1838-1862 - Catarina Gamboa, Abigail Reese, Alcides Fonseca, Jonathan Aldrich:
Usability Barriers for Liquid Types. 1911-1936 - Justin Lubin, Parker Ziegler, Sarah E. Chasins:
Programming by Navigation. 447-474 - Jesse Michel, Wonyeol Lee, Hongseok Yang:
Semantics of Integrating and Differentiating Singularities. 421-446 - Raghav Malik, Vedant Paranjape, Milind Kulkarni:
Circuit Optimization using Arithmetic Table Lookups. 301-323 - Niels Mündler, Jingxuan He, Hao Wang, Koushik Sen, Dawn Song, Martin T. Vechev:
Type-Constrained Code Generation with Language Models. 601-626 - Yusuke Matsushita, Takeshi Tsukada:
Nola: Later-Free Ghost State for Verifying Termination in Iris. 98-124 - Xufan Lu, Nuno P. Lopes:
Link-Time Optimization of Dynamic Casts in C++ Programs. 503-526 - Chris Fallin, Maxwell Bernstein:
Partial Evaluation, Whole-Program Compilation. 324-347 - Sunho Park, Jaehwang Jung, Janggun Lee, Jeehoon Kang:
Verifying Lock-Free Traversals in Relaxed Memory Separation Logic. 48-72 - Andong Fan, Han Xu, Ningning Xie:
Practical Type Inference with Levels. 2180-2203 - Bo Wang, Tianyu Li, Ruishi Li, Umang Mathur, Prateek Saxena:
Program Skeletons for Automated Program Translation. 920-944 - Xiangwei Wang, Xinning Hui, Chunhua Liao, Xipeng Shen:
Reductive Analysis with Compiler-Guided Large Language Models for Input-Centric Code Optimizations. 797-821 - Gavin Gray, Will Crichton, Shriram Krishnamurthi:
An Interactive Debugger for Rust Trait Errors. 1293-1314 - Ling Zhang, Yuting Wang, Yalun Liang, Zhong Shao:
CompCertOC: Verified Compositional Compilation of Multi-threaded Programs with Shared Stacks. 651-674 - Angus Hammond, Ricardo Almeida, Thomas Bauereiss, Brian Campbell, Ian Stark, Peter Sewell:
Morello-Cerise: A Proof of Strong Encapsulation for the Arm Morello Capability Hardware Architecture. 1961-1983 - Fridtjof Peer Stoldt, Gary Brandt Bucher II, Sylvan Clebsch, Matthew A. Johnson, Matthew J. Parkinson, Guido van Rossum, Eric Snow, Tobias Wrigstad:
Dynamic Region Ownership for Concurrency Safety. 1565-1590 - Yifei Huang, Matin Amini, Alexis Le Glaunec, Konstantinos Mamouras, Mukund Raghothaman:
Membership Testing for Semantic Regular Expressions. 1245-1268 - Souradip Ghosh, Yufei Shi, Brandon Lucia, Nathan Beckmann:
Ripple: Asynchronous Programming for Spatial Dataflow Architectures. 249-276 - Cameron Moy, Jack Czenszak, John M. Li, Brianna Marshall, Steven Holtzen:
Roulette: A Language for Expressive, Exact, and Efficient Discrete Probabilistic Programming. 2081-2105 - Shawn Ong, Stephanie Ma, Dexter Kozen:
Probabilistic Kleene Algebra with Angelic Nondeterminism. 897-919 - Longfei Qiu, Jingqi Xiao, Ji-Yong Shin, Zhong Shao:
LiDO-DAG: A Framework for Verifying Safety and Liveness of DAG-Based Consensus Protocols. 1392-1416 - Markus de Medeiros, Muhammad Naveed, Tancrède Lepoint, Temesghen Kahsai, Tristan Ravitch, Stefan Zetzsche, Anjali Joshi, Joseph Tassarotti, Aws Albarghouthi, Jean-Baptiste Tristan:
Verified Foundations for Differential Privacy. 1094-1118 - Hiromi Ogawa, Taro Sekiyama, Hiroshi Unno:
Thrust: A Prophecy-Based Refinement Type System for Rust. 2056-2080 - Yang He, Ruijie Fang, Isil Dillig, Yuepeng Wang:
Graphiti: Bridging Graph and Relational Database Queries. 1716-1740 - Margarida Ferreira, Victor Nicolet, Joey Dodds, Daniel Kroening:
Program Synthesis from Partial Traces. 1642-1665 - Sacha-Élie Ayoun, Xavier Denis, Petar Maksimovic, Philippa Gardner:
A Hybrid Approach to Semi-automated Rust Verification. 970-992 - Jules Jacobs, Nate Foster, Tobias Kappé, Dexter Kozen, Lily Saada, Alexandra Silva, Jana Wagemaker:
StacKAT: Infinite State Network Verification. 277-300 - Sehyeok Park, Justin Kim, Santosh Nagarakatte:
Correctly Rounded Math Libraries without Worrying about the Application's Rounding Mode. 2032-2055 - Farnaz Behrang, Zhizhou Zhang, Georgian-Vlad Saioc, Peng Liu, Milind Chabbi:
DR.FIX: Automatically Fixing Data Races at Industry Scale. 475-502 - Daan Leijen, Wenjia Ye:
Principal Type Inference under a Prefix: A Fresh Look at Static Overloading. 1442-1465 - Rudi Schneider, Marcus Rossel, Amir Shaikhha, Andrés Goens, Thomas Koehler, Michel Steuwer:
Slotted E-Graphs: First-Class Support for (Bound) Variables in E-Graphs. 1888-1910 - Feras A. Saad, Wonyeol Lee:
Random Variate Generation with Formal Guarantees. 125-149 - Simon Spies, Niklas Mück, Haoyi Zeng, Michael Sammler, Andrea Lattuada, Peter Müller, Derek Dreyer:
Destabilizing Iris. 848-873 - Charlie Murphy, Keith J. C. Johnson, Thomas Reps, Loris D'Antoni:
Verifying Solutions to Semantics-Guided Synthesis Problems. 1741-1765 - Hanliang Zhang, Cristina David, Meng Wang, Brandon Paulsen, Daniel Kroening:
Scalable, Validated Code Translation of Entire Projects using Large Language Models. 1616-1641 - Michael Ballantyne, Rafaello Sanna, Jason Hemann, William E. Byrd, Nada Amin:
Multi-stage Relational Programming. 1591-1615 - Parker Ziegler, Justin Lubin, Sarah E. Chasins:
Fast Direct Manipulation Programming with Patch-Reconciliation Correspondence. 699-724 - Qifan Huang, Li Zhou, Wang Fang, Mengyu Zhao, Mingsheng Ying:
Efficient Formal Verification of Quantum Error Correcting Programs. 1068-1093 - Marisa Kirisame, Tiezhi Wang, Pavel Panchekha:
Spineless Traversal for Layout Invalidation. 1791-1813 - Roy David Margalit, Michalis Kokologiannakis, Shachar Itzhaky, Ori Lahav:
Dynamic Robustness Verification against Weak Memory. 675-698 - Yu-Fang Chen, Vojtech Havlena, Michal Hecko, Lukás Holík, Ondrej Lengál:
A Uniform Framework for Handling Position Constraints in String Solving. 550-575 - Pinhan Zhao, Yuepeng Wang, Xinyu Wang:
Polygon: Symbolic Reasoning for SQL using Conflict-Driven Under-Approximation Search. 1315-1340 - Nick Rioux, Steve Zdancewic:
Functional Meaning for Parallel Streaming. 1220-1244 - Michel Weber, Theodoros Theodoridis, Zhendong Su:
Relaxing Alias Analysis: Exploring the Unexplored Space. 201-224 - Md Amit Hasan Arovi, Ruslan Nikolaev:
RRR-SMR: Reduce, Reuse, Recycle: Better Methods for Practical Lock-Free Data Structures. 2156-2179 - Filipe Marques, Mafalda Ferreira, André Nascimento, Miguel E. Coimbra, Nuno Santos, Limin Jia, José Fragoso Santos:
Automated Exploit Generation for Node.js Packages. 1341-1366 - Owen Conoly, Andres Erbsen, Adam Chlipala:
Smooth, Integrated Proofs of Cryptographic Constant Time for Nondeterministic Programs and Compilers. 1692-1715 - Kimaya Bedarkar, Laila Elbeheiry, Michael Sammler, Lennard Gäher, Björn B. Brandenburg, Derek Dreyer, Deepak Garg:
RefinedProsa: Connecting Response-Time Analysis with C Verification for Interrupt-Free Schedulers. 73-97 - Tianle Qiu, Stephen M. Blackburn:
Iso: Request-Private Garbage Collection. 874-896 - Janggun Lee, Jeonghyeon Kim, Jeehoon Kang:
Leveraging Immutability to Validate Hazard Pointers for Optimistic Traversals. 26-47 - Gordon D. Plotkin, Ningning Xie:
Handling the Selection Monad. 1766-1790 - Qiancheng Fu, Ankush Das, Marco Gaboardi:
Probabilistic Refinement Session Types. 1666-1691 - Zhicheng Zhang, Mingsheng Ying:
Quantum Register Machine: Efficient Implementation of Quantum Recursive Programs. 822-847 - Manya Bansal, Dillon Sharlet, Jonathan Ragan-Kelley, Saman P. Amarasinghe:
Lightweight and Locality-Aware Composition of Black-Box Subroutines. 1043-1067 - Mathieu Fehr, Yuyou Fan, Hugo Pompougnac, John Regehr, Tobias Grosser:
First-Class Verification Dialects for MLIR. 1466-1490 - Jaehwang Jung, Sunho Park, Janggun Lee, Jeho Yeon, Jeehoon Kang:
Verifying General-Purpose RCU for Reclamation in Relaxed Memory Separation Logic. 1-25 - Dongwei Xiao, Shuai Wang, Zhibo Liu, Yiteng Peng, Daoyuan Wu, Zhendong Su:
Divergence-Aware Testing of Graphics Shader Compiler Back-Ends. 1367-1391 - Steven Schaefer, Nathan Varner, Pedro Henrique Azevedo de Amorim, Max S. New:
Intrinsic Verification of Parsers and Formal Grammar Theory in Dependent Lambek Calculus. 773-796 - Jiaying Li, Chunxue Hao:
Support Triangle Machine. 225-248 - Jaeseong Kwon, Bongjun Jang, Juneyoung Lee, Kihong Heo:
Optimization-Directed Compiler Fuzzing for Continuous Translation Validation. 627-650 - Nathaniel Tornow, Emmanouil Giortamis, Pramod Bhatotia:
QVM: Quantum Gate Virtualization Machine. 993-1018 - Parosh Aziz Abdulla, Samuel Grahn, Bengt Jonsson, Shankaranarayanan Krishna, Om Swostik Mishra:
Efficient Linearizability Monitoring. 1937-1960 - Yixuan Li, José Wesley de Souza Magalhães, Alexander Brauckmann, Michael F. P. O'Boyle, Elizabeth Polgreen:
Guided Tensor Lifting. 1984-2006 - Daniel Riley, Grigory Fedyukovich:
Exact Loop Bound Analysis. 1814-1837 - Lasse Møldrup, Andreas Pavlogiannis:
AWDIT: An Optimal Weak Database Isolation Tester. 1540-1564 - Xiuqi Cao, Junyu Zhou, Yuhao Liu, Yunong Shi, Gushu Li:
MarQSim: Reconciling Determinism and Randomness in Compiler Optimization for Quantum Simulation. 576-600 - Abdul Rafae Noor, Dhruv Baronia, Akash Kothari, Muchen Xu, Charith Mendis, Vikram S. Adve:
MISAAL: Synthesis-Based Automatic Generation of Efficient and Retargetable Semantics-Driven Optimizations. 1269-1292 - Ritvik Sharma, Sara Achour:
Optimizing Ancilla-Based Quantum Circuits with SPARE. 176-200 - Mako Bates, Shun Kashiwa, Syed Jafri, Gan Shen, Lindsey Kuper, Joseph P. Near:
Efficient, Portable, Census-Polymorphic Choreographic Programming. 1143-1166 - Matthew Kolosick, Basavesh Ammanaghatta Shivakumar, Sunjay Cauligi, Marco Patrignani, Marco Vassena, Ranjit Jhala, Deian Stefan:
Robust Constant-Time Cryptography. 1491-1515 - Lucian Popescu, Nuno P. Lopes:
Exploiting Undefined Behavior in C/C++ Programs for Optimization: A Study on the Performance Impact. 348-371 - Maddy Bowers, Alexander K. Lew, Joshua B. Tenenbaum, Armando Solar-Lezama, Vikash K. Mansinghka:
Stochastic Lazy Knowledge Compilation for Inference in Discrete Probabilistic Programs. 1863-1887 - Shan Huang, Jingjing Liang, Ting Su, Qirun Zhang:
Robustifying Debug Information Updates in LLVM via Control-Flow Conformance Analysis. 527-549 - Minjian Zhang, Daniel Wee Soong Lim, Mosaad Al Thokair, Umang Mathur, Mahesh Viswanathan:
Efficient Timestamping for Sampling-Based Race Detection. 150-175 - Neven Villani, Johannes Hostert, Derek Dreyer, Ralf Jung:
Tree Borrows. 1019-1042 - Thomas Bourgeat, Jiazheng Liu, Adam Chlipala, Arvind:
Making Concurrent Hardware Verification Sequential. 2007-2031
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-09 22:57 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
