An Efficient Staging Algorithm for Binding-Time Analysis

Takuma Murakami, Zhenjiang Hu, Kazuhiko Kakehi, Masato Takeichi. An Efficient Staging Algorithm for Binding-Time Analysis. In Maurice Bruynooghe, editor, Logic Based Program Synthesis and Transformation, 13th International Symposium LOPSTR 2003, Uppsala, Sweden, August 25-27, 2003, Revised Selected Papers. Volume 3018 of Lecture Notes in Computer Science, pages 106-107, Springer, 2003. [doi]

@inproceedings{MurakamiHKT03,
  title = {An Efficient Staging Algorithm for Binding-Time Analysis},
  author = {Takuma Murakami and Zhenjiang Hu and Kazuhiko Kakehi and Masato Takeichi},
  year = {2003},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3018&spage=106},
  tags = {analysis},
  researchr = {https://researchr.org/publication/MurakamiHKT03},
  cites = {0},
  citedby = {0},
  pages = {106-107},
  booktitle = {Logic Based Program Synthesis and Transformation, 13th International Symposium LOPSTR 2003, Uppsala, Sweden, August 25-27, 2003, Revised Selected Papers},
  editor = {Maurice Bruynooghe},
  volume = {3018},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-22174-3},
}