Automatic Parallelization and Optimization of Programs by Proof Rewriting
STATIC ANALYSIS（2009）
摘要
We show how, given a program and its separation logic proof, one can parallelize and optimize this program and transform its proof simultaneously to obtain a proven parallelized and optimized program. To achieve this goal, we present new proof rules for generating proof trees and a rewrite system on proof trees.
更多查看译文
关键词
automatic parallelization,optimized program,separation logic proof,proof rewriting,proof tree,new proof rule,pointer analysis,software development,multi core processor,data structure,separation logic,object oriented programming
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要