Folklore confirmed: reducible flow graphs are exponentially larger. Carter, L., Ferrante, J., & Thomborson, C. D. In Aiken, A. & Morrisett, G., editors, POPL, pages 106-114, 2003. ACM. ACM SIGPLAN Notices 38(1), January 2003
Folklore confirmed: reducible flow graphs are exponentially larger. [link]Link  Folklore confirmed: reducible flow graphs are exponentially larger. [link]Paper  bibtex   
@inproceedings{conf/popl/CarterFT03,
  added-at = {2012-05-21T00:00:00.000+0200},
  author = {Carter, Larry and Ferrante, Jeanne and Thomborson, Clark D.},
  biburl = {http://www.bibsonomy.org/bibtex/2d478900b3aac7c443a019699690f04aa/dblp},
  booktitle = {POPL},
  crossref = {conf/popl/2003},
  editor = {Aiken, Alex and Morrisett, Greg},
  ee = {http://doi.acm.org/10.1145/640128.604141},
  interhash = {d265034a384f912783c58fc7c07047ba},
  intrahash = {d478900b3aac7c443a019699690f04aa},
  isbn = {1-58113-628-5},
  keywords = {dblp},
  note = {ACM SIGPLAN Notices 38(1), January 2003},
  pages = {106-114},
  publisher = {ACM},
  timestamp = {2013-08-13T15:19:05.000+0200},
  title = {Folklore confirmed: reducible flow graphs are exponentially larger.},
  url = {http://dblp.uni-trier.de/db/conf/popl/popl2003.html#CarterFT03},
  year = 2003
}

Downloads: 0