default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDProceedings of the ACM on Programming Languages, Volume 7
Volume 7, Number POPL, January 2023
- Christopher Pulte
, Dhruv C. Makwana, Thomas Sewell, Kayvan Memarian, Peter Sewell, Neel Krishnaswami:
CN: Verifying Systems C Code with Separation-Logic Refinement Types. 1-32 - Alejandro Aguirre, Lars Birkedal:
Step-Indexed Logical Relations for Countable Nondeterminism and Probabilistic Choice. 33-60 - Pedro Abreu, Benjamin Delaware, Alex Hubers, Christa Jenkins, J. Garrett Morris, Aaron Stump:
A Type-Based Approach to Divide-and-Conquer Recursion in Coq. 61-90 - Yanjun Wang, Zixuan Li, Chuan Jiang, Xiaokang Qiu, Sanjay G. Rao:
Comparative Synthesis: Learning Near-Optimal Network Designs by Query. 91-120 - Alexander K. Lew, Mathieu Huot, Sam Staton, Vikash K. Mansinghka:
ADEV: Sound Automatic Differentiation of Expected Values of Probabilistic Programs. 121-153 - Naoki Kobayashi, Kento Tanahashi, Ryosuke Sato, Takeshi Tsukada:
HFL(Z) Validity Checking for Automated Program Verification. 154-184 - Aaron Bembenek, Michael Greenberg, Stephen Chong:
From SMT to ASP: Solver-Based Approaches to Solving Datalog Synthesis-as-Rule-Selection Problems. 185-217 - Axel Kerinec, Giulio Manzonetto, Federico Olimpieri:
Why Are Proofs Relevant in Proof-Relevant Models? 218-248 - Aurèle Barrière, Sandrine Blazy, David Pichardie:
Formally Verified Native Code Generation in an Effectful JIT: Turning the CompCert Backend into a Formally Verified JIT Compiler. 249-277 - Joel D. Day, Vijay Ganesh, Nathan Grewal, Florin Manea:
On the Expressive Power of String Constraints. 278-308 - Peng Fu, Kohei Kishida, Neil J. Ross, Peter Selinger:
Proto-Quipper with Dynamic Lifting. 309-334 - Wonyeol Lee, Xavier Rival, Hongseok Yang:
Smoothness Analysis for Probabilistic Programs with Application to Optimised Variational Inference. 335-366 - Konstantinos Kallas, Haoran Zhang, Rajeev Alur, Sebastian Angel, Vincent Liu:
Executing Microservice Applications on Serverless, Correctly. 367-395 - David Cao, Rose Kunkel, Chandrakana Nandi, Max Willsey, Zachary Tatlock, Nadia Polikarpova:
babble: Learning Better Abstractions with E-Graphs and Anti-unification. 396-424 - Alexandra E. Michael, Anitha Gollamudi, Jay Bosamiya, Evan Johnson, Aidan Denlinger, Craig Disselkoen, Conrad Watt, Bryan Parno, Marco Patrignani, Marco Vassena, Deian Stefan:
MSWasm: Soundly Enforcing Memory-Safe Execution of Unsafe Code. 425-454 - Sirui Lu, Rastislav Bodík:
Grisette: Symbolic Compilation as a Functional Programming Library. 455-487 - Andrew M. Pitts:
Locally Nameless Sets. 488-514 - Nick Rioux, Xuejing Huang, Bruno C. d. S. Oliveira, Steve Zdancewic:
A Bowtie for a Beast: Overloading, Eta Expansion, and Extensible Data Types in F⋈. 515-543 - Michalis Kokologiannakis, Ori Lahav, Viktor Vafeiadis:
Kater: Automating Weak Memory Model Metatheory and Consistency Checking. 544-572 - Timos Antonopoulos, Eric Koskinen, Ton Chanh Le, Ramana Nagasamudram, David A. Naumann, Minh Ngo:
An Algebra of Alignment for Relational Verification. 573-603 - Yu Gu, Takeshi Tsukada, Hiroshi Unno:
Optimal CHC Solving via Termination Proofs. 604-631 - Sergey Goncharov, Stefan Milius, Lutz Schröder, Stelios Tsampas, Henning Urbat:
Towards a Higher-Order Mathematical Operational Semantics. 632-658 - Jinwoo Kim, Loris D'Antoni, Thomas W. Reps:
Unrealizability Logic. 659-688 - Simon Castellan, Pierre Clairambault:
The Geometry of Causality: Multi-token Geometry of Interaction and Its Causal Unfolding. 689-717 - Alexandre Moine, Arthur Charguéraud, François Pottier:
A High-Level Separation Logic for Heap Space under Garbage Collection. 718-747 - Emanuele D'Osualdo, Azalea Raad, Viktor Vafeiadis:
The Path to Durable Linearizability. 748-774 - Michael Sammler, Simon Spies, Youngju Song, Emanuele D'Osualdo, Robbert Krebbers, Deepak Garg, Derek Dreyer:
DimSum: A Decentralized Approach to Multi-language Semantics and Verification. 775-805 - Emmanuel Hainry, Romain Péchoux:
A General Noninterference Policy for Polynomial Time. 806-832 - Li Zhou, Gilles Barthe, Pierre-Yves Strub, Junyi Liu, Mingsheng Ying:
CoqQ: Foundational Verification of Quantum Programs. 833-865 - Joshua Gancher, Kristina Sojakova, Xiong Fan, Elaine Shi, Greg Morrisett:
A Core Calculus for Equational Proofs of Cryptographic Protocols. 866-892 - Han Xu, Xuejing Huang, Bruno C. d. S. Oliveira:
Making a Type Difference: Subtraction on Intersection Types as Generalized Record Operations. 893-920 - Finn Voichick, Liyi Li, Robert Rand, Michael Hicks:
Qunity: A Unified Language for Quantum and Classical Computing. 921-951 - José Cambronero, Sumit Gulwani, Vu Le, Daniel Perelman, Arjun Radhakrishna, Clint Simon, Ashish Tiwari:
FlashFill++: Scaling Programming by Example by Cutting to the Chase. 952-981 - Shuo Ding, Qirun Zhang:
Witnessability of Undecidable Problems. 982-1002 - Yuanbo Li, Qirun Zhang, Thomas W. Reps:
Single-Source-Single-Target Interleaved-Dyck Reachability via Integer Linear Programming. 1003-1026 - Jules Jacobs, Stephanie Balzer:
Higher-Order Leak and Deadlock Free Locks. 1027-1057 - Rajeev Alur, Caleb Stanford, Christopher Watson:
A Robust Theory of Series Parallel Graphs. 1058-1088 - Arthur Oliveira Vale, Zhong Shao, Yixuan Chen:
A Compositional Theory of Linearizability. 1089-1120 - Youngju Song, Minki Cho, Dongjae Lee, Chung-Kil Hur, Michael Sammler, Derek Dreyer:
Conditional Contextual Refinement. 1121-1151 - Daan Leijen, Anton Lorenzen:
Tail Recursion Modulo Context: An Equational Approach. 1152-1181 - Matthew Bowers, Theo X. Olausson, Lionel Wong, Gabriel Grand, Joshua B. Tenenbaum, Kevin Ellis, Armando Solar-Lezama:
Top-Down Synthesis for Library Learning. 1182-1213 - Andrei Popescu, Dmitriy Traytel:
Admissible Types-to-PERs Relativization in Higher-Order Logic. 1214-1245 - Alexey Radul, Adam Paszke, Roy Frostig, Matthew J. Johnson, Dougal Maclaurin:
You Only Linearize Once: Tangents Transpose to Gradients. 1246-1274 - Zachary Kincaid, Nicolas Koh, Shaowei Zhu:
When Less Is More: Consequence-Finding in a Weak Theory of Arithmetic. 1275-1307 - Mosaad Al Thokair, Minjian Zhang, Umang Mathur, Mahesh Viswanathan:
Dynamic Race Detection with O(1) Samples. 1308-1337 - Swaraj Dash, Younesse Kaddar, Hugo Paquet, Sam Staton:
Affine Monads and Lazy Structures for Bayesian Programming. 1338-1368 - Zilin Chen, Ambroise Lafont, Liam O'Connor, Gabriele Keller, Craig McLaughlin, Vincent Jackson, Christine Rizkallah:
Dargent: A Silver Bullet for Verified Data Layout Refinement. 1369-1395 - Litao Zhou, Yaoda Zhou, Bruno C. d. S. Oliveira:
Recursive Subtyping for All. 1396-1425 - Azadeh Farzan, Dominik Klumpp, Andreas Podelski:
Stratified Commutativity in Verification Algorithms for Concurrent Programs. 1426-1453 - Jianlin Li, Leni Ven, Pengyuan Shi, Yizhou Zhang:
Type-Preserving, Dependence-Aware Guide Generation for Sound, Effective Amortized Probabilistic Inference. 1454-1482 - Victor Arrial, Giulio Guerrieri, Delia Kesner:
Quantitative Inhabitation for Different Lambda Calculi in a Unifying Framework. 1483-1513 - Jules Jacobs, Thorsten Wißmann:
Fast Coalgebraic Bisimilarity Minimization. 1514-1541 - Abhishek Kr Singh, Ori Lahav:
An Operational Approach to Library Abstraction under Relaxed Memory Concurrency. 1542-1572 - Tom Smeding, Matthijs Vákár:
Efficient Dual-Numbers Reverse AD via Well-Known Program Transformations. 1573-1600 - Cinzia Di Giusto, Davide Ferré, Laetitia Laversa, Étienne Lozes:
A Partial Order View of Message-Passing Communication Models. 1601-1627 - Ria Das, Joshua B. Tenenbaum, Armando Solar-Lezama, Zenna Tavares:
Combining Functional and Automata Synthesis to Discover Causal Reactive Programs. 1628-1658 - Kuen-Bang Hou (Favonia), Carlo Angiuli, Reed Mullanix:
An Order-Theoretic Analysis of Universe Polymorphism. 1659-1685 - Viktor Palmkvist, Elias Castegren, Philipp Haller, David Broman:
Statically Resolvable Ambiguity. 1686-1712 - Paraschos Koutris, Shaleen Deep:
The Fine-Grained Complexity of CFL Reachability. 1713-1739 - Vasileios Klimis, Jack Clark, Alan Baker, David Neto, John Wickerson, Alastair F. Donaldson:
Taking Back Control in an Intermediate Representation for GPU Computing. 1740-1769 - Nicolas Chappe, Paul He, Ludovic Henrio, Yannick Zakowski, Steve Zdancewic:
Choice Trees: Representing Nondeterministic, Recursive, and Impure Programs in Coq. 1770-1800 - Casper Bach Poulsen, Cas van der Rest:
Hefty Algebras: Modular Elaboration of Higher-Order Algebraic Effects. 1801-1831 - Francesco Gavazzo, Cecilia Di Florio:
Elements of Quantitative Rewriting. 1832-1863 - Filippo Bonchi, Alessandro Di Giorgio, Alessio Santamaria:
Deconstructing the Calculus of Relations with Tape Diagrams. 1864-1894 - Matthieu Lemerre:
SSA Translation Is an Abstract Interpretation. 1895-1924 - Ankush Das, Di Wang, Jan Hoffmann:
Probabilistic Resource-Aware Session Types. 1925-1956 - Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Lena Verscht:
A Calculus for Amortized Expected Runtimes. 1957-1986 - Sebastian Hunt, David Sands, Sandro Stucki:
Reconciling Shannon and Scott with a Lattice of Computable Information. 1987-2016 - Jerome Jochems, Eddie Jones, Steven J. Ramsay:
Higher-Order MSL Horn Constraints. 2017-2047 - Woosuk Lee, Hangyeol Cho:
Inductive Synthesis of Structurally Recursive Functional Programs from Non-recursive Expressions. 2048-2078 - Taro Sekiyama, Hiroshi Unno:
Temporal Verification with Answer-Effect Modification: Dependent Temporal Type-and-Effect System with Delimited Continuations. 2079-2110 - Hiroshi Unno, Tachio Terauchi, Yu Gu, Eric Koskinen:
Modular Primal-Dual Fixpoint Logic Solving for Temporal Verification. 2111-2140 - Pascal Baumann, Moses Ganardi, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche:
Context-Bounded Verification of Context-Free Specifications. 2141-2170 - Loïc Pujet, Nicolas Tabareau:
Impredicative Observational Equality. 2171-2196
Volume 7, Number OOPSLA1, April 2023
- Shaohua Li, Zhendong Su:
Accelerating Fuzzing through Prefix-Guided Execution. 1-27 - Chenglin Wang, Fangzhen Lin:
Solving Conditional Linear Recurrences for Program Verification: The Periodic Case. 28-55 - Zhengyao Lin, Xiaohong Chen, Minh-Thai Trinh, John Wang, Grigore Rosu:
Generating Proof Certificates for a Language-Agnostic Deductive Program Verifier. 56-84 - Shraddha Barke, Michael B. James, Nadia Polikarpova:
Grounded Copilot: How Programmers Interact with Code-Generating Models. 85-111 - Lorenzo Gheri, Nobuko Yoshida:
Hybrid Multiparty Session Types: Compositionality for Protocol Specification through Endpoint Projection. 112-142 - Paul Krogmeier, P. Madhusudan:
Languages with Decidable Learning: A Meta-theorem. 143-171 - Christopher Wagner, Nouraldin Jaber, Roopsha Samanta:
Enabling Bounded Verification of Doubly-Unbounded Distributed Agreement-Based Systems via Bounded Regions. 172-200 - Bo Wang, Aashish Kolluri, Ivica Nikolic, Teodora Baluta, Prateek Saxena:
User-Customizable Transpilation of Scripting Languages. 201-229 - Xing Zhang, Guanchen Guo, Xiao He, Zhenjiang Hu:
Bidirectional Object-Oriented Programming: Towards Programmatic and Direct Manipulation of Objects. 230-255 - Wenjia Ye, Matías Toro, Federico Olmedo:
A Gradual Probabilistic Lambda Calculus. 256-285 - Andrea Lattuada, Travis Hance, Chanhee Cho, Matthias Brun, Isitha Subasinghe, Yi Zhou, Jon Howell, Bryan Parno, Chris Hawblitzel:
Verus: Verifying Rust Programs using Linear Ghost Types. 286-315 - Jie Zhou, John Criswell, Michael Hicks:
Fat Pointers for Temporal Memory Safety of C. 316-347 - Chan Gu Kang, Hakjoo Oh:
Modular Component-Based Quantum Circuit Synthesis. 348-375 - Anthony C. J. Fox, Gareth Stockwell, Shale Xiong, Hanno Becker, Dominic P. Mulligan, Gustavo Petri, Nathan Chong:
A Verification Methodology for the Arm® Confidential Computing Architecture: From a Secure Specification to Safe Implementations. 376-405 - Jan Menz, Andrew K. Hirsch, Peixuan Li, Deepak Garg:
Compositional Security Definitions for Higher-Order Where Declassification. 406-433 - Yuval Shapira, Eran Avneri, Dana Drachsler-Cohen:
Deep Learning Robustness Verification for Few-Pixel Attacks. 434-461 - Ike Mulder, Robbert Krebbers:
Proof Automation for Linearizability in Separation Logic. 462-491 - Alexis Le Glaunec, Lingkun Kong, Konstantinos Mamouras:
Regular Expression Matching using Bit Vector Automata. 492-521 - Noam Zilberstein, Derek Dreyer, Alexandra Silva:
Outcome Logic: A Unifying Foundation for Correctness and Incorrectness Reasoning. 522-550 - Mehmet Emre, Peter Boyland, Aesha Parekh, Ryan Schroeder, Kyle Dewey, Ben Hardekopf:
Aliasing Limits on Translating C to Safe Rust. 551-579 - Guoqiang Zhang, Benjamin Mariano, Xipeng Shen, Isil Dillig:
Automated Translation of Functional Big Data Queries to SQL. 580-608 - Yongwei Yuan, Scott Guest, Eric Griffis, Hannah Potter, David Moon, Cyrus Omar:
Live Pattern Matching with Typed Holes. 609-635 - Zhenyang Xu, Yongqiang Tian, Mengxiao Zhang, Gaosen Zhao, Yu Jiang, Chengnian Sun:
Pushing the Limit of 1-Minimality of Language-Agnostic Program Reduction. 636-664 - David Chiang, Colin McDonald, Chung-chieh Shan:
Exact Recursive Probabilistic Programming. 665-695 - Shenghua Feng, Mingshuai Chen, Han Su, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Naijun Zhan:
Lower Bounds for Possibly Divergent Probabilistic Programs. 696-726 - Amir Kafshdar Goharshady, S. Hitarth, Fatemeh Mohammadi, Harshit J. Motwani:
Algebro-geometric Algorithms for Template-Based Synthesis of Polynomial Programs. 727-756 - Levin N. Winter, Florena Buse, Daan de Graaf, Klaus von Gleissenthall, Burcu Kulahcioglu Ozkan:
Randomized Testing of Byzantine Fault Tolerant Algorithms. 757-788 - Thibault Dardinier, Gaurav Parthasarathy, Peter Müller:
Verification-Preserving Inlining in Automatic Separation Logic Verifiers. 789-818 - Ruyi Ji, Chaozhe Kong, Yingfei Xiong, Zhenjiang Hu:
Improving Oracle-Guided Inductive Synthesis by Efficient Question Selection. 819-847 - Marius Müller, Philipp Schuster, Jonathan Immanuel Brachthäuser, Klaus Ostermann:
Back to Direct Style: Typed and Tight. 848-875 - Ori Roth, Yossi Gil:
Fluent APIs in Functional Languages. 876-901
Volume 7, Number PLDI, June 2023
- Alexander Bagnall, Gordon Stewart, Anindya Banerjee:
Formally Verified Samplers from Probabilistic Programs with Loops and Conditioning. 1-24 - Kiran Gopinathan, Mayank Keoliya, Ilya Sergey:
Mostly Automated Proof Repair for Verified Libraries. 25-49 - Timothy Alberdingk Thijm, Ryan Beckett, Aarti Gupta, David Walker:
Modular Control Plane Verification via Temporal Invariants. 50-75 - Dan Cascaval, Rastislav Bodík, Adriana Schulz:
A Lineage-Based Referencing DSL for Computer-Aided Design. 76-99 - Conrad Watt, Maja Trela, Peter Lammich, Florian Märkl:
WasmRef-Isabelle: A Verified Monadic Interpreter and Industrial Fuzzing Oracle for WebAssembly. 100-123 - Mohamed Tarek Ibn Ziad, Sana Damani, Aamer Jaleel, Stephen W. Keckler, Mark Stephenson:
cuCatch: A Debugging Tool for Efficiently Catching Memory Safety Violations in CUDA Applications. 124-147 - John M. Li, Amal Ahmed, Steven Holtzen:
Lilac: A Modal Separation Logic for Conditional Probability. 148-171 - Fengjuan Gao, Yu Wang, Ke Wang:
Discrete Adversarial Attack to Models of Code. 172-195 - Sunjae Park, Woosung Song, Seunghyeon Nam, Hyeongyu Kim, Junbum Shin, Juneyoung Lee:
HEaaN.MLIR: An Optimizing Compiler for Fast Ring-Based Homomorphic Encryption. 196-220 - Martin Elsman:
Garbage-Collection Safety for Region-Based Type-Polymorphic Programs. 221-243 - Nikita Koval, Dmitry Khalanskiy, Dan Alistarh:
CQS: A Formally-Verified Framework for Fair and Abortable Synchronization. 244-266 - Shamiek Mangipudi, Pavel Chuprikov, Patrick Eugster, Malte Viering, Savvas Savvides:
Generalized Policy-Based Noninterference for Efficient Confidentiality-Preservation. 267-291 - Kyeongmin Cho, Seungmin Jeon, Azalea Raad, Jeehoon Kang:
Memento: A Framework for Detectable Recoverability in Persistent Memory. 292-317 - Yuxiang Lei, Yulei Sui, Shin Hwei Tan, Qirun Zhang:
Recursive State Machine Guided Graph Folding for Context-Free Language Reachability. 318-342 - Rachit Nigam, Pedro Henrique Azevedo de Amorim, Adrian Sampson:
Modular Hardware Design with Timeline Types. 343-367 - Tony Nuda Zhang, Upamanyu Sharma, Manos Kapritsos:
Performal: Formal Verification of Latency Properties for Distributed Systems. 368-393 - Manya Bansal, Olivia Hsu, Kunle Olukotun, Fredrik Kjolstad:
Mosaic: An Interoperable Compiler for Tensor Algebra. 394-419 - Zachary D. Sisco, Jonathan Balkind, Timothy Sherwood, Ben Hardekopf:
Loop Rerolling for Hardware Decompilation. 420-442 - Zhe Tao, Stephanie Nawas, Jacqueline Mitchell