dorsal/arxiv
View SchemaRelational Hoare Logic for High-Level Synthesis of Hardware Accelerators
| Authors | Izumi Tanaka, Ken Sakayori, Shinya Takamaeda-Yamazaki, Naoki Kobayashi |
|---|---|
| Categories | |
| ArXiv ID | 2601.09217vv2 |
| URL | https://arxiv.org/abs/2601.09217 |
| License | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ |
Abstract
High-level synthesis (HLS) is a powerful tool for developing efficient hardware accelerators that rely on specialized memory systems to achieve sufficient on-chip data reuse and off-chip bandwidth utilization. However, even with HLS, designing such systems still requires careful manual tuning, as automatic optimizations provided by existing tools are highly sensitive to programming style and often lack transparency. To address these issues, we present a formal translation framework based on relational Hoare logic, which enables robust and transparent transformations. Our method recognizes complex memory access patterns in na\"ive HLS programs and automatically transforms them by inserting on-chip buffers to enforce linear access to off-chip memory, and by replacing non-sequential processing with stream processing, while preserving program semantics. Experiments using our prototype translator, combined with an off-the-shelf HLS compiler and a real FPGA board, have demonstrated significant performance improvements.
{
"annotation_id": "b2f12f4f-3d9f-4a0f-bfcb-12e72eecd6a2",
"date_created": "2026-02-17T05:53:20.214000Z",
"date_modified": "2026-02-17T05:53:20.214000Z",
"file_hash": "3cbdf7b1b7eba580ec43cca9e9f3999bfefac7032145f72327bb6965337d5a92",
"private": false,
"record": {
"abstract": "High-level synthesis (HLS) is a powerful tool for developing efficient hardware accelerators that rely on specialized memory systems to achieve sufficient on-chip data reuse and off-chip bandwidth utilization. However, even with HLS, designing such systems still requires careful manual tuning, as automatic optimizations provided by existing tools are highly sensitive to programming style and often lack transparency. To address these issues, we present a formal translation framework based on relational Hoare logic, which enables robust and transparent transformations. Our method recognizes complex memory access patterns in na\\\"ive HLS programs and automatically transforms them by inserting on-chip buffers to enforce linear access to off-chip memory, and by replacing non-sequential processing with stream processing, while preserving program semantics. Experiments using our prototype translator, combined with an off-the-shelf HLS compiler and a real FPGA board, have demonstrated significant performance improvements.",
"arxiv_id": "2601.09217",
"authors": [
"Izumi Tanaka",
"Ken Sakayori",
"Shinya Takamaeda-Yamazaki",
"Naoki Kobayashi"
],
"categories": [
"cs.PL",
"cs.AR"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"title": "Relational Hoare Logic for High-Level Synthesis of Hardware Accelerators",
"url": "https://arxiv.org/abs/2601.09217",
"version": "v2"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "93de298f-e02b-4e05-a056-bc5e3b7280b7",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}