Advertisement

Algorithms and data structures for control dependence and related compiler problems

  • Gianfranco Bilardi
Invited Presentations
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1203)

References

  1. [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. [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. [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. [4]
    G. Bilardi and K. Pingali. Computing the single static assignment form of programs. Manuscript. October 1996.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Gianfranco Bilardi
    • 1
    • 2
  1. 1.DEIUniversità di PadovaPadovaItaly
  2. 2.EECSUniversity of IllinoisChicago

Personalised recommendations