Popl 25 Automated Program Refinement

Media Summary: RELINCHE: Automatically Checking Linearizability under Relaxed Memory Consistency (Video, Flexible Type-Based Resource Estimation in Quantum Circuit Description Languages (Video, Model Checking C/C++ with Mixed-Size Accesses (Video,

Popl 25 Automated Program Refinement - Detailed Analysis & Overview

RELINCHE: Automatically Checking Linearizability under Relaxed Memory Consistency (Video, Flexible Type-Based Resource Estimation in Quantum Circuit Description Languages (Video, Model Checking C/C++ with Mixed-Size Accesses (Video, The Best of Abstract Interpretations (Video, Maximal Simplification of Polyhedral Reductions (Video,

Photo Gallery

[POPL'25] Automated Program Refinement: Guide and Verify Code Large Language Model with(…)

[POPL'24] Answer Refinement Modification: Refinement Type System for Algebraic Effects and...

[POPL'25] RELINCHE: Automatically Checking Linearizability under Relaxed Memory Consistency

[POPL'25] Invited Talk: Finding Good Programs by Avoiding Bad Ones

[POPL'25] Generically Automating Separation Logic by Functors, Homomorphisms, and Modules

[POPL'26] Medium-scale automation for proof assistants

[POPL'24] Mechanizing Refinement Types

[POPL'25] Flexible Type-Based Resource Estimation in Quantum Circuit Description Languages

[POPL'25] A Dependent Type Theory for Meta-programming with Intensional Analysis

[POPL'25] Finite-Choice Logic Programming

[POPL'25] Model Checking C/C++ with Mixed-Size Accesses

[POPL'25] The Best of Abstract Interpretations

View Detailed Profile

[POPL'25] Automated Program Refinement: Guide and Verify Code Large Language Model with(…)

[POPL'25] Automated Program Refinement: Guide and Verify Code Large Language Model with(…)

Automated Program Refinement

[POPL'24] Answer Refinement Modification: Refinement Type System for Algebraic Effects and...

[POPL'24] Answer Refinement Modification: Refinement Type System for Algebraic Effects and...

Answer

[POPL'25] RELINCHE: Automatically Checking Linearizability under Relaxed Memory Consistency

[POPL'25] RELINCHE: Automatically Checking Linearizability under Relaxed Memory Consistency

RELINCHE: Automatically Checking Linearizability under Relaxed Memory Consistency (Video,

[POPL'25] Invited Talk: Finding Good Programs by Avoiding Bad Ones

[POPL'25] Invited Talk: Finding Good Programs by Avoiding Bad Ones

Invited Talk: Finding Good

[POPL'25] Generically Automating Separation Logic by Functors, Homomorphisms, and Modules

[POPL'25] Generically Automating Separation Logic by Functors, Homomorphisms, and Modules

Generically

[POPL'26] Medium-scale automation for proof assistants

[POPL'26] Medium-scale automation for proof assistants

Medium-scale

[POPL'24] Mechanizing Refinement Types

[POPL'24] Mechanizing Refinement Types

Mechanizing

[POPL'25] Flexible Type-Based Resource Estimation in Quantum Circuit Description Languages

[POPL'25] Flexible Type-Based Resource Estimation in Quantum Circuit Description Languages

Flexible Type-Based Resource Estimation in Quantum Circuit Description Languages (Video,

[POPL'25] A Dependent Type Theory for Meta-programming with Intensional Analysis

[POPL'25] A Dependent Type Theory for Meta-programming with Intensional Analysis

A Dependent Type Theory for Meta-

[POPL'25] Finite-Choice Logic Programming

[POPL'25] Finite-Choice Logic Programming

Finite-Choice Logic

[POPL'25] Model Checking C/C++ with Mixed-Size Accesses

[POPL'25] Model Checking C/C++ with Mixed-Size Accesses

Model Checking C/C++ with Mixed-Size Accesses (Video,

[POPL'25] The Best of Abstract Interpretations

[POPL'25] The Best of Abstract Interpretations

The Best of Abstract Interpretations (Video,

[POPL'25] Maximal Simplification of Polyhedral Reductions

[POPL'25] Maximal Simplification of Polyhedral Reductions

Maximal Simplification of Polyhedral Reductions (Video,