Proc. ACM Program. Lang.

Keyphrases

Publications

volume 8, number POPL, 2024

Itsaka Rakotonirina, Gilles Barthe, Clara Schneidewind
Decision and Complexity of Dolev-Yao Hyperproperties. Proc. ACM Program. Lang. 8 (POPL) (2024)
Ugo Dal Lago, Alexis Ghyselen
On Model-Checking Higher-Order Effectful Programs. Proc. ACM Program. Lang. 8 (POPL) (2024)
John Peter Campora III, Mohammad Wahiduzzaman Khan, Sheng Chen
Type-Based Gradual Typing Performance Optimization. Proc. ACM Program. Lang. 8 (POPL) (2024)
Martin Elsman
Explicit Effects and Effect Constraints in ReML. Proc. ACM Program. Lang. 8 (POPL) (2024)
Azadeh Farzan, Umang Mathur
Coarser Equivalences for Causal Concurrency. Proc. ACM Program. Lang. 8 (POPL) (2024)
Jacques Carette, Chris Heunen, Robin Kaarsgaard, Amr Sabry
With a Few Square Roots, Quantum Computing Is as Easy as Pi. Proc. ACM Program. Lang. 8 (POPL) (2024)
Patrick Cousot
Calculational Design of [In]Correctness Transformational Program Logics by Abstract Interpretation. Proc. ACM Program. Lang. 8 (POPL) (2024)
Francesca Randone, Luca Bortolussi, Emilio Incerto, Mirco Tribastone
Inference of Probabilistic Programs with Moment-Matching Gaussian Mixtures. Proc. ACM Program. Lang. 8 (POPL) (2024)
Sam Westrick, Matthew Fluet, Mike Rainey, Umut A. Acar
Automatic Parallelism Management. Proc. ACM Program. Lang. 8 (POPL) (2024)
Konstantinos Mamouras, Agnishom Chattopadhyay
Efficient Matching of Regular Expressions with Lookaround Assertions. Proc. ACM Program. Lang. 8 (POPL) (2024)
Giuseppe Castagna, Mickaël Laurent, Kim Nguyen
Polymorphic Type Inference for Dynamic Languages. Proc. ACM Program. Lang. 8 (POPL) (2024)
Rupak Majumdar, V. R. Sathiyanarayana
Positive Almost-Sure Termination: Complexity and Proof Rules. Proc. ACM Program. Lang. 8 (POPL) (2024)
Thomas Koehler, Andrés Goens, Siddharth Bhat, Tobias Grosser, Phil Trinder, Michel Steuwer
Guided Equality Saturation. Proc. ACM Program. Lang. 8 (POPL) (2024)
Philippe Heim, Rayna Dimitrova
Solving Infinite-State Games via Acceleration. Proc. ACM Program. Lang. 8 (POPL) (2024)
Yanis Sellami, Guillaume Girol, Frédéric Recoules, Damien Couroussé, Sébastien Bardin
Inference of Robust Reachability Constraints. Proc. ACM Program. Lang. 8 (POPL) (2024)
Lionel Parreaux, Aleksander Boruch-Gruszecki, Andong Fan, Chun Yin Chau
When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism. Proc. ACM Program. Lang. 8 (POPL) (2024)
Eric Zhao, Raef Maroof, Anand Dukkipati, Andrew Blinn, Zhiyi Pan, Cyrus Omar
Total Type Error Localization and Recovery with Holes. Proc. ACM Program. Lang. 8 (POPL) (2024)
Yiyun Liu, Jonathan Chan, Jessica Shi, Stephanie Weirich
Internalizing Indistinguishability with Dependent Types. Proc. ACM Program. Lang. 8 (POPL) (2024)
Ian Briggs, Yash Lad, Pavel Panchekha
Implementation and Synthesis of Math Library Functions. Proc. ACM Program. Lang. 8 (POPL) (2024)
Donnacha Oisín Kidney, Zhixuan Yang, Nicolas Wu
Algebraic Effects Meet Hoare Logic in Cubical Agda. Proc. ACM Program. Lang. 8 (POPL) (2024)
Harrison Grodin, Yue Niu, Jonathan Sterling, Robert Harper
Decalf: A Directed, Effectful Cost-Aware Logical Framework. Proc. ACM Program. Lang. 8 (POPL) (2024)
Cezar-Constantin Andrici, Stefan Ciobaca, Catalin Hritcu, Guido Martínez, Exequiel Rivas, Éric Tanter, Théo Winterhalter
Securing Verified IO Programs Against Unverified Code in F. Proc. ACM Program. Lang. 8 (POPL) (2024)
Claudia Faggian, Daniele Pautasso, Gabriele Vanoni
Higher Order Bayesian Networks, Exactly. Proc. ACM Program. Lang. 8 (POPL) (2024)
Thodoris Sotiropoulos, Stefanos Chaliasos, Zhendong Su
API-Driven Program Synthesis for Testing Static Typing Implementations. Proc. ACM Program. Lang. 8 (POPL) (2024)
John Cyphert, Zachary Kincaid
Solvable Polynomial Ideals: The Ideal Reflection for Program Analysis. Proc. ACM Program. Lang. 8 (POPL) (2024)
Haowei Deng, Runzhou Tao, Yuxiang Peng, Xiaodi Wu
A Case for Synthesis of Recursive Quantum Unitary Programs. Proc. ACM Program. Lang. 8 (POPL) (2024)
Tom Smeding, Matthijs Vákár
Efficient CHAD. Proc. ACM Program. Lang. 8 (POPL) (2024)
Amin Timany, Simon Oddershede Gregersen, Léo Stefanesco, Jonas Kastberg Hinrichsen, Léon Gondelman, Abel Nieto, Lars Birkedal
Trillium: Higher-Order Concurrent and Distributed Separation Logic for Intensional Refinement. Proc. ACM Program. Lang. 8 (POPL) (2024)
Chih-Duo Hong, Anthony W. Lin
Regular Abstractions for Array Systems. Proc. ACM Program. Lang. 8 (POPL) (2024)
Xing Zhang, Ruifeng Xie, Guanchen Guo, Xiao He, Tao Zan, Zhenjiang Hu
Fusing Direct Manipulations into Functional Programs. Proc. ACM Program. Lang. 8 (POPL) (2024)
Steven Ramsay, Charlie Walpole
Ill-Typed Programs Don't Evaluate. Proc. ACM Program. Lang. 8 (POPL) (2024)
Yuantian Ding, Xiaokang Qiu
Enhanced Enumeration Techniques for Syntax-Guided Synthesis of Bit-Vector Manipulations. Proc. ACM Program. Lang. 8 (POPL) (2024)
Azadeh Farzan, Dominik Klumpp, Andreas Podelski
Commutativity Simplifies Proofs of Parameterized Programs. Proc. ACM Program. Lang. 8 (POPL) (2024)
Marco Campion, Mila Dalla Preda, Roberto Giacobazzi, Caterina Urban
Monotonicity and the Precision of Program Analysis. Proc. ACM Program. Lang. 8 (POPL) (2024)
Matthew Hague, Artur Jez, Anthony W. Lin
Parikh's Theorem Made Symbolic. Proc. ACM Program. Lang. 8 (POPL) (2024)
Lyes Attouche, Mohamed Amine Baazizi, Dario Colazzo, Giorgio Ghelli, Carlo Sartiani, Stefanie Scherzinger
Validation of Modern JSON Schema: Formalization and Complexity. Proc. ACM Program. Lang. 8 (POPL) (2024)
Pu Sun, Fu Song, Yuqi Chen, Taolue Chen
EasyBC: A Cryptography-Specific Language for Security Analysis of Block Ciphers against Differential Cryptanalysis. Proc. ACM Program. Lang. 8 (POPL) (2024)
Thorsten Altenkirch, Yorgo Chamoun, Ambrus Kaposi, Michael Shulman
Internal Parametricity, without an Interval. Proc. ACM Program. Lang. 8 (POPL) (2024)
Julian Müllner, Marcel Moosbrugger, Laura Kovács
Strong Invariants Are Hard: On the Hardness of Strongest Polynomial Invariants for (Probabilistic) Programs. Proc. ACM Program. Lang. 8 (POPL) (2024)
Mikolaj Bojanczyk, Bartek Klin
Polyregular Functions on Unordered Trees of Bounded Height. Proc. ACM Program. Lang. 8 (POPL) (2024)
Noah Patton, Kia Rahmani, Meghana Missula, Joydeep Biswas, Isil Dillig
Programming-by-Demonstration for Long-Horizon Robot Tasks. Proc. ACM Program. Lang. 8 (POPL) (2024)
Justin Frank, Benjamin Quiring, Leonidas Lampropoulos
Generating Well-Typed Terms That Are Not "Useless". Proc. ACM Program. Lang. 8 (POPL) (2024)
Wenhao Tang, Daniel Hillerström, Sam Lindley, J. Garrett Morris
Soundly Handling Linearity. Proc. ACM Program. Lang. 8 (POPL) (2024)
Andrei Popescu
Nominal Recursors as Epi-Recursors. Proc. ACM Program. Lang. 8 (POPL) (2024)
Will Crichton, Shriram Krishnamurthi
A Core Calculus for Documents: Or, Lambda: The Ultimate Document. Proc. ACM Program. Lang. 8 (POPL) (2024)
Nicolas Chataing, Stephen Dolan, Gabriel Scherer, Jeremy Yallop
Unboxed Data Constructors: Or, How cpp Decides a Halting Problem. Proc. ACM Program. Lang. 8 (POPL) (2024)
Fuga Kawamata, Hiroshi Unno, Taro Sekiyama, Tachio Terauchi
Answer Refinement Modification: Refinement Type System for Algebraic Effects and Handlers. Proc. ACM Program. Lang. 8 (POPL) (2024)
Supun Abeysinghe, Anxhelo Xhebraj, Tiark Rompf
Flan: An Expressive and Efficient Datalog Compiler for Program Analysis. Proc. ACM Program. Lang. 8 (POPL) (2024)
Shankaranarayanan Krishna, Aniket Lal, Andreas Pavlogiannis, Omkar Tuppe
On-the-Fly Static Analysis via Dynamic Bidirected Dyck Reachability. Proc. ACM Program. Lang. 8 (POPL) (2024)
Kevin Batz, Tom Jannik Biskup, Joost-Pieter Katoen, Tobias Winkler
Programmatic Strategy Synthesis: Resolving Nondeterminism in Probabilistic Programs. Proc. ACM Program. Lang. 8 (POPL) (2024)