Assumption/Commitment Rules for Dataflow Networks - With an Emphasis on Completeness
Abstract elided by the publisher.
Related papers
- Model Checking for Infinite State Systems Using Data Abstraction, Assumption-Commitment Style reasoning and Theorem Proving CAV 1995
- Annotations for Distributed Programming in Logic POPL 1986
- System Semantics: Principles, Applications, and Implementation TOPLAS 1988
- A Fully Abstract Trace Model for Dataflow Networks POPL 1989
- YFlows: Systematic Dataflow Exploration and Code Generation for Efficient Neural Network Inference using SIMD Architectures on CPUs CC 2024
- Peer-to-peer affine commitment using bitcoin PLDI 2015
- Comprehensive Accelerator-Dataflow Co-design Optimization for Convolutional Neural Networks CGO 2022
- Automated soundness proofs for dataflow analyses and transformations via local rules POPL 2005