Many classical compiler optimizations can be elegantly expressed using rewrite rules of form: I =) I 0
ProvingCorrectnessofCompilerOptimizationsby
TemporalLogic
DavidLaceyNeilD.JonesEricVanWykCarlChristianFrederiksenABSTRACT
1.INTRODUCTION
Proving correctness of c... 暂无评价 11页 免费 Validating Correctness o.... Correctness of classical compiler optimizations using CTL In this paper, ...
Proving correctness of c... 暂无评价 11页 免费 An optimizing compiler f...Optimizations are performed via a set of distinct, interchangeable optimization...
A structured approach to proving compiler optimizations based on data?ow ...This paper reports on the correctness proof of compiler optimizations based ...
Abstract Using Temporal ... 暂无评价 20页 免费...optimizations of other frameworks in a straight...proving conditions on the relation between data ...
Abstract Using Temporal ... 暂无评价 20页 免费...optimizations of other frameworks in a straight...proving conditions on the relation between data ...
热门文档