An Efficient Staging Algorithm for Binding-Time Analysis.


https://doi.org/10.1007/978-3-540-25938-1_9
@inproceedings{DBLP:conf/lopstr/MurakamiHKT03, author = {Takuma Murakami and Zhenjiang Hu and Kazuhiko Kakehi and Masato Takeichi}, editor = {Maurice Bruynooghe}, title = {An Efficient Staging Algorithm for Binding-Time Analysis}, booktitle = {Logic Based Program Synthesis and Transformation, 13th International Symposium {LOPSTR} 2003, Uppsala, Sweden, August 25-27, 2003, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {3018}, pages = {106--107}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-25938-1\_9}, doi = {10.1007/978-3-540-25938-1\_9}, timestamp = {Tue, 14 May 2019 10:00:41 +0200}, biburl = {https://dblp.org/rec/conf/lopstr/MurakamiHKT03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }

本页面没有标签
本页面最近更新:2020/05/21更新历史
发现错误?想一起完善? 在 GitHub 上编辑此页!
本页面的全部内容在 CC BY-SA 4.0 SATA 协议之条款下提供,附加条款亦可能应用

Copyright © 2016 - 2020 PKU Scholar

最近更新: 52aade4, 2020-05-21