default search action
Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCID
Stop the war!Остановите войну!
for scientists:
default search action
Internet Archive ScholarProceedings of the ACM on Programming Languages, Volume 5
Proceedings of the ACM on Programming Languages, Volume 5
Volume 5, Number POPL, January 2021
- Denis Kuperberg, Laureline Pinault, Damien Pous:
Cyclic proofs, system t, and the power of contraction. 1-28 - Patrick Bahr, Christian Uldal Graulund, Rasmus Ejlers Møgelberg:
Diamonds are not forever: liveness in reactive programming with guarded recursion. 1-28 - Benjamin Sherman, Jesse Michel, Michael Carbin:
𝜆ₛ: computable semantics for differentiable programming with higher-order functions and datatypes. 1-31 - Roy Margalit, Ori Lahav:
Verifying observational robustness against a c11-style memory model. 1-33 - Frantisek Farka, Aleksandar Nanevski, Anindya Banerjee, Germán Andrés Delbianco, Ignacio Fábregas:
On algebraic abstractions for concurrent separation logics. 1-32 - Aïna Linn Georges, Armaël Guéneau, Thomas Van Strydonck, Amin Timany
, Alix Trieu, Sander Huyghebaert, Dominique Devriese, Lars Birkedal:
Efficient and provable local capability revocation using uninitialized capabilities. 1-30 - Koen Jacobs, Amin Timany, Dominique Devriese:
Fully abstract from static to gradual. 1-30 - Gilles Barthe, Rohit Chadha, Paul Krogmeier, A. Prasad Sistla, Mahesh Viswanathan:
Deciding accuracy of differential privacy schemes. 1-30 - Chao-Hong Chen, Amr Sabry:
A computational interpretation of compact closed categories: reversible programming with negative and fractional types. 1-29 - Simon Oddershede Gregersen, Johan Bay, Amin Timany, Lars Birkedal:
Mechanized logical relations for termination-insensitive noninterference. 1-29 - Marcin Sabok, Sam Staton, Dario Stein, Michael Wolman:
Probabilistic programming semantics for name generation. 1-29 - Carlo Angiuli, Evan Cavallo, Anders Mörtberg, Max Zeuner:
Internalizing representation independence with univalence. 1-30 - Simon Spies, Neel Krishnaswami, Derek Dreyer:
Transfinite step-indexing for termination. 1-29 - Michael Benedikt, Pierre Pradic:
Generating collection transformations from proofs. 1-28 - Yotam M. Y. Feldman, Mooly Sagiv, Sharon Shoham, James R. Wilcox:
Learning the boundary of inductive invariants. 1-30 - Silvia Ghilezan, Jovanka Pantovic, Ivan Prokic, Alceste Scalas, Nobuko Yoshida:
Precise subtyping for asynchronous multiparty sessions. 1-28 - Kostas Ferles, Jon Stephens, Isil Dillig:
Verifying correct usage of context-free API protocols. 1-30 - Jatin Arora, Sam Westrick, Umut A. Acar:
Provably space-efficient parallel functional programming. 1-33 - Zvonimir Pavlinovic, Yusen Su, Thomas Wies:
Data flow refinement type inference. 1-31 - Cambridge Yang, Eric Atkinson, Michael Carbin:
Simplifying dependent reductions in the polyhedral model. 1-33 - Marco Patrignani, Eric Mark Martin, Dominique Devriese:
On the semantic expressiveness of recursive types. 1-29 - Arjen Rouvoet, Robbert Krebbers, Eelco Visser:
Intrinsically typed compilation with nameless labels. 1-28 - Max Willsey, Chandrakana Nandi, Yisu Remy Wang, Oliver Flatt, Zachary Tatlock, Pavel Panchekha:
egg: Fast and extensible equality saturation. 1-29 - Danel Ahman, Matija Pretnar:
Asynchronous effects. 1-28 - Stefan K. Muller, Jan Hoffmann:
Modeling and analyzing evaluation cost of CUDA kernels. 1-31 - Lucas Silver, Steve Zdancewic:
Dijkstra monads forever: termination-sensitive specifications for interaction trees. 1-28 - Vineet Rajani, Marco Gaboardi, Deepak Garg, Jan Hoffmann:
A unifying type-theory for higher-order (amortized) cost analysis. 1-28 - Damiano Mazza, Michele Pagani:
Automatic differentiation in PCF. 1-27 - Jay P. Lim, Mridul Aanjaneya, John Gustafson, Santosh Nagarakatte:
An approach to generate correctly rounded math libraries for new floating point variants. 1-30 - Jinwoo Kim, Qinheping Hu, Loris D'Antoni, Thomas W. Reps:
Semantics-guided synthesis. 1-32 - Julian Rosemann, Simon Moll, Sebastian Hack:
An abstract interpretation for SPMD divergence on reducible control flow graphs. 1-31 - Ugo Dal Lago, Claudia Faggian, Simona Ronchi Della Rocca:
Intersection types and (positive) almost-sure termination. 1-32 - Paulo Emílio de Vilhena, François Pottier:
A separation logic for effect handlers. 1-28 - Anders Alnor Mathiasen, Andreas Pavlogiannis:
The fine-grained and parallel complexity of andersen's pointer analysis. 1-29 - Andrew K. Hirsch, Ethan Cecchetti:
Giving semantics to program-counter labels via secure effects. 1-29 - Umang Mathur, Andreas Pavlogiannis, Mahesh Viswanathan:
Optimal prediction of synchronization-preserving races. 1-29 - Kesha Hietala, Robert Rand, Shih-Han Hung, Xiaodi Wu, Michael Hicks:
A verified optimizer for Quantum circuits. 1-29 - Jens Oliver Gutsfeld, Markus Müller-Olm, Christoph Ohrem:
Automata and fixpoints for asynchronous hyperproperties. 1-29 - Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
Relatively complete verification of probabilistic programs: an expressive language for expectation-based reasoning. 1-30 - Nathanaël Courant, Xavier Leroy:
Verified code generation for the polyhedral model. 1-24 - Ryan Doenges, Mina Tahmasbi Arashloo, Santiago Bautista, Alexander Chang, Newton Ni, Samwise Parkinson, Rudy Peterson, Alaia Solko-Breslin, Amanda Xu, Nate Foster:
Petr4: formal foundations for p4 data planes. 1-32 - Léon Gondelman, Simon Oddershede Gregersen, Abel Nieto, Amin Timany, Lars Birkedal:
Distributed causal memory: modular specification and verification in higher-order distributed separation logic. 1-29 - Michalis Kokologiannakis, Ilya Kaysin, Azalea Raad, Viktor Vafeiadis:
PerSeVerE: persistency semantics for verification under ext4. 1-29 - Pascal Baumann, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche:
Context-bounded verification of liveness properties for multithreaded shared-memory programs. 1-31 - Alban Reynaud, Gabriel Scherer, Jeremy Yallop:
A practical mode system for recursive definitions. 1-29 - Aurèle Barrière, Sandrine Blazy, Olivier Flückiger, David Pichardie, Jan Vitek:
Formally verified speculation and deoptimization in a JIT compiler. 1-26 - Artem Khyzha, Ori Lahav:
Taming x86-TSO persistency. 1-29 - Shaull Almagor, Toghrul Karimov, Edon Kelmendi, Joël Ouaknine, James Worrell:
Deciding ω-regular properties on linear recurrence sequences. 1-24 - Marco Vassena, Craig Disselkoen, Klaus von Gleissenthall, Sunjay Cauligi, Rami Gökhan Kici, Ranjit Jhala, Dean M. Tullsen, Deian Stefan:
Automatically eliminating speculative leaks from cryptographic code with blade. 1-30 - Pritam Choudhury, Harley Eades III, Richard A. Eisenberg, Stephanie Weirich:
A graded dependent type system with a usage-aware semantics. 1-32 - Beniamino Accattoli, Ugo Dal Lago, Gabriele Vanoni:
The (In)Efficiency of interaction. 1-33 - Alejandro Aguirre, Gilles Barthe, Justin Hsu, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
A pre-expectation calculus for probabilistic sensitivity. 1-28 - Cameron Moy, Phuc C. Nguyen, Sam Tobin-Hochstadt, David Van Horn:
Corpse reviver: sound and efficient gradual typing via contract verification. 1-28 - Woosuk Lee:
Combining the top-down propagation and bottom-up enumeration for inductive program synthesis. 1-28 - Eddie Jones, Steven J. Ramsay:
Intensional datatype refinement: with application to scalable verification of pattern-match safety. 1-29 - Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, Prakash Saivasan:
Deciding reachability under persistent x86-TSO. 1-32 - Ivan Di Liberti, Fosco Loregiàn, Chad Nester, Pawel Sobocinski:
Functorial semantics for partial theories. 1-28 - Jules Jacobs:
Paradoxes of probabilistic programming: and how to condition on events of measure zero with infinitesimal probabilities. 1-26 - Yuanbo Li, Qirun Zhang, Thomas W. Reps:
On the complexity of bidirected interleaved Dyck-reachability. 1-28 - Jesper Cockx, Nicolas Tabareau, Théo Winterhalter:
The taming of the rew: a type theory with computational assumptions. 1-29 - Felipe Bañados Schwerter, Alison M. Clark, Khurram A. Jafery, Ronald Garcia:
Abstracting gradual typing moving forward: precise and space-efficient. 1-28
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 2021-08-12 23:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp has been originally created in 1993 at:
since 2018, dblp is operated and maintained by:
the dblp computer science bibliography is funded and supported by:
Volume 5, Number POPL, January 2021
- Denis Kuperberg, Laureline Pinault, Damien Pous:
Cyclic proofs, system t, and the power of contraction. 1-28
- Patrick Bahr, Christian Uldal Graulund, Rasmus Ejlers Møgelberg:
Diamonds are not forever: liveness in reactive programming with guarded recursion. 1-28 - Benjamin Sherman, Jesse Michel, Michael Carbin:
𝜆ₛ: computable semantics for differentiable programming with higher-order functions and datatypes. 1-31 - Roy Margalit, Ori Lahav:
Verifying observational robustness against a c11-style memory model. 1-33 - Frantisek Farka, Aleksandar Nanevski, Anindya Banerjee, Germán Andrés Delbianco, Ignacio Fábregas:
On algebraic abstractions for concurrent separation logics. 1-32 - Aïna Linn Georges, Armaël Guéneau, Thomas Van Strydonck, Amin Timany, Alix Trieu, Sander Huyghebaert, Dominique Devriese, Lars Birkedal:
Efficient and provable local capability revocation using uninitialized capabilities. 1-30 - Koen Jacobs, Amin Timany, Dominique Devriese:
Fully abstract from static to gradual. 1-30 - Gilles Barthe, Rohit Chadha, Paul Krogmeier, A. Prasad Sistla, Mahesh Viswanathan:
Deciding accuracy of differential privacy schemes. 1-30 - Chao-Hong Chen, Amr Sabry:
A computational interpretation of compact closed categories: reversible programming with negative and fractional types. 1-29 - Simon Oddershede Gregersen, Johan Bay, Amin Timany, Lars Birkedal:
Mechanized logical relations for termination-insensitive noninterference. 1-29 - Marcin Sabok, Sam Staton, Dario Stein, Michael Wolman:
Probabilistic programming semantics for name generation. 1-29 - Carlo Angiuli, Evan Cavallo, Anders Mörtberg, Max Zeuner:
Internalizing representation independence with univalence. 1-30 - Simon Spies, Neel Krishnaswami, Derek Dreyer:
Transfinite step-indexing for termination. 1-29 - Michael Benedikt, Pierre Pradic:
Generating collection transformations from proofs. 1-28 - Yotam M. Y. Feldman, Mooly Sagiv, Sharon Shoham, James R. Wilcox:
Learning the boundary of inductive invariants. 1-30 - Silvia Ghilezan, Jovanka Pantovic, Ivan Prokic, Alceste Scalas, Nobuko Yoshida:
Precise subtyping for asynchronous multiparty sessions. 1-28 - Kostas Ferles, Jon Stephens, Isil Dillig:
Verifying correct usage of context-free API protocols. 1-30 - Jatin Arora, Sam Westrick, Umut A. Acar:
Provably space-efficient parallel functional programming. 1-33 - Zvonimir Pavlinovic, Yusen Su, Thomas Wies:
Data flow refinement type inference. 1-31 - Cambridge Yang, Eric Atkinson, Michael Carbin:
Simplifying dependent reductions in the polyhedral model. 1-33 - Marco Patrignani, Eric Mark Martin, Dominique Devriese:
On the semantic expressiveness of recursive types. 1-29 - Arjen Rouvoet, Robbert Krebbers, Eelco Visser:
Intrinsically typed compilation with nameless labels. 1-28 - Max Willsey, Chandrakana Nandi, Yisu Remy Wang, Oliver Flatt, Zachary Tatlock, Pavel Panchekha:
egg: Fast and extensible equality saturation. 1-29 - Danel Ahman, Matija Pretnar:
Asynchronous effects. 1-28 - Stefan K. Muller, Jan Hoffmann:
Modeling and analyzing evaluation cost of CUDA kernels. 1-31 - Lucas Silver, Steve Zdancewic:
Dijkstra monads forever: termination-sensitive specifications for interaction trees. 1-28 - Vineet Rajani, Marco Gaboardi, Deepak Garg, Jan Hoffmann:
A unifying type-theory for higher-order (amortized) cost analysis. 1-28 - Damiano Mazza, Michele Pagani:
Automatic differentiation in PCF. 1-27 - Jay P. Lim, Mridul Aanjaneya, John L. Gustafson, Santosh Nagarakatte:
An approach to generate correctly rounded math libraries for new floating point variants. 1-30 - Jinwoo Kim, Qinheping Hu, Loris D'Antoni, Thomas W. Reps:
Semantics-guided synthesis. 1-32 - Julian Rosemann, Simon Moll, Sebastian Hack:
An abstract interpretation for SPMD divergence on reducible control flow graphs. 1-31 - Ugo Dal Lago, Claudia Faggian, Simona Ronchi Della Rocca:
Intersection types and (positive) almost-sure termination. 1-32 - Paulo Emílio de Vilhena, François Pottier:
A separation logic for effect handlers. 1-28 - Anders Alnor Mathiasen, Andreas Pavlogiannis:
The fine-grained and parallel complexity of andersen's pointer analysis. 1-29 - Andrew K. Hirsch, Ethan Cecchetti:
Giving semantics to program-counter labels via secure effects. 1-29 - Umang Mathur, Andreas Pavlogiannis, Mahesh Viswanathan:
Optimal prediction of synchronization-preserving races. 1-29 - Kesha Hietala, Robert Rand, Shih-Han Hung, Xiaodi Wu, Michael Hicks:
A verified optimizer for Quantum circuits. 1-29 - Jens Oliver Gutsfeld, Markus Müller-Olm, Christoph Ohrem:
Automata and fixpoints for asynchronous hyperproperties. 1-29 - Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
Relatively complete verification of probabilistic programs: an expressive language for expectation-based reasoning. 1-30 - Nathanaël Courant, Xavier Leroy:
Verified code generation for the polyhedral model. 1-24 - Ryan Doenges, Mina Tahmasbi Arashloo, Santiago Bautista, Alexander Chang, Newton Ni, Samwise Parkinson, Rudy Peterson, Alaia Solko-Breslin, Amanda Xu, Nate Foster:
Petr4: formal foundations for p4 data planes. 1-32 - Léon Gondelman, Simon Oddershede Gregersen, Abel Nieto, Amin Timany, Lars Birkedal:
Distributed causal memory: modular specification and verification in higher-order distributed separation logic. 1-29 - Michalis Kokologiannakis, Ilya Kaysin, Azalea Raad, Viktor Vafeiadis:
PerSeVerE: persistency semantics for verification under ext4. 1-29 - Pascal Baumann, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche:
Context-bounded verification of liveness properties for multithreaded shared-memory programs. 1-31 - Alban Reynaud, Gabriel Scherer, Jeremy Yallop:
A practical mode system for recursive definitions. 1-29 - Aurèle Barrière, Sandrine Blazy, Olivier Flückiger, David Pichardie, Jan Vitek:
Formally verified speculation and deoptimization in a JIT compiler. 1-26 - Artem Khyzha, Ori Lahav:
Taming x86-TSO persistency. 1-29 - Shaull Almagor, Toghrul Karimov, Edon Kelmendi, Joël Ouaknine, James Worrell:
Deciding ω-regular properties on linear recurrence sequences. 1-24 - Marco Vassena, Craig Disselkoen, Klaus von Gleissenthall, Sunjay Cauligi, Rami Gökhan Kici, Ranjit Jhala, Dean M. Tullsen, Deian Stefan:
Automatically eliminating speculative leaks from cryptographic code with blade. 1-30 - Pritam Choudhury, Harley Eades III, Richard A. Eisenberg, Stephanie Weirich:
A graded dependent type system with a usage-aware semantics. 1-32 - Beniamino Accattoli, Ugo Dal Lago, Gabriele Vanoni:
The (In)Efficiency of interaction. 1-33 - Alejandro Aguirre, Gilles Barthe, Justin Hsu, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
A pre-expectation calculus for probabilistic sensitivity. 1-28 - Cameron Moy, Phuc C. Nguyen, Sam Tobin-Hochstadt, David Van Horn:
Corpse reviver: sound and efficient gradual typing via contract verification. 1-28 - Woosuk Lee:
Combining the top-down propagation and bottom-up enumeration for inductive program synthesis. 1-28 - Eddie Jones, Steven J. Ramsay:
Intensional datatype refinement: with application to scalable verification of pattern-match safety. 1-29 - Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, Prakash Saivasan:
Deciding reachability under persistent x86-TSO. 1-32 - Ivan Di Liberti, Fosco Loregiàn, Chad Nester, Pawel Sobocinski:
Functorial semantics for partial theories. 1-28 - Jules Jacobs:
Paradoxes of probabilistic programming: and how to condition on events of measure zero with infinitesimal probabilities. 1-26 - Yuanbo Li, Qirun Zhang, Thomas W. Reps:
On the complexity of bidirected interleaved Dyck-reachability. 1-28 - Jesper Cockx, Nicolas Tabareau, Théo Winterhalter:
The taming of the rew: a type theory with computational assumptions. 1-29 - Felipe Bañados Schwerter, Alison M. Clark, Khurram A. Jafery, Ronald Garcia:
Abstracting gradual typing moving forward: precise and space-efficient. 1-28
Volume 5, Number ICFP, August 2021
- Shivam Handa, Konstantinos Kallas, Nikos Vasilakis, Martin C. Rinard:
An order-aware dataflow model for parallel Unix pipelines. 1-28 - Adam Paszke, Daniel D. Johnson, David Duvenaud, Dimitrios Vytiniotis, Alexey Radul, Matthew J. Johnson, Jonathan Ragan-Kelley, Dougal Maclaurin:
Getting to the point: index sets and parallelism-preserving autodiff for pointful array programming. 1-29 - Manuel Serrano:
Of JavaScript AOT compilation performance. 1-30 - Ningning Xie, Daan Leijen:
Generalized evidence passing for effect handlers: efficient compilation of effect handlers to C. 1-30 - Conal Elliott:
Symbolic and automatic differentiation of languages. 1-18 - Donnacha Oisín Kidney, Nicolas Wu:
Algebras for weighted search. 1-30 - Zhixuan Yang, Nicolas Wu:
Reasoning about effect interaction by fusion. 1-29 - Zoe Paraskevopoulou, John M. Li, Andrew W. Appel:
Compositional optimizations for CertiCoq. 1-30 - Nikita Zyuzin, Aleksandar Nanevski:
Contextual modal types for algebraic effects and handlers. 1-29 - Alejandro Aguirre, Gilles Barthe, Marco Gaboardi, Deepak Garg, Shin-ya Katsumata, Tetsuya Sato:
Higher-order probabilistic adversarial computations: categorical semantics and program logics. 1-30 - Kimball Germane, Jay McCarthy:
Newly-single and loving it: improving higher-order must-alias analysis with heap fragments. 1-28 - Chaitanya Koparkar, Mike Rainey, Michael Vollmer, Milind Kulkarni, Ryan R. Newton:
Efficient tree-traversals: reconciling parallelism and dense data representations. 1-29 - Glen Mével, Jacques-Henri Jourdan:
Formal verification of a concurrent bounded queue in a weak memory model. 1-29 - Aymeric Fromherz, Aseem Rastogi, Nikhil Swamy, Sydney Gibson, Guido Martínez, Denis Merigoux, Tahina Ramananandro:
Steel: proof-oriented programming in a dependently typed concurrent separation logic. 1-30 - Sandro Stucki, Paolo G. Giarrusso:
A theory of higher-order subtyping with type intervals. 1-30 - Pedro Rocha, Luís Caires:
Propositions-as-types and shared state. 1-30 - Lars Birkedal, Thomas Dinsdale-Young, Armaël Guéneau, Guilhem Jaber, Kasper Svendsen, Nikos Tzevelekos:
Theorems for free from separation logic specifications. 1-29 - Yannick Zakowski, Calvin Beck, Irene Yoon, Ilia Zaichuk, Vadim Zaliva, Steve Zdancewic:
Modular, compositional, and executable formal semantics for LLVM IR. 1-30 - Denis Merigoux, Nicolas Chataing, Jonathan Protzenko:
Catala: a programming language for the law. 1-29 - Nicolas Krauter, Patrick Raaf, Peter Braam, Reza Salkhordeh, Sebastian Erdweg, André Brinkmann:
Persistent software transactional memory in Haskell. 1-29 - Taro Sekiyama, Takeshi Tsukada:
CPS transformation with affine types for call-by-value implicit polymorphism. 1-30 - Nick Giannarakis, Alexandra Silva, David Walker:
ProbNV: probabilistic verification of network control planes. 1-30 - Lukas Lazarek, Ben Greenman, Matthias Felleisen, Christos Dimoulas:
How to evaluate blame for gradual types. 1-29 - Joshua Yanovski, Hoang-Hai Dang, Ralf Jung, Derek Dreyer:
GhostCell: separating permissions from data in Rust. 1-30 - Xuejing Huang, Bruno C. d. S. Oliveira:
Distributing intersection and union types with splits and duality (functional pearl). 1-24 - David M. Kahn, Jan Hoffmann:
Automatic amortized resource analysis with the Quantum physicist's method. 1-29 - Martin Avanzini, Gilles Barthe, Ugo Dal Lago:
On continuation-passing transformations and expected cost analysis. 1-30 - Adam Chlipala:
Skipping the binder bureaucracy with mixed embeddings in a semantics course (functional pearl). 1-28 - Mitchell Pickard, Graham Hutton:
Calculating dependently-typed compilers (functional pearl). 1-27 - Farzin Houshmand, Mohsen Lesani, Keval Vora:
Grafs: declarative graph analytics. 1-32 - Richard A. Eisenberg, Guillaume Duboc, Stephanie Weirich, Daniel Lee:
An existential crisis resolved: type inference for first-class existential types. 1-29 - Zesen Qian, G. A. Kavvos, Lars Birkedal:
Client-server sessions in linear logic. 1-31 - Yasunari Watanabe, Kiran Gopinathan, George Pîrlea, Nadia Polikarpova, Ilya Sergey:
Certifying the synthesis of heap-manipulating programs. 1-29 - John M. Li, Andrew W. Appel:
Deriving efficient program transformations from rewrite rules. 1-29 - Yao Li, Li-yao Xia, Stephanie Weirich:
Reasoning about the garden of forking paths. 1-28
Volume 5, Number OOPSLA, October 2021
- Jialu Zhang, Ruzica Piskac, Ennan Zhai, Tianyin Xu:
Static detection of silent misconfigurations with deep interaction analysis. 1-30 - Zhe Zhou, Robert Dickerson, Benjamin Delaware, Suresh Jagannathan:
Data-driven abductive inference of library specifications. 1-29 - Aviral Goel, Pierre Donat-Bouillud, Filip Krikava, Christoph M. Kirsch, Jan Vitek:
What we eval in the shadows: a large-scale study of eval in R programs. 1-23 - Kevin De Porre, Carla Ferreira, Nuno M. Preguiça, Elisa Gonzalez Boix:
ECROs: building global scale systems from sequential code. 1-30 - Son Tuan Vu, Albert Cohen, Arnaud de Grandmaison, Christophe Guillon, Karine Heydemann:
Reconciling optimization with secure compilation. 1-30 - Rawn Henry, Olivia Hsu, Rohan Yadav, Stephen Chou, Kunle Olukotun, Saman P. Amarasinghe, Fredrik Kjolstad:
Compilation of sparse array programming models. 1-29 - Tian Tan, Yue Li, Xiaoxing Ma, Chang Xu, Yannis Smaragdakis:
Making pointer analysis more precise by unleashing the power of selective context sensitivity. 1-27 - Angelica Aparecida Moreira, Guilherme Ottoni, Fernando Magno Quintão Pereira:
VESPA: static profiling for binary optimization. 1-28 - Milod Kazerounian, Jeffrey S. Foster, Bonan Min:
SimTyper: sound type inference for Ruby using type equality prediction. 1-27 - Kasra Ferdowsifard, Shraddha Barke, Hila Peleg, Sorin Lerner, Nadia Polikarpova:
LooPy: interactive program synthesis with control structures. 1-29 - Malte Viering, Raymond Hu, Patrick Eugster, Lukasz Ziarek:
A multiparty session typing discipline for fault-tolerant event-driven distributed programming. 1-30 - Wolf Honoré, Jieung Kim, Ji-Yong Shin, Zhong Shao:
Much ADO about failures: a fault-aware model for compositional verification of strongly consistent distributed systems. 1-31 - Georgios Karachalias, Filip Koprivec, Matija Pretnar, Tom Schrijvers:
Efficient compilation of algebraic effect handlers. 1-28 - Haoran Xu, Fredrik Kjolstad:
Copy-and-patch compilation: a fast compilation algorithm for high-level languages and bytecode. 1-30 - Nader Al Awar, Kush Jain, Christopher J. Rossbach, Milos Gligoric:
Programming and execution models for parallel bounded exhaustive testing. 1-28 - Ziqiao Zhou, Michael K. Reiter:
Interpretable noninterference measurement and its application to processor designs. 1-30 - Yuyan Bao, Guannan Wei, Oliver Bracevac, Yuxuan Jiang, Qiyang He, Tiark Rompf:
Reachability types: tracking aliasing and separation in higher-order functional programs. 1-32 - Chandrakana Nandi, Max Willsey, Amy Zhu, Yisu Remy Wang, Brett Saiki, Adam Anderson, Adriana Schulz, Dan Grossman, Zachary Tatlock:
Rewrite rule inference using equality saturation. 1-28 - Artem Pelenitsyn, Julia Belyakova, Benjamin Chung, Ross Tate, Jan Vitek:
Type stability in Julia: avoiding performance pathologies in JIT compilation. 1-26 - Kia Rahmani, Mohammad Raza, Sumit Gulwani, Vu Le, Daniel Morris, Arjun Radhakrishna, Gustavo Soares, Ashish Tiwari:
Multi-modal program inference: a marriage of pre-trained language models and component-based synthesis. 1-29 - Ting Su, Yichen Yan, Jue Wang, Jingling Sun, Yiheng Xiong, Geguang Pu, Ke Wang, Zhendong Su:
Fully automated functional fuzzing of Android apps for detecting non-crashing logic bugs. 1-31 - Pengbo Yan, Toby Murray:
SecRSL: security separation logic for C11 release-acquire concurrency. 1-26 - Jiwon Park, Dominik Winterer, Chengyu Zhang, Zhendong Su:
Generative type-aware mutation for testing SMT solvers. 1-19 - Fabian Wolff, Aurel Bílý, Christoph Matheja, Peter Müller, Alexander J. Summers:
Modular specification and verification of closures in Rust. 1-29 - Angello Astorga, Shambwaditya Saha, Ahmad Dinkins, Felicia Wang, P. Madhusudan, Tao Xie:
Synthesizing contracts correct modulo a test generator. 1-27 - Stefanos Chaliasos, Thodoris Sotiropoulos, Georgios-Petros Drosos, Charalambos Mitropoulos, Dimitris Mitropoulos, Diomidis Spinellis:
Well-typed programs can go wrong: a study of typing-related bugs in JVM compilers. 1-30 - Tyler Sorensen, Lucas F. Salvador, Harmit Raval, Hugues Evrard, John Wickerson, Margaret Martonosi, Alastair F. Donaldson:
Specifying and testing GPU workgroup progress models. 1-30 - Ori Roth:
Study of the subtyping machine of nominal subtyping with variance. 1-27 - Xiaodong Jia, Ashish Kumar, Gang Tan:
A derivative-based parser generator for visibly Pushdown grammars. 1-24 - Satyajit Gokhale, Alexi Turcotte, Frank Tip:
Automatic migration from synchronous to asynchronous JavaScript APIs. 1-27 - Mohamad Barbar, Yulei Sui:
Compacting points-to sets through object clustering. 1-27 - Sebastian Burckhardt, Chris Gillum, David Justo, Konstantinos Kallas, Connor McMahon, Christopher S. Meiklejohn:
Durable functions: semantics for stateful serverless. 1-27 - Gust Verbruggen, Vu Le, Sumit Gulwani:
Semantic programming by example with pre-trained models. 1-25 - Guoqiang Zhang, Yuanchao Xu, Xipeng Shen, Isil Dillig:
UDF to SQL translation through compositional lazy inductive synthesis. 1-26 - Karl Cronburg, Samuel Z. Guyer:
Permchecker: a toolchain for debugging memory managers with typestate. 1-28 - Christian Bräm, Marco Eilers, Peter Müller, Robin Sierra, Alexander J. Summers:
Rich specifications for Ethereum smart contract verification. 1-30 - Ori Lahav, Egor Namakonov, Jonas Oberhauser, Anton Podkopaev, Viktor Vafeiadis:
Making weak memory models fair. 1-27 - Dan Iorga, Alastair F. Donaldson, Tyler Sorensen, John Wickerson:
The semantics of shared memory in Intel CPU/FPGA systems. 1-28 - Xipeng Shen, Guoqiang Zhang, Irene Dea, Samantha Andow, Emilio Arroyo-Fang, Neal Gafter, Johann George, Melissa Grueter, Erik Meijer, Olin Grigsby Shivers, Steffi Stumpos, Alanna Tempest, Christy Warden, Shannon Yang:
Coarsening optimization for differentiable programming. 1-27 - Xiang Gao, Arjun Radhakrishna, Gustavo Soares, Ridwan Shariffdeen, Sumit Gulwani, Abhik Roychoudhury:
APIfix: output-oriented program synthesis for combating breaking changes in libraries. 1-27 - Fabian Muehlboeck, Ross Tate:
Transitioning from structural to nominal code with efficient gradual typing. 1-29 - Ruyi Ji, Jingtao Xia, Yingfei Xiong, Zhenjiang Hu:
Generalizable synthesis through unification. 1-28 - Sándor Bartha, James Cheney, Vaishak Belle:
One down, 699 to go: or, synthesising compositional desugarings. 1-29 - Truc Lam Bui, Krishnendu Chatterjee, Tushar Gautam, Andreas Pavlogiannis, Viktor Toman:
The reads-from equivalence for the TSO and PSO memory models. 1-30 - Alexandru Dura, Christoph Reichenbach, Emma Söderberg:
JavaDL: automatically incrementalizing Java bug pattern detection. 1-31 - Justin Lubin, Sarah E. Chasins:
How statically-typed functional programmers write code. 1-30 - Florian Lanzinger, Alexander Weigl, Mattias Ulbrich, Werner Dietl:
Scalability and precision by combining expressive type systems and deductive verification. 1-29 - Peisen Yao, Qingkai Shi, Heqing Huang, Charles Zhang:
Program analysis via efficient symbolic abstraction. 1-32 - Didier Ishimwe, KimHao Nguyen, ThanhVu Nguyen:
Dynaplex: analyzing program complexity using dynamically inferred recurrence relations. 1-23 - Zoe Paraskevopoulou, Anvay Grover:
Compiling with continuations, correctly. 1-29 - Aviral Goel, Jan Jecmen, Sebastián Krynski, Olivier Flückiger, Jan Vitek:
Promises are made to be broken: migrating R to strict semantics. 1-20 - Luke Anderson, Andrew Adams, Karima Ma, Tzu-Mao Li, Tian Jin, Jonathan Ragan-Kelley:
Efficient automatic scheduling of imaging and vision pipelines for the GPU. 1-28 - Rohan Bavishi, Caroline Lemieux, Koushik Sen, Ion Stoica:
Gauss: program synthesis by reasoning over graphs. 1-29 - Nouraldin Jaber, Christopher Wagner, Swen Jacobs, Milind Kulkarni, Roopsha Samanta:
QuickSilver: modeling and parameterized verification for distributed agreement-based systems. 1-31 - Robert Brotzman, Danfeng Zhang, Mahmut Taylan Kandemir, Gang Tan:
SpecSafe: detecting cache side channels in a speculative world. 1-28 - Weili Fu, Fabian Krause, Peter Thiemann:
Label dependent lambda calculus and gradual typing. 1-29 - Michael D. Brown, Matthew Pruett, Robert Bigelow, Girish Mururu, Santosh Pande:
Not so fast: understanding and mitigating negative impacts of compiler optimizations on code reuse gadget sets. 1-30 - Arjun Pitchanathan, Christian Ulmann, Michel Weber, Torsten Hoefler, Tobias Grosser:
FPL: fast Presburger arithmetic through transprecision. 1-26 - Mehmet Emre, Ryan Schroeder, Kyle Dewey, Ben Hardekopf:
Translating C to safer Rust. 1-29 - Magnus Madsen, Jaco van de Pol:
Relational nullable types with Boolean unification. 1-28 - Guy L. Steele Jr., Sebastiano Vigna:
LXM: better splittable pseudorandom number generators (and almost as fast). 1-31 - Natalie Popescu, Ziyang Xu, Sotiris Apostolakis, David I. August, Amit Levy:
Safer at any speed: automatic context-aware safety enhancement for Rust. 1-23 - Nisarg Patel, Siddharth Krishna, Dennis E. Shasha, Thomas Wies:
Verifying concurrent multicopy search structures. 1-32 - Yann Herklotz, James D. Pollard, Nadesh Ramanathan, John Wickerson:
Formal verification of high-level synthesis. 1-30 - Masaomi Yamaguchi, Kazutaka Matsuda, Cristina David, Meng Wang:
Synbit: synthesizing bidirectional programs using unidirectional sketches. 1-31 - Eric Atkinson, Guillaume Baudart, Louis Mandel, Charles Yuan, Michael Carbin:
Statically bounded-memory delayed sampling for probabilistic streams. 1-28 - Luna Phipps-Costin, Carolyn Jane Anderson, Michael Greenberg, Arjun Guha:
Solver-based gradual type migration. 1-27 - Yannis Smaragdakis, Neville Grech, Sifis Lagouvardos, Konstantinos Triantafyllou, Ilias Tsatiris:
Symbolic value-flow static analysis: deep, precise, complete modeling of Ethereum smart contracts. 1-30 - Paul He, Eddy Westbrook, Brent Carmer, Chris Phifer, Valentin Robert, Karl Smeltzer, Andrei Stefanescu, Aaron Tomb, Adam Wick, Matthew Yacavone, Steve Zdancewic:
A type system for extracting functional specifications from memory-safe imperative programs. 1-29 - Stefan Malewski, Michael Greenberg, Éric Tanter:
Gradually structured data. 1-29 - Ranadeep Biswas, Diptanshu Kakwani, Jyothi Vedurada, Constantin Enea, Akash Lal:
MonkeyDB: effectively testing correctness under weak isolation levels. 1-27
a service of
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 2023-12-08 00:02 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:
+
+
+
+
+
+
+
+
-
Stop the war!
-
+Stop the war!
+
-
+
+
Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStop the war!Остановите войну!
for scientists:
default search action
Proceedings of the ACM on Programming Languages, Volume 7
Proceedings 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, Aditya V. Thakur:
Architecture-Preserving Provable Repair of Deep Neural Networks. 443-467 - Yihong Zhang, Yisu Remy Wang, Oliver Flatt, David Cao, Philip Zucker, Eli Rosenthal, Zachary Tatlock, Max Willsey:
Better Together: Unifying Datalog and Equality Saturation. 468-492 - Jihyeok Park, Dongjun Youn, Kanguk Lee, Sukyoung Ryu:
Feature-Sensitive Coverage for Conformance Testing of Programming Language Implementations. 493-515 - Yulong Huang, Jeremy Yallop:
Defunctionalization with Dependent Types. 516-538 - Wenjie Ma, Shengyuan Yang, Tian Tan, Xiaoxing Ma, Chang Xu, Yue Li:
Context Sensitivity without Contexts: A Cut-Shortcut Approach to Fast and Precise Pointer Analysis. 539-564 - Ahmed Bouajjani, Constantin Enea, Enrique Román-Calvo:
Dynamic Partial Order Reduction for Checking Correctness against Transaction Isolation Levels. 565-590 - Tetsuro Yamazaki, Tomoki Nakamaru, Ryota Shioya, Tomoharu Ugawa, Shigeru Chiba:
Collecting Cyclic Garbage across Foreign Function Interfaces: Who Takes the Last Piece of Cake? 591-614 - Joseph Tassarotti, Jean-Baptiste Tristan:
Verified Density Compilation for a Probabilistic Programming Language. 615-637 - Junrui Liu, Yanju Chen, Eric Atkinson, Yu Feng, Rastislav Bodík:
Conflict-Driven Synthesis for Layout Engines. 638-659 - Lauren Pick, Ankush Desai, Aarti Gupta:
Psym: Efficient Symbolic Exploration of Distributed Systems. 660-685 - Celeste Barnaby, Qiaochu Chen, Roopsha Samanta, Isil Dillig:
ImageEye: Batch Image Processing using Program Synthesis. 686-711 - Stefan K. Muller, Kyle Singer, Devyn Terra Keeney, Andrew Neth, Kunal Agrawal, I-Ting Angelina Lee, Umut A. Acar:
Responsive Parallelism with Synchronization. 712-735 - Milijana Surbatovich, Naomi Spargo, Limin Jia, Brandon Lucia:
A Type System for Safe Intermittent Computing. 736-760 - Hünkar Can Tunç, Parosh Aziz Abdulla, Soham Chakraborty, Shankaranarayanan Krishna, Umang Mathur, Andreas Pavlogiannis:
Optimal Reads-From Consistency Checking for C11-Style Memory Models. 761-785 - Mark Niklas Müller, Marc Fischer, Robin Staab, Martin T. Vechev:
Abstract Interpretation of Fixpoint Iterators with Applications to Neural Networks. 786-810 - Dongjae Lee, Minki Cho, Jinwoo Kim, Soonwon Moon, Youngju Song, Chung-Kil Hur:
Fair Operational Semantics. 811-834 - Amanda Xu, Abtin Molavi, Lauren Pick, Swamit Tannu, Aws Albarghouthi:
Synthesizing Quantum-Circuit Optimizers. 835-859 - Yongwei Yuan, Arjun Radhakrishna, Roopsha Samanta:
Trace-Guided Inductive Synthesis of Recursive Functional Programs. 860-883 - Martin Elsman, Troels Henriksen:
Parallelism in a Region Inference Context. 884-906 - Raphael Isemann, Cristiano Giuffrida, Herbert Bos, Erik van der Kouwe, Klaus von Gleissenthall:
Don't Look UB: Exposing Sanitizer-Eliding Compiler Optimizations. 907-927 - Dragana Milovancevic, Viktor Kuncak:
Proving and Disproving Equivalence of Functional Programming Assignments. 928-951 - Hrutvik Kanabar, Samuel Vivien, Oskar Abrahamsson, Magnus O. Myreen, Michael Norrish, Johannes Åman Pohjola, Riccardo Zanetti:
PureCake: A Verified Compiler for a Lazy Functional Language. 952-976 - William Brandon, Benjamin Driscoll, Frank Dai, Wilson Berkow, Mae Milano:
Better Defunctionalization through Lambda Set Specialization. 977-1000 - Qianchuan Ye, Benjamin Delaware:
Taype: A Policy-Agnostic Language for Oblivious Computation. 1001-1025 - Dan Moseley, Mario Nishio, Jose Perez Rodriguez, Olli Saarikivi, Stephen Toub, Margus Veanes, Tiki Wan, Eric Xu:
Derivative Based Nonbacktracking Real-World Regex Matching with Backtracking Semantics. 1026-1049 - Martin Avanzini, Georg Moser, Michael Schaper:
Automated Expected Value Analysis of Recursive Programs. 1050-1072 - Jialun Zhang, Greg Morrisett, Gang Tan:
Interval Parsing Grammars for File Format Parsing. 1073-1095 - Xiaojia Rao, Aïna Linn Georges, Maxime Legoupil, Conrad Watt, Jean Pichon-Pharabod, Philippa Gardner, Lars Birkedal:
Iris-Wasm: Robust and Modular Verification of WebAssembly Programs. 1096-1120 - Thomas Sewell, Magnus O. Myreen, Yong Kiam Tan, Ramana Kumar, Alexander Mihajlovic, Oskar Abrahamsson, Scott Owens:
Cakes That Bake Cakes: Dynamic Computation in CakeML. 1121-1144 - Andrés Goens, Soham Chakraborty, Susmit Sarkar, Sukarn Agarwal, Nicolai Oswald, Vijay Nagarajan:
Compound Memory Models. 1145-1168 - Scott Kovach, Praneeth Kolichala, Tiancheng Gu, Fredrik Kjolstad:
Indexed Streams: A Formal Intermediate Representation for Fused Contraction Programs. 1169-1193 - Jeremy Yallop, Ningning Xie, Neel Krishnaswami:
flap: A Deterministic Parser with Fused Lexing. 1194-1217 - Yu-Fang Chen, Kai-Min Chung, Ondrej Lengál, Jyun-Ao Lin, Wei-Lun Tsai, Di-De Yen:
An Automata-Based Framework for Verification and Bug Hunting in Quantum Circuits. 1218-1243 - Zhe Zhou, Ashish Mishra, Benjamin Delaware, Suresh Jagannathan:
Covering All the Bases: Type-Based Verification of Test Input Generators. 1244-1267 - Joel Kuepper, Andres Erbsen, Jason Gross, Owen Conoly, Chuyue Sun, Samuel Tian, David Wu, Adam Chlipala, Chitchanok Chuengsatiansup, Daniel Genkin, Markus Wagner, Yuval Yarom:
CryptOpt: Verified Compilation with Randomized Program Search for Cryptographic Primitives. 1268-1292 - Olivier Tardieu, David Grove, Gheorghe-Teodor Bercea, Paul Castro, Jaroslaw Cwiklik, Edward A. Epstein:
Reliable Actors with Retry Orchestration. 1293-1316 - Mojtaba Valizadeh, Martin Berger:
Search-Based Regular Expression Inference on a GPU. 1317-1339 - Ike Mulder, Lukasz Czajka, Robbert Krebbers:
Beyond Backtracking: Connections in Fine-Grained Concurrent Separation Logic. 1340-1364 - George Zakhour, Pascal Weisenburger, Guido Salvaneschi:
Type-Checking CRDT Convergence. 1365-1388 - Andreia Mordido, Janek Spaderna, Peter Thiemann, Vasco T. Vasconcelos:
Parameterized Algebraic Protocols. 1389-1413 - Jonás Fiala, Shachar Itzhaky, Peter Müller, Nadia Polikarpova, Ilya Sergey:
Leveraging Rust Types for Program Synthesis. 1414-1437 - Zongyuan Liu, Sergei Stepanenko, Jean Pichon-Pharabod, Amin Timany, Aslan Askarov, Lars Birkedal:
VMSL: A Separation Logic for Mechanised Robust Safety of Virtual Machines Communicating above FF-A. 1438-1462 - Ziyang Li, Jiani Huang, Mayur Naik:
Scallop: A Language for Neurosymbolic Programming. 1463-1487 - Seemanta Saha, Surendra Ghentiyala, Shihua Lu, Lucas Bang, Tevfik Bultan:
Obtaining Information Leakage Bounds via Approximate Model Counting. 1488-1509 - Shankara Pailoor, Yanju Chen, Franklyn Wang, Clara Rodríguez-Núñez, Jacob Van Geffen, Jason Morton, Michael Chu, Brian Gu, Yu Feng, Isil Dillig:
Automated Detection of Under-Constrained Circuits in Zero-Knowledge Proofs. 1510-1532 - Nico Lehmann, Adam T. Geller, Niki Vazou, Ranjit Jhala:
Flux: Liquid Types for Rust. 1533-1557 - Jatin Arora, Sam Westrick, Umut A. Acar:
Efficient Parallel Functional Programming with Effects. 1558-1583 - Sankha Narayan Guria, Jeffrey S. Foster, David Van Horn:
Absynthe: Abstract Interpretation-Guided Synthesis. 1584-1607 - Ende Jin, Nada Amin, Yizhou Zhang:
Extensible Metatheory Mechanization via Family Polymorphism. 1608-1632 - Nariyoshi Chida, Tachio Terauchi:
Repairing Regular Expressions for Extraction. 1633-1656 - Yongho Yoon, Woosuk Lee, Kwangkeun Yi:
Inductive Program Synthesis via Iterative Forward-Backward Abstract Interpretation. 1657-1681 - Marco Eilers, Thibault Dardinier, Peter Müller:
CommCSL: Proving Information Flow Security for Concurrent Programs using Abstract Commutativity. 1682-1707 - Alexander K. Lew, Matin Ghavamizadeh, Martin C. Rinard, Vikash K. Mansinghka:
Probabilistic Programming with Stochastic Probabilities. 1708-1732 - Hünkar Can Tunç, Umang Mathur, Andreas Pavlogiannis, Mahesh Viswanathan:
Sound Dynamic Deadlock Prediction in Linear Time. 1733-1758 - Jacob Prinz, Leonidas Lampropoulos:
Merging Inductive Relations. 1759-1778 - Noah Bertram, Alex Levinson, Justin Hsu:
Cutting the Cake: A Language for Fair Division. 1779-1800 - Bastien Lecoeur, Hasan Mohsin, Alastair F. Donaldson:
Program Reconditioning: Avoiding Undefined Behaviour When Finding and Reducing Compiler Bugs. 1801-1825 - Vsevolod Livinskii, Dmitry Babokin, John Regehr:
Fuzzing Loop Optimizations in Compilers for C++ and Data-Parallel Languages. 1826-1847 - Roland Meyer, Thomas Wies, Sebastian Wolff:
Embedding Hindsight Reasoning in Separation Logic. 1848-1871 - Sung-Hwan Lee, Minki Cho, Roy Margalit, Chung-Kil Hur, Ori Lahav:
Putting Weak Memory in Order via a Promising Intermediate Representation. 1872-1895 - Jingbo Wang, Aarti Gupta, Chao Wang:
Synthesizing MILP Constraints for Efficient and Robust Optimization. 1896-1919 - Shubham Ugare, Debangshu Banerjee, Sasa Misailovic, Gagandeep Singh:
Incremental Verification of Neural Networks. 1920-1945 - Luca Beurer-Kellner, Marc Fischer, Martin T. Vechev:
Prompting Is Programming: A Query Language for Large Language Models. 1946-1969 - Tom Yuviler, Dana Drachsler-Cohen:
One Pixel Adversarial Attacks via Sketched Programs. 1970-1994 - Lucas Wilkinson, Kazem Cheshmi, Maryam Mehri Dehnavi:
Register Tiling for Unstructured Sparsity in Neural Network Inference. 1995-2020
a service of 
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 2023-11-09 20:52 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:
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, Aditya V. Thakur:
Architecture-Preserving Provable Repair of Deep Neural Networks. 443-467 - Yihong Zhang, Yisu Remy Wang, Oliver Flatt, David Cao, Philip Zucker, Eli Rosenthal, Zachary Tatlock, Max Willsey:
Better Together: Unifying Datalog and Equality Saturation. 468-492 - Jihyeok Park, Dongjun Youn, Kanguk Lee, Sukyoung Ryu:
Feature-Sensitive Coverage for Conformance Testing of Programming Language Implementations. 493-515 - Yulong Huang, Jeremy Yallop:
Defunctionalization with Dependent Types. 516-538 - Wenjie Ma, Shengyuan Yang, Tian Tan, Xiaoxing Ma, Chang Xu, Yue Li:
Context Sensitivity without Contexts: A Cut-Shortcut Approach to Fast and Precise Pointer Analysis. 539-564 - Ahmed Bouajjani, Constantin Enea, Enrique Román-Calvo:
Dynamic Partial Order Reduction for Checking Correctness against Transaction Isolation Levels. 565-590 - Tetsuro Yamazaki, Tomoki Nakamaru, Ryota Shioya, Tomoharu Ugawa, Shigeru Chiba:
Collecting Cyclic Garbage across Foreign Function Interfaces: Who Takes the Last Piece of Cake? 591-614 - Joseph Tassarotti, Jean-Baptiste Tristan:
Verified Density Compilation for a Probabilistic Programming Language. 615-637 - Junrui Liu, Yanju Chen, Eric Atkinson, Yu Feng, Rastislav Bodík:
Conflict-Driven Synthesis for Layout Engines. 638-659 - Lauren Pick, Ankush Desai, Aarti Gupta:
Psym: Efficient Symbolic Exploration of Distributed Systems. 660-685 - Celeste Barnaby, Qiaochu Chen, Roopsha Samanta, Isil Dillig:
ImageEye: Batch Image Processing using Program Synthesis. 686-711 - Stefan K. Muller, Kyle Singer, Devyn Terra Keeney, Andrew Neth, Kunal Agrawal, I-Ting Angelina Lee, Umut A. Acar:
Responsive Parallelism with Synchronization. 712-735 - Milijana Surbatovich, Naomi Spargo, Limin Jia, Brandon Lucia:
A Type System for Safe Intermittent Computing. 736-760 - Hünkar Can Tunç, Parosh Aziz Abdulla, Soham Chakraborty, Shankaranarayanan Krishna, Umang Mathur, Andreas Pavlogiannis:
Optimal Reads-From Consistency Checking for C11-Style Memory Models. 761-785 - Mark Niklas Müller, Marc Fischer, Robin Staab, Martin T. Vechev:
Abstract Interpretation of Fixpoint Iterators with Applications to Neural Networks. 786-810 - Dongjae Lee, Minki Cho, Jinwoo Kim, Soonwon Moon, Youngju Song, Chung-Kil Hur:
Fair Operational Semantics. 811-834 - Amanda Xu, Abtin Molavi, Lauren Pick, Swamit Tannu, Aws Albarghouthi:
Synthesizing Quantum-Circuit Optimizers. 835-859 - Yongwei Yuan, Arjun Radhakrishna, Roopsha Samanta:
Trace-Guided Inductive Synthesis of Recursive Functional Programs. 860-883 - Martin Elsman, Troels Henriksen:
Parallelism in a Region Inference Context. 884-906 - Raphael Isemann, Cristiano Giuffrida, Herbert Bos, Erik van der Kouwe, Klaus von Gleissenthall:
Don't Look UB: Exposing Sanitizer-Eliding Compiler Optimizations. 907-927 - Dragana Milovancevic, Viktor Kuncak:
Proving and Disproving Equivalence of Functional Programming Assignments. 928-951 - Hrutvik Kanabar, Samuel Vivien, Oskar Abrahamsson, Magnus O. Myreen, Michael Norrish, Johannes Åman Pohjola, Riccardo Zanetti:
PureCake: A Verified Compiler for a Lazy Functional Language. 952-976 - William Brandon, Benjamin Driscoll, Frank Dai, Wilson Berkow, Mae Milano:
Better Defunctionalization through Lambda Set Specialization. 977-1000 - Qianchuan Ye, Benjamin Delaware:
Taype: A Policy-Agnostic Language for Oblivious Computation. 1001-1025 - Dan Moseley, Mario Nishio, Jose Perez Rodriguez, Olli Saarikivi, Stephen Toub, Margus Veanes, Tiki Wan, Eric Xu:
Derivative Based Nonbacktracking Real-World Regex Matching with Backtracking Semantics. 1026-1049 - Martin Avanzini, Georg Moser, Michael Schaper:
Automated Expected Value Analysis of Recursive Programs. 1050-1072 - Jialun Zhang, Greg Morrisett, Gang Tan:
Interval Parsing Grammars for File Format Parsing. 1073-1095 - Xiaojia Rao, Aïna Linn Georges, Maxime Legoupil, Conrad Watt, Jean Pichon-Pharabod, Philippa Gardner, Lars Birkedal:
Iris-Wasm: Robust and Modular Verification of WebAssembly Programs. 1096-1120 - Thomas Sewell, Magnus O. Myreen, Yong Kiam Tan, Ramana Kumar, Alexander Mihajlovic, Oskar Abrahamsson, Scott Owens:
Cakes That Bake Cakes: Dynamic Computation in CakeML. 1121-1144 - Andrés Goens, Soham Chakraborty, Susmit Sarkar, Sukarn Agarwal, Nicolai Oswald, Vijay Nagarajan:
Compound Memory Models. 1145-1168 - Scott Kovach, Praneeth Kolichala, Tiancheng Gu, Fredrik Kjolstad:
Indexed Streams: A Formal Intermediate Representation for Fused Contraction Programs. 1169-1193 - Jeremy Yallop, Ningning Xie, Neel Krishnaswami:
flap: A Deterministic Parser with Fused Lexing. 1194-1217 - Yu-Fang Chen, Kai-Min Chung, Ondrej Lengál, Jyun-Ao Lin, Wei-Lun Tsai, Di-De Yen:
An Automata-Based Framework for Verification and Bug Hunting in Quantum Circuits. 1218-1243 - Zhe Zhou, Ashish Mishra, Benjamin Delaware, Suresh Jagannathan:
Covering All the Bases: Type-Based Verification of Test Input Generators. 1244-1267 - Joel Kuepper, Andres Erbsen, Jason Gross, Owen Conoly, Chuyue Sun, Samuel Tian, David Wu, Adam Chlipala, Chitchanok Chuengsatiansup, Daniel Genkin, Markus Wagner, Yuval Yarom:
CryptOpt: Verified Compilation with Randomized Program Search for Cryptographic Primitives. 1268-1292 - Olivier Tardieu, David Grove, Gheorghe-Teodor Bercea, Paul Castro, Jaroslaw Cwiklik, Edward A. Epstein:
Reliable Actors with Retry Orchestration. 1293-1316 - Mojtaba Valizadeh, Martin Berger:
Search-Based Regular Expression Inference on a GPU. 1317-1339 - Ike Mulder, Lukasz Czajka, Robbert Krebbers:
Beyond Backtracking: Connections in Fine-Grained Concurrent Separation Logic. 1340-1364 - George Zakhour, Pascal Weisenburger, Guido Salvaneschi:
Type-Checking CRDT Convergence. 1365-1388 - Andreia Mordido, Janek Spaderna, Peter Thiemann, Vasco T. Vasconcelos:
Parameterized Algebraic Protocols. 1389-1413 - Jonás Fiala, Shachar Itzhaky, Peter Müller, Nadia Polikarpova, Ilya Sergey:
Leveraging Rust Types for Program Synthesis. 1414-1437 - Zongyuan Liu, Sergei Stepanenko, Jean Pichon-Pharabod, Amin Timany, Aslan Askarov, Lars Birkedal:
VMSL: A Separation Logic for Mechanised Robust Safety of Virtual Machines Communicating above FF-A. 1438-1462 - Ziyang Li, Jiani Huang, Mayur Naik:
Scallop: A Language for Neurosymbolic Programming. 1463-1487 - Seemanta Saha, Surendra Ghentiyala, Shihua Lu, Lucas Bang, Tevfik Bultan:
Obtaining Information Leakage Bounds via Approximate Model Counting. 1488-1509 - Shankara Pailoor, Yanju Chen, Franklyn Wang, Clara Rodríguez-Núñez, Jacob Van Geffen, Jason Morton, Michael Chu, Brian Gu, Yu Feng, Isil Dillig:
Automated Detection of Under-Constrained Circuits in Zero-Knowledge Proofs. 1510-1532 - Nico Lehmann, Adam T. Geller, Niki Vazou, Ranjit Jhala:
Flux: Liquid Types for Rust. 1533-1557 - Jatin Arora, Sam Westrick, Umut A. Acar:
Efficient Parallel Functional Programming with Effects. 1558-1583 - Sankha Narayan Guria, Jeffrey S. Foster, David Van Horn:
Absynthe: Abstract Interpretation-Guided Synthesis. 1584-1607 - Ende Jin, Nada Amin, Yizhou Zhang:
Extensible Metatheory Mechanization via Family Polymorphism. 1608-1632 - Nariyoshi Chida, Tachio Terauchi:
Repairing Regular Expressions for Extraction. 1633-1656 - Yongho Yoon, Woosuk Lee, Kwangkeun Yi:
Inductive Program Synthesis via Iterative Forward-Backward Abstract Interpretation. 1657-1681 - Marco Eilers, Thibault Dardinier, Peter Müller:
CommCSL: Proving Information Flow Security for Concurrent Programs using Abstract Commutativity. 1682-1707 - Alexander K. Lew, Matin Ghavamizadeh, Martin C. Rinard, Vikash K. Mansinghka:
Probabilistic Programming with Stochastic Probabilities. 1708-1732 - Hünkar Can Tunç, Umang Mathur, Andreas Pavlogiannis, Mahesh Viswanathan:
Sound Dynamic Deadlock Prediction in Linear Time. 1733-1758 - Jacob Prinz, Leonidas Lampropoulos:
Merging Inductive Relations. 1759-1778 - Noah Bertram, Alex Levinson, Justin Hsu:
Cutting the Cake: A Language for Fair Division. 1779-1800 - Bastien Lecoeur, Hasan Mohsin, Alastair F. Donaldson:
Program Reconditioning: Avoiding Undefined Behaviour When Finding and Reducing Compiler Bugs. 1801-1825 - Vsevolod Livinskii, Dmitry Babokin, John Regehr:
Fuzzing Loop Optimizations in Compilers for C++ and Data-Parallel Languages. 1826-1847 - Roland Meyer, Thomas Wies, Sebastian Wolff:
Embedding Hindsight Reasoning in Separation Logic. 1848-1871 - Sung-Hwan Lee, Minki Cho, Roy Margalit, Chung-Kil Hur, Ori Lahav:
Putting Weak Memory in Order via a Promising Intermediate Representation. 1872-1895 - Jingbo Wang, Aarti Gupta, Chao Wang:
Synthesizing MILP Constraints for Efficient and Robust Optimization. 1896-1919 - Shubham Ugare, Debangshu Banerjee, Sasa Misailovic, Gagandeep Singh:
Incremental Verification of Neural Networks. 1920-1945 - Luca Beurer-Kellner, Marc Fischer, Martin T. Vechev:
Prompting Is Programming: A Query Language for Large Language Models. 1946-1969 - Tom Yuviler, Dana Drachsler-Cohen:
One Pixel Adversarial Attacks via Sketched Programs. 1970-1994 - Lucas Wilkinson, Kazem Cheshmi, Maryam Mehri Dehnavi:
Register Tiling for Unstructured Sparsity in Neural Network Inference. 1995-2020
Volume 7, Number ICFP, August 2023
- Kazutaka Matsuda, Samantha Frohlich, Meng Wang, Nicolas Wu:
Embedding by Unembedding. 1-47 - Hiroyuki Katsura, Naoki Kobayashi, Ryosuke Sato:
Higher-Order Property-Directed Reachability. 48-77 - Simon Fowler, Duncan Paul Attard, Franciszek Sowul, Simon J. Gay, Phil Trinder:
Special Delivery: Programming with Mailbox Types. 78-107 - Thomas Bourgeat, Ian Clester, Andres Erbsen, Samuel Gruetter, Pratap Singh, Andy Wright, Adam Chlipala:
Flexible Instruction-Set Semantics via Abstract Monads (Experience Report). 108-124 - Mahsa Varshosaz, Mohsen Ghaffari, Einar Broch Johnsen, Andrzej Wasowski:
Formal Specification and Testing for Reinforcement Learning. 125-158 - Lukas Lazarek, Ben Greenman, Matthias Felleisen, Christos Dimoulas:
How to Evaluate Blame for Gradual Types, Part 2. 159-186 - Jad Elkhaleq Ghalayini, Neel Krishnaswami:
Explicit Refinement Types. 187-214 - Giuseppe Castagna:
Typing Records, Maps, and Structs. 215-258 - Nada Amin, John Burnham, François Garillot, Rosario Gennaro, Chhi'mèd Künzang, Daniel Rogozin, Cameron Wong:
LURK: Lambda, the Ultimate Recursive Knowledge (Experience Report). 259-274 - Anton Lorenzen, Daan Leijen, Wouter Swierstra:
FP²: Fully in-Place Functional Programming. 275-304 - Ryan G. Scott, Mike Dodds, Ivan Perez, Alwyn E. Goodloe, Robert Dockins:
Trustworthy Runtime Verification via Bisimulation (Experience Report). 305-321 - Harrison Goldstein, Samantha Frohlich, Meng Wang, Benjamin C. Pierce:
Reflecting on Random Generation. 322-355 - Alex Hubers, J. Garrett Morris:
Generic Programming with Extensible Data Types: Or, Making Ad Hoc Extensible Data Types Less Ad Hoc. 356-384 - Son Ho, Aymeric Fromherz, Jonathan Protzenko:
Modularity, Code Specialization, and Zero-Cost Abstractions for Program Verification. 385-416 - Lennart Augustsson, Joachim Breitner, Koen Claessen, Ranjit Jhala, Simon Peyton Jones, Olin Shivers, Guy L. Steele Jr., Tim Sweeney:
The Verse Calculus: A Core Calculus for Deterministic Functional Logic Programming. 417-447 - Matthew Lutze, Magnus Madsen, Philipp Schuster, Jonathan Immanuel Brachthäuser:
With or Without You: Programming with Effect Exclusion. 448-475 - Patrick Bahr, Rasmus Ejlers Møgelberg:
Asynchronous Modal FRP. 476-510 - Filip Sieczkowski, Mateusz Pyzik, Dariusz Biernacki:
A General Fine-Grained Reduction Theory for Effect Handlers. 511-540 - Gan Shen, Shun Kashiwa, Lindsey Kuper:
HasChor: Functional Choreographic Programming for All (Functional Pearl). 541-565 - Zhixuan Yang, Nicolas Wu:
Modular Models of Monoids with Operations. 566-603 - Ningning Xie, Leo White, Olivier Nicole, Jeremy Yallop:
MacoCaml: Staging Composable and Compilable Macros. 604-648 - Yiyun Liu, Stephanie Weirich:
Dependently-Typed Programming with Logical Equality Reflection. 649-685 - Joachim Breitner:
More Fixpoints! (Functional Pearl). 686-710 - Peter Thiemann:
Intrinsically Typed Sessions with Callbacks (Functional Pearl). 711-739 - Patrick Bahr, Graham Hutton:
Calculating Compilers for Concurrency. 740-767 - Jules Jacobs, Jonas Kastberg Hinrichsen, Robbert Krebbers:
Dependent Session Protocols in Separation Logic from First Principles (Functional Pearl). 768-795 - Kuang-Chen Lu, Shriram Krishnamurthi, Kathi Fisler, Ethel Tshukudu:
What Happens When Students Switch (Functional) Languages (Experience Report). 796-812 - Thaïs Baudon, Gabriel Radanne, Laure Gonnord:
Bit-Stealing Made Legal: Compilation for Custom Memory Representations of Algebraic Data Types. 813-846 - Léon Gondelman, Jonas Kastberg Hinrichsen, Mário Pereira, Amin Timany, Lars Birkedal:
Verifying Reliable Network Components in a Distributed Separation Logic with Dependent Separation Protocols. 847-877 - Jessica Shi, Alperen Keles, Harrison Goldstein, Benjamin C. Pierce, Leonidas Lampropoulos:
Etna: An Evaluation Platform for Property-Based Testing (Experience Report). 878-894 - Conal Elliott:
Timely Computation. 895-919 - Andreas Abel, Nils Anders Danielsson, Oskar Eriksson:
A Graded Modal Dependent Type Theory with a Universe and Erasure, Formalized. 920-954 - Sven Keidel, Sebastian Erdweg, Tobias Hombücher:
Combinator-Based Fixpoint Algorithms for Big-Step Abstract Interpreters. 955-981
Volume 7, Number OOPSLA2, October 2023
- Pu Yi, Sara Achour:
Hardware-Aware Static Optimization of Hyperdimensional Computations. 1-30 - Travis Hance, Jon Howell, Oded Padon, Bryan Parno:
Leaf: Modularity for Temporary Sharing in Separation Logic. 31-58 - Léo Gourdin, Benjamin Bonneau, Sylvain Boulmé, David Monniaux, Alexandre Bérard:
Formally Verifying Optimizations with Block Simulations. 59-88 - Yican Sun, Xuanyu Peng, Yingfei Xiong:
Synthesizing Efficient Memoization Algorithms. 89-115 - Hervé Paulino, Ana Almeida Matos, Jan Cederquist, Marco Giunti, João Matos, António Ravara:
AtomiS: Data-Centric Synchronization Made Practical. 116-145 - Thierry Renaux, Sam Van den Vonder, Wolfgang De Meuter:
Secure RDTs: Enforcing Access Control Policies for Offline Available JSON Data. 146-172 - Girish Mururu, Sharjeel Khan, Bodhisatwa Chatterjee, Chao Chen, Chris Porter, Ada Gavrilovska, Santosh Pande:
Beacons: An End-to-End Compiler Framework for Predicting and Utilizing Dynamic Loop Characteristics. 173-203 - Mahdi Ghorbani, Mathieu Huot, Shideh Hashemian, Amir Shaikhha:
Compiling Structured Tensor Algebra. 204-233 - Qinlin Chen, Nairen Zhang, Jinpeng Wang, Tian Tan, Chang Xu, Xiaoxing Ma, Yue Li:
The Essence of Verilog: A Tractable and Tested Operational Semantics for Verilog. 234-263 - Chengcheng Wan, Yuhan Liu, Kuntai Du, Henry Hoffmann, Junchen Jiang, Michael Maire, Shan Lu:
Run-Time Prevention of Software Integration Failures of Machine Learning APIs. 264-291 - Giovanna Kobus Conrado, Amir Kafshdar Goharshady, Chun Kit Lam:
The Bounded Pathwidth of Control-Flow Graphs. 292-317 - Octave Larose, Sophie Kaleba, Humphrey Burchell, Stefan Marr:
AST vs. Bytecode: Interpreters in the Age of Meta-Compilation. 318-346 - Andreas Rossberg:
Mutually Iso-Recursive Subtyping. 347-373 - Chuta Sano, Ryan Kavanagh, Brigitte Pientka:
Mechanizing Session-Types using a Structural View: Enforcing Linearity without Linearity. 374-399 - Oliver Bracevac, Guannan Wei, Songlin Jia, Supun Abeysinghe, Yuxuan Jiang, Yuyan Bao, Tiark Rompf:
Graph IRs for Impure Higher-Order Languages: Making Aggressive Optimizations Affordable with Precise Effect Dependencies. 400-430 - Ishan Bhanuka, Lionel Parreaux, David Binder, Jonathan Immanuel Brachthäuser:
Getting into the Flow: Towards Better Type Error Messages for Constraint-Based Type Inference. 431-459 - Luna Phipps-Costin, Andreas Rossberg, Arjun Guha, Daan Leijen, Daniel Hillerström, K. C. Sivaramakrishnan, Matija Pretnar, Sam Lindley:
Continuing WebAssembly with Effect Handlers. 460-485 - Shangwen Wang, Bo Lin, Zhensu Sun, Ming Wen, Yepang Liu, Yan Lei, Xiaoguang Mao:
Two Birds with One Stone: Boosting Code Generation and Code Search via a Generative Adversarial Network. 486-515 - Magnus Madsen, Jaco van de Pol, Troels Henriksen:
Fast and Efficient Boolean Unification for Hindley-Milner-Style Type and Effect Systems. 516-543 - Ben Greenman, Matthias Felleisen, Christos Dimoulas:
How Profilers Can Help Navigate Type Migration. 544-573 - Matthew Flatt, Taylor Allred, Nia Angle, Stephen De Gabrielle, Robert Bruce Findler, Jack Firth, Kiran Gopinathan, Ben Greenman, Siddhartha Kasivajhula, Alex Knauth, Jay McCarthy, Sam Phillips, Sorawee Porncharoenwase, Jens Axel Søgaard, Sam Tobin-Hochstadt:
Rhombus: A New Spin on Macros without All the Parentheses. 574-603 - Chijin Zhou, Quan Zhang, Lihua Guo, Mingzhe Wang, Yu Jiang, Qing Liao, Zhiyong Wu, Shanshan Li, Bin Gu:
Towards Better Semantics Exploration for Browser Fuzzing. 604-631 - Simon Friis Vindum, Lars Birkedal:
Spirea: A Mechanized Concurrent Separation Logic for Weak Persistent Memory. 632-657 - Sewen Thy, Andreea Costea, Kiran Gopinathan, Ilya Sergey:
Adventure of a Lifetime: Extract Method Refactoring for Rust. 658-685 - Huanqi Cao, Shizhi Tang, Qianchao Zhu, Bowen Yu, Wenguang Chen:
Mat2Stencil: A Modular Matrix-Based DSL for Explicit and Implicit Matrix-Free PDE Solvers on Structured Grid. 686-715 - Armaël Guéneau, Johannes Hostert, Simon Spies, Michael Sammler, Lars Birkedal, Derek Dreyer:
Melocoton: A Program Logic for Verified Interoperability Between OCaml and C. 716-744 - André Pacak, Sebastian Erdweg:
Interactive Debugging of Datalog Programs. 745-772 - Fangke Ye, Jisheng Zhao, Jun Shirako, Vivek Sarkar:
Concrete Type Inference for Code Optimization using Machine Learning with SMT Solving. 773-800 - Yu Wang, Ke Wang, Linzhang Wang:
An Explanation Method for Models of Code. 801-827 - Jaehwang Jung, Janggun Lee, Jaemin Choi, Jaewoo Kim, Sunho Park, Jeehoon Kang:
Modular Verification of Safe Memory Reclamation in Concurrent Separation Logic. 828-856 - Edward Lee, Ondrej Lhoták:
Simple Reference Immutability for System F. 857-881 - Zhuo Cai, Soroush Farokhnia, Amir Kafshdar Goharshady, S. Hitarth:
Asparagus: Automated Synthesis of Parametric Gas Upper-Bounds for Smart Contracts. 882-911 - John K. Feser, Isil Dillig, Armando Solar-Lezama:
Inductive Program Synthesis Guided by Observational Program Similarity. 912-940 - Marius Müller, Philipp Schuster, Jonathan Lindegaard Starup, Klaus Ostermann, Jonathan Immanuel Brachthäuser:
From Capabilities to Regions: Enabling Efficient Compilation of Lexical Effect Handlers. 941-970 - Dongjie He, Yujiang Gui, Wei Li, Yonggang Tao, Changwei Zou, Yulei Sui, Jingling Xue:
A Container-Usage-Pattern-Based Context Debloating Approach for Object-Sensitive Pointer Analysis. 971-1000 - Yuandao Cai, Charles Zhang:
A Cocktail Approach to Practical Call Graph Construction. 1001-1033 - Anjali Pal, Brett Saiki, Ryan Tjoa, Cynthia Richey, Amy Zhu, Oliver Flatt, Max Willsey, Zachary Tatlock, Chandrakana Nandi:
Equality Saturation Theory Exploration à la Carte. 1034-1062 - Adithya Murali, Lucas Peña, Ranjit Jhala, P. Madhusudan:
Complete First-Order Reasoning for Properties of Functional Programs. 1063-1092 - Wenhao Tang, Daniel Hillerström, James McKinna, Michel Steuwer, Ornela Dardha, Rongxiao Fu, Sam Lindley:
Structural Subtyping as Parametric Polymorphism. 1093-1121 - Sorawee Porncharoenwase, Justin Pombrio, Emina Torlak:
A Pretty Expressive Printer. 1122-1149 - Jiangyi Liu, Fengmin Zhu, Fei He:
Automated Ambiguity Detection in Layout-Sensitive Grammars. 1150-1175 - Meetesh Kalpesh Mehta, Sebastián Krynski, Hugo Musso Gualandi, Manas Thakur, Jan Vitek:
Reusing Just-in-Time Compiled Code. 1176-1197 - Arash Sahebolamri, Langston Barrett, Scott Moore, Kristopher K. Micinski:
Bring Your Own Data Structures to Datalog. 1198-1223 - Will Crichton, Gavin Gray, Shriram Krishnamurthi:
A Grounded Conceptual Model for Ownership Types in Rust. 1224-1252 - Quan Zhang, Chijin Zhou, Yiwen Xu, Zijing Yin, Mingzhe Wang, Zhuo Su, Chengnian Sun, Yu Jiang, Jia-Guang Sun:
Building Dynamic System Call Sandbox with Partial Order Analysis. 1253-1280 - Riccardo Bianchini, Francesco Dagnino, Paola Giannini, Elena Zucca:
Resource-Aware Soundness for Big-Step Semantics. 1281-1309 - Fengyun Liu, Ondrej Lhoták, David Hua, Enze Xing:
Initializing Global Objects: Time and Order. 1310-1337 - Anshuman Mohan, Yunhe Liu, Nate Foster, Tobias Kappé, Dexter Kozen:
Formal Abstractions for Packet Scheduling. 1338-1362 - Ellen Arvidsson, Elias Castegren, Sylvan Clebsch, Sophia Drossopoulou, James Noble, Matthew J. Parkinson, Tobias Wrigstad:
Reference Capabilities for Flexible Memory Management. 1363-1393 - Aalok Thakkar, Nathaniel Sands, George Petrou, Rajeev Alur, Mayur Naik, Mukund Raghothaman:
Mobius: Synthesizing Relational Queries with Recursive and Invented Predicates. 1394-1417 - Jin Zhou, Sam Silvestro, Steven (Jiaxun) Tang, Hanmei Yang, Hongyu Liu, Guangming Zeng, Bo Wu, Cong Liu, Tongping Liu:
MemPerf: Profiling Allocator-Induced Performance Slowdowns. 1418-1441 - Kirby Linvill, Gowtham Kaki, Eric Wustrow:
Verifying Indistinguishability of Privacy-Preserving Protocols. 1442-1469 - Cong Ma, Dinghao Wu, Gang Tan, Mahmut Taylan Kandemir, Danfeng Zhang:
Quantifying and Mitigating Cache Side Channel Leakage with Differential Set. 1470-1498 - Lisa Rennels, Sarah E. Chasins:
How Domain Experts Use an Embedded DSL. 1499-1530 - Luke Cheeseman, Matthew J. Parkinson, Sylvan Clebsch, Marios Kogias, Sophia Drossopoulou, David Chisnall, Tobias Wrigstad, Paul Liétar:
When Concurrency Matters: Behaviour-Oriented Concurrency. 1531-1560 - Matt D'Souza, James You, Ondrej Lhoták, Aleksandar Prokopec:
TASTyTruffle: Just-in-Time Specialization of Parametric Polymorphism. 1561-1588 - Grant Iraci, Cheng-En Chuang, Raymond Hu, Lukasz Ziarek:
Validating IoT Devices with Rate-Based Session Types. 1589-1617 - Thomas Haas, René Pascasl Maseli, Roland Meyer, Hernán Ponce de León:
Static Analysis of Memory Models for SMT Encodings. 1618-1647 - Alex Renda, Yi Ding, Michael Carbin:
Turaco: Complexity-Guided Data Sampling for Training Neural Surrogates of Programs. 1648-1676 - Minki Cho, Youngju Song, Dongjae Lee, Lennard Gäher, Derek Dreyer:
Stuttering for Free. 1677-1704 - Narges Shadab, Pritam M. Gharat, Shrey Tiwari, Michael D. Ernst, Martin Kellogg, Shuvendu K. Lahiri, Akash Lal, Manu Sridharan:
Inference of Resource Management Specifications. 1705-1728 - Khushboo Chitre, Piyus Kedia, Rahul Purandare:
Rapid: Region-Based Pointer Disambiguation. 1729-1757 - Max S. New, Eric Giovannini, Daniel R. Licata:
Gradual Typing for Effect Handlers. 1758-1786 - Kanghee Park, Loris D'Antoni, Thomas W. Reps:
Synthesizing Specifications. 1787-1816 - Pengfei Gao, Yedi Zhang, Fu Song, Taolue Chen, François-Xavier Standaert:
Compositional Verification of Efficient Masking Countermeasures against Side-Channel Attacks. 1817-1847 - Qiaochu Chen, Arko Banerjee, Çagatay Demiralp, Greg Durrett, Isil Dillig:
Data Extraction via Semantic Regular Expression Synthesis. 1848-1877 - Orr Tamir, Marcelo Taube, Kenneth L. McMillan, Sharon Shoham, Jon Howell, Guy Gueta, Mooly Sagiv:
Counterexample Driven Quantifier Instantiations with Applications to Distributed Protocols. 1878-1904 - Shawn Meier, Sergio Mover, Gowtham Kaki, Bor-Yuh Evan Chang:
Historia: Refuting Callback Reachability with Message-History Logics. 1905-1934 - Jens Kanstrup Larsen, Roberto Guanciale, Philipp Haller, Alceste Scalas:
P4R-Type: A Verified API for P4 Control Plane Programs. 1935-1963 - Jacob Laurel, Siyuan Brant Qian, Gagandeep Singh, Sasa Misailovic:
Synthesizing Precise Static Analyzers for Automatic Differentiation. 1964-1992 - Giovanna Kobus Conrado, Amir Kafshdar Goharshady, Kerim Kochekov, Yun Chen Tsai, Ahmed Khaled Zaher:
Exploiting the Sparseness of Control-Flow and Call Graphs for Efficient and On-Demand Algebraic Program Analysis. 1993-2022 - Anders Miltner, Devon Loehr, Arnold Mong, Kathleen Fisher, David Walker:
Saggitarius: A DSL for Specifying Grammatical Domains. 2023-2051 - Philipp Schröer, Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
A Deductive Verification Infrastructure for Probabilistic Programs. 2052-2082 - Chen Cui, Shengyi Jiang, Bruno C. d. S. Oliveira:
Greedy Implicit Bounded Quantification. 2083-2111 - Yu-Fang Chen, David Chocholatý, Vojtech Havlena, Lukás Holík, Ondrej Lengál, Juraj Síc:
Solving String Constraints with Lengths by Stabilization. 2112-2141 - George Zakhour, Pascal Weisenburger, Guido Salvaneschi:
Type-Safe Dynamic Placement with First-Class Placed Values. 2142-2170 - Amirmohammad Nazari, Yifei Huang, Roopsha Samanta, Arjun Radhakrishna, Mukund Raghothaman:
Explainable Program Synthesis by Localizing Specifications. 2171-2195 - Angello Astorga, Chiao Hsieh, P. Madhusudan, Sayan Mitra:
Perception Contracts for Safety of ML-Enabled Systems. 2196-2223 - Federico Mora, Ankush Desai, Elizabeth Polgreen, Sanjit A. Seshia:
Message Chains for Distributed System Verification. 2224-2250
a service of
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 2023-12-08 23:01 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: