1 / 22

Course topics

Course topics. Representing programs Analyzing and transforming programs Applications of these techniques. Course topics (more details). Representations Abstract Syntax Tree Control Flow Graph Dataflow Graph Static Single Assignment Control Dependence Graph Program Dependence Graph

tyner
Download Presentation

Course topics

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Course topics • Representing programs • Analyzing and transforming programs • Applications of these techniques

  2. Course topics (more details) • Representations • Abstract Syntax Tree • Control Flow Graph • Dataflow Graph • Static Single Assignment • Control Dependence Graph • Program Dependence Graph • Call Graph

  3. Course topics (more details) • Analysis/Transformation Algorithms • Dataflow Analysis • Interprocedural analysis • Pointer analysis • Rule-based analyses and transformations • Constraint-based analysis

  4. Course topics (more details) • Applications • Scalar optimizations • Loop optimizations • Object oriented optimizations • Program verification • Bug finding

  5. Course pre-requisites • No compilers background necessary • Some familiarity with lattices • I will review what is necessary in class • Familiarity with functional/OO programming • Optimization techniques for these kinds of languages • Standard ugrad cs curriculum will likely cover the above • Talk to me if you think you don’t have the pre-requisites

  6. Course work • In-class midterm (30%) • Take-home final (30%) • Course project (40%)

  7. Course project • Goal of the project • Get some hands on experience with compilers and/or Get a feel for what research is like in PL • Requirements • Groups of 3 • Must have large compiler implementation component • Milestones • Project proposal (meet with me, week 2) • Project updates (3 meetings, weeks 4, 6, 8) • Final presentation (end of quarter)

  8. List of sample projects on course page • Find bugs in language-implementation • Find bugs in applications • Code perforation, trading accuracy for power • Super-optimization • Parallelizing transformations • Compiling a DSL

  9. Administrative info • Class web page is up • http://cseweb.ucsd.edu/classes/fa12/cse231-a/ • Will post lectures, project info, etc.

  10. Questions?

  11. Program Analyzer Issues (discuss) Input Output Program Analyzer

  12. Program Analyzer Issues (discuss) Input Output Program Analyzer

  13. Program Analyzer Issues (discuss) Input Output Program Analyzer

  14. Instructor’s discussion notes Input Output Program Analyzer Input issues • Input is a program, but… • What language is the program written in? • imperative vs. functional vs. object-oriented? maybe even declarative? • what pointer model does the language use? • reflection, exceptions, continuations? • type system trusted or not? • one often analyzes an intermediate language... how does one design such a language?

  15. Instructor’s discussion notes Input Output Program Analyzer Input issues • How much of the program do we see? • all? • one file at a time? • one library at a time? • reflection… • Any additional inputs? • any human help? • profile info?

  16. Instructor’s discussion notes Input Output Program Analyzer Analysis issues • Analysis/compilation model • Separate compilation/analysis • quick, but no opportunities for interprocedural analysis • Link-time • allows interprocedural and whole program analysis • but what about shared precompiled libraries? • and what about compile-time? • Run-time • best optimization/analysis potential (can even use run-time state as additional information) • can handle run-time extensions to the program • but severe pressure to limit compilation time • Selective run-time compilation • choose what part of compilation to delay until run-time • can balance compile-time/benefit tradeoffs

  17. Instructor’s discussion notes Input Output Program Analyzer Analysis issues • Does running-time matter? • for use in IDE? • or in overnight compile?

  18. Instructor’s discussion notes Input Output Program Analyzer Output issues • Form of output varies widely, depending on analysis • alias information • constantness information • loop terminates/does not terminate • Correctness of analysis results • depends on what the results are used for • are we attempting to design algorithsm for solving undecidable problems? • notion of approximation • statistical output

  19. Program Transformation Issues (discuss) Input Output Program Transformer

  20. Instructor’s discussion notes Input Output Program Transformer Input issues • A program, and … • Program analysis results • Profile info? • Environment: # of CPUs, # of cores/CPU, cache size, etc. • Anything else?

  21. Instructor’s discussion notes Input Output Program Transformer Transformation issues • What is profitable? • What order to perform transformations? • What happens to the program representation? • What happens to the computed information? For example alias information? Need to recompute?

  22. Instructor’s discussion notes Input Output Program Transformer Output issues • Output in same IL as input? • Should the output program behave the same way as the input program?

More Related