Skip to main content
SpringerLink
Log in
Book cover

Italian Conference on Algorithms and Complexity

CIAC 1997: Algorithms and Complexity pp 1–2Cite as

Algorithms and data structures for control dependence and related compiler problems

  • Invited Presentations
  • Conference paper
  • First Online:

  • 140 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1203))

This is a preview of subscription content, log in via an institution.

References

  1. K. Pingali and G. Bilardi. APT: A data structure for optimal control dependence computation. In Proc. ACM SIGPLAN '95 Conference on Programming Language Design and Implementation (PLDI), pages 32–46, La Jolla, California, June 1995.

    Google Scholar 

  2. G. Bilardi and K. Pingali, A generalized framework for control dependence. In Proc. ACM SIGPLAN '96 Conference on Programming Language Design and Implementation (PLDI), pages 291–300. Philadelphia, Pennsylvania, May 1996.

    Google Scholar 

  3. K. Pingali and G. Bilardi. Optimal control dependence computation and the Roman chariots problem. ACM Transactions on Programming Languages and Systems. To appear.

    Google Scholar 

  4. G. Bilardi and K. Pingali. Computing the single static assignment form of programs. Manuscript. October 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DEI, Università di Padova, 35131, Padova, Italy

    Gianfranco Bilardi

  2. EECS, University of Illinois, 60607, Chicago, IL

    Gianfranco Bilardi

Authors
  1. Gianfranco Bilardi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Giancarlo Bongiovanni Daniel Pierre Bovet Giuseppe Di Battista

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bilardi, G. (1997). Algorithms and data structures for control dependence and related compiler problems. In: Bongiovanni, G., Bovet, D.P., Di Battista, G. (eds) Algorithms and Complexity. CIAC 1997. Lecture Notes in Computer Science, vol 1203. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62592-5_55

Download citation

  • DOI: https://doi.org/10.1007/3-540-62592-5_55

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62592-6

  • Online ISBN: 978-3-540-68323-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation