University of Cambridge > Talks.cam > Computer Laboratory Programming Research Group Seminar > Sequentializing the Value State Dependence Graph

Sequentializing the Value State Dependence Graph

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Alan Mycroft.

Abstract: The VSDG (Value State Dependence Graph) is a new compiler Intermediate Representation which is both more abstract and more normalizing than existing IRs such as the CFG (Control Flow Graph) and PDG (Program Dependence Graph). However, VSDG compilers have been held back by the difficulty of sequentializing the VSDG back into a CFG . In this talk I will: shared between static occurrences in the resulting PDG (and later CFG ).

  • review how a program is represented in the VSDG , and how this differs from CFG and PDG ;
  • present our architecture for sequentialization via the PDG ;
  • show how the central task of VSDG -to-PDG conversion is equivalent to selecting an evaluation strategy and (if time permits) specifying how computations of the values dynamically occurring in an expression are

This talk is part of the Computer Laboratory Programming Research Group Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity