TY - GEN
T1 - HaliVer: Deductive Verification and Scheduling Languages Join Forces
AU - Haak, Lars B. van den
AU - Wijs, Anton
AU - Huisman, Marieke
AU - Brand, Mark van den
N1 - Conference code: 30
PY - 2024/4/5
Y1 - 2024/4/5
N2 - 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 an 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.
AB - 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 an 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.
U2 - 10.1007/978-3-031-57256-2_4
DO - 10.1007/978-3-031-57256-2_4
M3 - Conference contribution
SN - 978-3-031-57255-5
SP - 71
EP - 89
BT - Tools and Algorithms for the Construction and Analysis of Systems
A2 - Finkbeiner, Bernd
A2 - Kovács, Laura
T2 - 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2024
Y2 - 6 April 2024 through 11 April 2024
ER -