Abstract
The HaliVer tool integrates deductive verification into the popular scheduling language Halide, used for image processing pipelines and array computations. HaliVer uses Vercors, a separation logic-based verifier, to verify the correctness of (1) the Halide algorithms and (2) the optimised parallel code produced by \halide when an optimisation schedule is applied to the algorithm. This allows proving complex, optimised code correct while reducing the effort to provide the required verification annotations. For both approaches, the same specification is used. We evaluated the tool on several optimised programs generated from characteristic Halide algorithms, using all but one of the essential scheduling directives available in Halide. Without annotation effort, Haliver proves memory safety in almost all programs. With annotations Haliver, additionally, proves functional correctness properties. We show that the approach is viable and reduces the manual annotation effort by an order of magnitude.
| Original language | Undefined |
|---|---|
| Publisher | ArXiv.org |
| DOIs | |
| Publication status | Published - 19 Jan 2024 |
Keywords
- cs.LO
- cs.PL
Research output
- 1 Conference contribution
-
HaliVer: Deductive Verification and Scheduling Languages Join Forces
Haak, L. B. V. D., Wijs, A., Huisman, M. & Brand, M. V. D., 5 Apr 2024, Tools and Algorithms for the Construction and Analysis of Systems : 30th International Conference, TACAS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6–11, 2024, Proceedings. Finkbeiner, B. & Kovács, L. (eds.). p. 71-89 19 p.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review
Open AccessFile2 Link opens in a new tab Citations (Scopus)137 Downloads (Pure)
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver