Static Analysis of Gated Data Dependence Graphs

  • Charles Hymans
  • Eben Upton
Conference paper

DOI: 10.1007/978-3-540-27864-1_16

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3148)
Cite this paper as:
Hymans C., Upton E. (2004) Static Analysis of Gated Data Dependence Graphs. In: Giacobazzi R. (eds) Static Analysis. SAS 2004. Lecture Notes in Computer Science, vol 3148. Springer, Berlin, Heidelberg

Abstract

Several authors have advocated the use of the gated data dependence graph as a compiler intermediate representation. If this representation is to gain acceptance, it is important to show that we may construct static analyses which operate directly on it. In this paper we present the first example of such an analysis, developed using the methodology of abstract interpretation. The analysis is shown to be sound with respect to a concrete semantics for the representation. Experimental results are presented which indicate that the analysis performs well in comparison to conventional techniques.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Charles Hymans
    • 1
  • Eben Upton
    • 2
  1. 1.STIXÉcole PolytechniquePalaiseauFrance
  2. 2.Computer LaboratoryUniversity of CambridgeCambridgeUK

Personalised recommendations