POPL 2023
Sun 15 - Sat 21 January 2023 Boston, Massachusetts, United States
POPL 2023 (series) / Boston Park Plaza /

Room information: Square

VenueBoston Park Plaza
Room nameSquare
Room InformationNo extra information available
Program

You're viewing the program in a time zone which is different from your device's time zone change time zone

Fri 20 Jan

Displayed time zone: Eastern Time (US & Canada) change

09:00 - 10:15
Logic & Decidability IIPOPL at Square
Chair(s): Joost-Pieter Katoen RWTH Aachen University
09:00
25m
Talk
When Less Is More: Consequence-Finding in a Weak Theory of Arithmetic
POPL
Zachary Kincaid Princeton University, Nicolas Koh Princeton University, Shaowei Zhu Princeton University
DOI
09:25
25m
Talk
Higher-Order MSL Horn Constraints
POPL
Jerome Jochems University of Bristol, Eddie Jones University of Bristol, Steven Ramsay University of Bristol
DOI
09:50
25m
Talk
Fast Coalgebraic Bisimilarity Minimization
POPL
Jules Jacobs Radboud University Nijmegen, Thorsten Wissmann Radboud University Nijmegen
DOI Pre-print
10:45 - 12:00
Quantum ComputingPOPL at Square
Chair(s): Ugo Dal Lago University of Bologna; Inria
10:45
25m
Talk
Qunity: A Unified Language for Quantum and Classical Computing
POPL
Finn Voichick University of Maryland, Liyi Li University of Maryland, Robert Rand University of Chicago, Michael Hicks University of Maryland; Amazon
DOI Pre-print
11:10
25m
Talk
Proto-Quipper with Dynamic LiftingVirtual
POPL
Peng Fu Dalhousie University, Kohei Kishida University of Illinois at Urbana-Champaign, Neil Julien Ross Dalhousie University, Peter Selinger Dalhousie University
DOI
11:35
25m
Talk
CoqQ: Foundational Verification of Quantum ProgramsVirtual
POPL
Li Zhou MPI-SP; Institute of Software at Chinese Academy of Sciences, Gilles Barthe MPI-SP; IMDEA Software Institute, Pierre-Yves Strub Meta, Junyi Liu Institute of Software at Chinese Academy of Sciences; University of Chinese Academy of Sciences, Mingsheng Ying Institute of Software at Chinese Academy of Sciences; Tsinghua University
DOI
13:30 - 14:45
Logic ProgrammingPOPL at Square
Chair(s): Marco Patrignani University of Trento
13:30
25m
Talk
Modular Primal-Dual Fixpoint Logic Solving for Temporal VerificationDistinguished Paper
POPL
Hiroshi Unno University of Tsukuba; RIKEN AIP, Tachio Terauchi Waseda University, Yu Gu University of Tsukuba, Eric Koskinen Stevens Institute of Technology
DOI
13:55
25m
Talk
Optimal CHC Solving via Termination Proofs
POPL
Yu Gu University of Tsukuba, Takeshi Tsukada Chiba University, Hiroshi Unno University of Tsukuba; RIKEN AIP
DOI
14:20
25m
Talk
From SMT to ASP: Solver-Based Approaches to Solving Datalog Synthesis-as-Rule-Selection Problems
POPL
Aaron Bembenek Harvard University, Michael Greenberg Stevens Institute of Technology, Stephen Chong Harvard University
DOI Pre-print
15:10 - 16:25
Algorithmic VerificationPOPL at Square
Chair(s): Umang Mathur National University of Singapore
15:10
25m
Talk
The Fine-Grained Complexity of CFL Reachability
POPL
Paraschos Koutris University of Wisconsin-Madison, Shaleen Deep Microsoft
DOI
15:35
25m
Talk
Single-Source-Single-Target Interleaved-Dyck Reachability via Integer Linear Programming
POPL
Yuanbo Li Georgia Institute of Technology, Qirun Zhang Georgia Institute of Technology, Thomas Reps University of Wisconsin-Madison
DOI
16:00
25m
Talk
Context-Bounded Verification of Context-Free Specifications
POPL
Pascal Baumann MPI-SWS, Moses Ganardi MPI-SWS, Rupak Majumdar MPI-SWS, Ramanathan S. Thinniyam MPI-SWS, Georg Zetzsche MPI-SWS
DOI
16:45 - 18:00
Relational & Automated VerificationPOPL at Square
Chair(s): Christoph Matheja DTU
16:45
25m
Talk
An Algebra of Alignment for Relational Verification
POPL
Timos Antonopoulos Yale University, Eric Koskinen Stevens Institute of Technology, Ton Chanh Le Stevens Institute of Technology, Ramana Nagasamudram Stevens Institute of Technology, David Naumann Stevens Institute of Technology, Minh Ngo Stevens Institute of Technology
DOI
17:10
25m
Talk
Grisette: Symbolic Compilation as a Functional Programming Library
POPL
Sirui Lu University of Washington, Rastislav Bodík Google Research
DOI
17:35
25m
Talk
HFL(Z) Validity Checking for Automated Program Verification
POPL
Naoki Kobayashi University of Tokyo, Kento Tanahashi University of Tokyo, Ryosuke Sato University of Tokyo, Takeshi Tsukada Chiba University
DOI

Fri 20 Jan

Displayed time zone: Eastern Time (US & Canada) change

Room9:003010:003011:003012:003013:003014:003015:003016:003017:0030
Square

POPL

Logic & Decidability II

POPL

Quantum Computing

POPL

Logic Programming

POPL

Algorithmic Verification

POPL

Relational & Automated Verification

Fri 20 Jan

Displayed time zone: Eastern Time (US & Canada) change

Room9:0015304510:0015304511:0015304512:0015304513:0015304514:0015304515:0015304516:0015304517:00153045
Square
POPL
When Less Is More: Consequence-Finding in a Weak Theory of Arithmetic
09:00 - 09:25
POPL
Higher-Order MSL Horn Constraints
09:25 - 09:50
POPL
Fast Coalgebraic Bisimilarity Minimization
09:50 - 10:15
POPL
Qunity: A Unified Language for Quantum and Classical Computing
10:45 - 11:10
POPL Virtual
Proto-Quipper with Dynamic Lifting
11:10 - 11:35
POPL Virtual
CoqQ: Foundational Verification of Quantum Programs
11:35 - 12:00
POPL Distinguished Paper
Modular Primal-Dual Fixpoint Logic Solving for Temporal Verification
13:30 - 13:55
POPL
Optimal CHC Solving via Termination Proofs
13:55 - 14:20
POPL
From SMT to ASP: Solver-Based Approaches to Solving Datalog Synthesis-a ...
14:20 - 14:45
POPL
The Fine-Grained Complexity of CFL Reachability
15:10 - 15:35
POPL
Single-Source-Single-Target Interleaved-Dyck Reachability via Integer L ...
15:35 - 16:00
POPL
Context-Bounded Verification of Context-Free Specifications
16:00 - 16:25
POPL
An Algebra of Alignment for Relational Verification
16:45 - 17:10
POPL
Grisette: Symbolic Compilation as a Functional Programming Library
17:10 - 17:35
POPL
HFL(Z) Validity Checking for Automated Program Verification
17:35 - 18:00