Problem
Research questions and friction points this paper is trying to address.
dataflow architectures
determinacy
pipelining
compiler verification
asynchronous channels
Let it Flow: A Formally Verified Compilation Framework for Asynchronous Dataflow
🤖 AI Summary
This work addresses the challenge of reconciling program determinism with pipeline optimization in asynchronous dataflow compilation by introducing Wavelet, a framework that achieves the first end-to-end formal verification for such compilers. Wavelet integrates a capability-based type system augmented with memory fences and the Lean theorem prover to provide modular, semantics-preserving proofs for core compiler transformations, guaranteeing that the generated dataflow graphs satisfy both forward simulation and determinism. Experimental results demonstrate that code produced by Wavelet matches the size of that generated by the unverified RipTide compiler while offering rigorous correctness guarantees.
📝 Abstract
Dataflow architectures have gained renewed interest due to their balance between power efficiency and performance. In (spatial) dataflow architectures, a program is represented as a set of entirely distributed and dynamically scheduled dataflow operators that communicate through asynchronous channels, which greatly improves data locality and parallelism. However, compiling to dataflow architectures remains an error-prone process, in order to maintain determinacy while enabling pipelining. Determinacy means that the result of a dataflow program is deterministic and independent of the schedule of operator execution, and pipelining is an important optimization in spatial dataflow that enables parallelism across loop iterations.
In this work, we present Wavelet, the first effort to formally verify a compiler for asynchronous dataflow. We use a mix of techniques to achieve this goal. Our frontend uses a novel capability type system with fences to synchronize conflicting memory accesses and enable pipelining. We then verify a Lean formalization of two core passes of our compiler that translates elaborated programs from the type checker to dataflow graphs, proving important properties of forward simulation and determinacy. Notably, our formalization semantically propagates the soundness guarantees of the frontend type system, ensuring modularity between simulation and determinacy proofs. In evaluation, we show that dataflow graphs compiled by Wavelet have comparable sizes to those produced by an unverified optimizing compiler for the RipTide spatial dataflow architecture.
Innovation
Methods, ideas, or system contributions that make the work stand out.
formal verification
asynchronous dataflow
capability type system
determinacy
pipelining
🔎 Similar Papers
No similar papers found.
