[TPSA'25] Compositional Shape Analysis with Shared Abduction and Biabductive Loop Acceleration(…)
Автор: ACM SIGPLAN
Загружено: 2025-05-03
Просмотров: 33
Описание:
Compositional Shape Analysis with Shared Abduction and Biabductive Loop Acceleration (Extended Abstract) (Video, Theory and Practice of Static Analysis)
Florian Sextl, Adam Rogalewicz, Tomáš Vojnar, and Florian Zuleger
(TU Wien, Austria; Brno University of Technology, Czechia; Brno University of Technology; TU Vienna)
Abstract: Biabduction-based shape analysis verifies memory safety of open programs in an efficient compositional way and is applicable even for code fragments without a need for modelling their environment. Nevertheless, the technique suffers from two fundamental problems that were already described upon its introduction by Calcagno et al. (2009), namely dealing with unsound abduction results in indeterminately branching code and with unsound over-approximation within loop acceleration. Together, these problems facilitate the need for a second analysis phase to filter out unsound pre-conditions. In contrast, we introduce novel techniques that overcome the two problems and compute sound analysis results within a single analysis phase.
Presentation at the Theory and Practice of Static Analysis workshop, January 21, 2025, https://popl25.sigplan.org/home/tpsa-...
Sponsored by ACM SIGPLAN
Повторяем попытку...
![[TPSA'25] Compositional Shape Analysis with Shared Abduction and Biabductive Loop Acceleration(…)](https://imager.clipsaver.ru/IYU6RbxpPMI/max.jpg)
Доступные форматы для скачивания:
Скачать видео
-
Информация по загрузке:
![[TPSA'25] Enhancing Infer Compositional Analysis with Summary Specialization](https://imager.clipsaver.ru/kiZlGF5x1Bs/max.jpg)
![[TPSA'25] Total Outcome Logic: Termination and Nontermination Proving for Effectful Branching](https://imager.clipsaver.ru/FM-oAcTwD_E/max.jpg)
![[CPP'26] Specification, Semantics, and Verification of Quantum Programs](https://imager.clipsaver.ru/BeDG46EAgjE/max.jpg)
![[CPP'26] A Recipe for Modular Verification of Generic Tree Traversals](https://imager.clipsaver.ru/GBSGXYngWcg/max.jpg)
![[CPP'26] Can we formalise type theory intrinsically without any compromise? A case study in(…)](https://imager.clipsaver.ru/Xn3M5Y71lrI/max.jpg)
