EdusalsaDiscover Your Stanford

CS 243

Program Analysis and Optimizations

  • Not Offered

3 - 4 units

Letter or Credit/No Credit

Program analysis techniques used in compilers and software development tools to improve productivity, reliability, and security. The methodology of applying mathematical abstractions such as graphs, fixpoint computations, binary decision diagrams in writing complex software, using compilers as an example. Topics include data flow analysis, instruction scheduling, register allocation, parallelism, data locality, interprocedural analysis, and garbage collection. Prerequisites: 103 or 103B, and 107.

Course Prequisites

Grade Distribution

Sign Up

To save CS 243 to your course bucketlist

Already Have An Account? Log In