Abstract is missing.
- Fast and Efficient Bit-Level Precision TuningAssalé Adjé, Dorra Ben Khalifa, Matthieu Martel. 1-24 [doi]
- Hash Consed Points-To SetsMohamad Barbar, Yulei Sui. 25-48 [doi]
- Backward Symbolic Execution with Loop FoldingMarek Chalupa, Jan Strejcek. 49-76 [doi]
- Accelerating Program Analyses in Datalog by Merging Library FactsYifan Chen, Chenyang Yang, Xin Zhang, Yingfei Xiong 0001, Hao Tang, Xiaoyin Wang, Lu Zhang 0023. 77-101 [doi]
- Static Analysis of Endian Portability by Abstract InterpretationDavid Delmas, Abdelraouf Ouadjaout, Antoine Miné. 102-123 [doi]
- Verified Functional Programming of an Abstract InterpreterLucas Franceschino, David Pichardie, Jean-Pierre Talpin. 124-143 [doi]
- Disjunctive Interval AnalysisGraeme Gange, Jorge A. Navas, Peter Schachte, Harald Søndergaard, Peter J. Stuckey. 144-165 [doi]
- Static Analysis of ReLU Neural Networks with Tropical PolyhedraEric Goubault, Sébastien Palumby, Sylvie Putot, Louis Rustenholz, Sriram Sankaranarayanan 0001. 166-190 [doi]
- Exploiting Verified Neural Networks via Floating Point Numerical ErrorKai Jia, Martin Rinard. 191-205 [doi]
- Verifying Low-Dimensional Input Neural Networks via Input QuantizationKai Jia, Martin Rinard. 206-214 [doi]
- Data Abstraction: A General Framework to Handle Program Verification of Data StructuresJulien Braine, Laure Gonnord, David Monniaux. 215-235 [doi]
- Toward Neural-Network-Guided Program Synthesis and VerificationNaoki Kobayashi 0001, Taro Sekiyama, Issei Sato, Hiroshi Unno 0001. 236-260 [doi]
- Selective Context-Sensitivity for k-CFA with CFL-ReachabilityJingbo Lu, Dongjie He, Jingling Xue. 261-285 [doi]
- Selectively-Amortized Resource BoundingTianhan Lu, Bor-Yuh Evan Chang, Ashutosh Trivedi 0001. 286-307 [doi]
- Reduced Products of Abstract Domains for Fairness Certification of Neural NetworksDenis Mazzucato, Caterina Urban. 308-322 [doi]
- A Multilanguage Static Analysis of Python Programs with Native C ExtensionsRaphaël Monat, Abdelraouf Ouadjaout, Antoine Miné. 323-345 [doi]
- Automated Verification of the Parallel Bellman-Ford AlgorithmMohsen Safari, Wytse Oortwijn, Marieke Huisman. 346-358 [doi]
- Improving Thread-Modular Abstract InterpretationMichael Schwarz 0007, Simmo Saan, Helmut Seidl, Kalmer Apinis, Julian Erhard, Vesal Vojdani. 359-383 [doi]
- Thread-Modular Analysis of Release-Acquire ConcurrencyDivyanjali Sharma, Subodh Sharma 0001. 384-404 [doi]
- Symbolic Automatic Relations and Their Applications to SMT and CHC SolvingTakumi Shimoda, Naoki Kobayashi 0001, Ken Sakayori, Ryosuke Sato. 405-428 [doi]
- Compositional Verification of Smart Contracts Through Communication AbstractionScott Wesley, Maria Christakis, Jorge A. Navas, Richard J. Trefler, Valentin Wüstholz, Arie Gurfinkel. 429-452 [doi]
- Automatic Synthesis of Data-Flow AnalyzersXuezheng Xu, Xudong Wang, Jingling Xue. 453-478 [doi]