ASE 2025
Sun 16 - Thu 20 November 2025 Seoul, South Korea

This program is tentative and subject to change.

Tue 18 Nov 2025 11:10 - 11:20 at Grand Hall 3 - Formal Method & Verification 2

MaxSAT solvers are increasingly used as back-ends in software engineering tools. Yet their results have lacked automatically checkable certificates of optimality. While SAT solvers emit DRAT proofs of (un)satisfiability, MaxSAT must additionally prove that no lower-cost solution exists. Existing approaches either cover only isolated solving paradigms or reduce MaxSAT reasoning to heavyweight pseudo-Boolean proofs, yielding impractical verification overhead. We present the first MaxSAT-specific proof-logging framework for core-guided OLL solvers. We formalize native inference rules for cores, cliques, hardenings, totalizer updates, and bound adjustments, and implement both a human-readable logger and a compact binary DAG logger in EvalMaxSAT. Evaluation on the 2024 MaxSAT competition dataset confirm the practicality and scalability of our certification pipeline, paving the way for trustworthy, solver use.

This program is tentative and subject to change.

Tue 18 Nov

Displayed time zone: Seoul change

11:00 - 12:30
Formal Method & Verification 2Research Papers at Grand Hall 3
11:00
10m
Talk
SMTgazer: Learning to Schedule SMT Algorithms via Bayesian Optimization
Research Papers
Chuan Luo Beihang University, Shaoke Cui Beihang University, Jianping Song Beihang University, Xindi Zhang State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, China, Wei Wu Central South University; Xiangjiang Laboratory, Chanjuan Liu Dalian University of Technology, Shaowei Cai Institute of Software at Chinese Academy of Sciences, Chunming Hu Beihang University
11:10
10m
Talk
Efficient and Verifiable Proof Logging for MaxSAT Solving
Research Papers
Raoul van Doren ETH Zurich, Timos Antonopoulos Yale University, Ruzica Piskac Yale University
11:20
10m
Talk
Destabilizing Neurons to Generate Challenging Neural Network Verification Benchmarks
Research Papers
Linhan Li , ThanhVu Nguyen George Mason University
11:30
10m
Talk
RELIA: Accelerating Analysis of Cloud Access Control Policies
Research Papers
Dan Wang Xi'an Jiaotong University, Peng Zhang Xi'an Jiaotong University, Zhenrong Gu Xi'an Jiaotong University, Weibo Lin Huawei Cloud, Shibiao Jiang Huawei Cloud, Zhu He Huawei Cloud, Xu Du Huawei Cloud, Longfei Chen Huawei Cloud, Jun Li Huawei, Xiaohong Guan Xi'an Jiaotong University
11:40
10m
Talk
Evolution-Aware Heuristics for GR(1) Realizability Checking
Research Papers
Dor Ma'ayan Tel Aviv University, Shahar Maoz Tel Aviv University, Jan Oliver Ringert Bauhaus-University Weimar
11:50
10m
Talk
Programmers’ Visual Attention on Function Call Graphs During Code Summarization
Research Papers
Samantha McLoughlin Vanderbilt University, Zachary Karas Vanderbilt University, Robert Wallace University of Notre Dame, Aakash Bansal Louisiana State University, Collin McMillan University of Notre Dame, Yu Huang Vanderbilt University
12:00
10m
Talk
LLM-Assisted Synthesis of High-Assurance C Programs
Research Papers
Prasita Mukherjee Purdue University, Minghai Lu Purdue University, Benjamin Delaware Purdue University
Pre-print
12:10
10m
Talk
Faster Runtime Verification during Testing via Feedback-Guided Selective Monitoring
Research Papers
Shinhae Kim Cornell University, Saikat Dutta Cornell University, Owolabi Legunsen Cornell University
12:20
10m
Talk
Uncovering Discrimination Clusters: Quantifying and Explaining Systematic Fairness Violations
Research Papers
Ranit Debnath Akash University of Illinois Chicago, Ashish Kumar Pennsylvania State University, Verya Monjezi University of Texas at El Paso, Ashutosh Trivedi University of Colorado Boulder, Gang (Gary) Tan Pennsylvania State University, Saeid Tizpaz-Niari University of Illinois Chicago