首页|Automatic formal verification for scheduled VLIW code
Automatic formal verification for scheduled VLIW code
扫码查看
点击上方二维码区域,可以放大扫码查看
原文链接
NETL
VLIW processors are attractive for many embedded applications, but VLIW code scheduling, whether by hand or by compiler, is extremely challenging。 In this paper, we extend previous work on automated verification of low-level software to handle the complexity of modern, aggressive VLIW designs, e。g。, the exposed parallelism, pipelining, and resource constraints。 We implement these ideas into a prototype tool for verifying short sequences of assembly code for TI's C62x family of VLIW DSPs, and demonstrate the effectiveness of the tool in quickly verifying, or finding bugs in, two difficult-to-analyze code segments。
theory of equality with uninterpreted functions
Xiushan Feng、Alan J. Hu
展开 >
University of British Columbia
Joint conference on Languages, compilers and tools for embedded systems
Berlin(DE)
Proceedings of the joint conference on Languages, compilers and tools for embedded systems