SOAP 2025 – Proceedings

14th ACM SIGPLAN International Workshop on the State Of the Art in Program Analysis (SOAP 2025)

Frontmatter

Papers

Beyond Affine Loops: A Geometric Approach to Program Synthesis
Erdenebayar Bayarmagnai, Fatemeh Mohammadi, and Rémi Prébet
(KU Leuven, Belgium; Inria, France)

Publisher's Version Article: pldiws25soapmain-p11-p (type: Full Paper) doi:10.1145/3735544.3735581

Beyond Affine Loops: A Geometric Approach to Program Synthesis (Video): Video of conference presentation

Optimizing Type Migration for LLM-Based C-to-Rust Translation: A Data Flow Graph Approach
Qingxiao Xu and Jeff Huang
(Texas A&M University, USA)

Publisher's Version Article: pldiws25soapmain-p13-p (type: Full Paper) doi:10.1145/3735544.3735582

	Appendix: The appendix includes supplementary materials covering linked list structures, data flow graphs, analysis of mutable borrowing solutions, prompt templates, and insights from manual translation.
	Optimizing Type Migration for LLM-Based C-to-Rust Translation: A Data Flow Graph Approach (Video): Video of conference presentation

Compositional Static Callgraph Reachability Analysis for WhatsApp Android App Health
Ákos Hajdu, Roman Lee, Gavin Weng, Nilesh Agrawal, and Jérémy Dubreil
(Meta, UK; Meta, Canada; Meta, USA; Unaffiliated, France)

Publisher's Version Article: pldiws25soapmain-p27-p (type: Full Paper) doi:10.1145/3735544.3735583

Compositional Static Callgraph Reachability Analysis for WhatsApp Android App Health (Video): Video of conference presentation

Towards Bit-Level Dominance Preserving Quantization of Neural Classifiers
Dorra Ben Khalifa and Matthieu Martel
(ENAC - University of Toulouse, France; University of Peprignan, France; Numalis, France)

Publisher's Version Article: pldiws25soapmain-p66-p (type: Full Paper) doi:10.1145/3735544.3735584

Towards Bit-Level Dominance Preserving Quantization of Neural Classifiers (Video): Video of conference presentation

Universal High-Performance CFL-Reachability via Matrix Multiplication
Ilia Muravev and Semyon Grigorev
(Saint-Petersburg State University, Russia)

Publisher's Version Published Artifact Artifacts Available Article: pldiws25soapmain-p84-p (type: Full Paper) doi:10.1145/3735544.3735585

Universal High-Performance CFL-Reachability via Matrix Multiplication (Video): Video of conference presentation

Artifact of "Universal High-Performance CFL-Reachability via Matrix Multiplication" (doi:10.5281/zenodo.15324265): This artifact is provided to reproduce the main results of the SOAP 2025 paper "Universal High-Performance CFL-Reachability via Matrix Multiplication" by Ilia Muravev and Semyon Grigorev. The artifact comprises a Docker image with six CFL-reachability solver implementations---FastMatrixCFPQ, MatrixCFPQ, PEARL, POCR, ...

Scalable Language Agnostic Taint Tracking using Explicit Data Dependencies
Sedick David Baker Effendi, Xavier Pinho, Andrei Michael Dreyer, and Fabian Yamaguchi
(Stellenbosch University, South Africa; StackGen, USA; Whirly Labs, South Africa)

Publisher's Version Article: pldiws25soapmain-p86-p (type: Full Paper) doi:10.1145/3735544.3735586

Scalable Language Agnostic Taint Tracking using Explicit Data Dependencies (Video): Video of conference presentation

Supplementary Material for Paper: Scalable Language Agnostic Taint Tracking using Explicit Data Dependencies: This document contains supplementary appendices for the main paper titled \emph{Scalable Language Agnostic Taint Tracking using Explicit Data Dependencies}, submitted to \emph{Proceedings of the 14th ACM SIGPLAN International Workshop on the State Of the Art in Program Analysis (SOAP '25)}. The appendices include ...

Pick Your Call Graphs Well: On Scaling IFDS-Based Data-Flow Analyses
Kadiray Karakaya, Palaniappan Muthuraman, and Eric Bodden
(Heinz Nixdorf Institute at Paderborn University, Germany; Fraunhofer IEM, Germany)

Publisher's Version Article: pldiws25soapmain-p95-p (type: Full Paper) doi:10.1145/3735544.3735587

Pick Your Call Graphs Well: On Scaling IFDS-Based Data-Flow Analyses (Video): Video of conference presentation

proc time: 0.02