Formal Languages & Compilers
Automata, parsing, compiler-backend algorithms, program analysis, the processor those compilers target, and the tools that lay out the chip itself.
Topics
Problems attacked from this category
- Automated test generation and fuzzing3
- Automatic vectorization2
- Automaton and grammar learning2
- Automaton determinization and minimization4
- Branch prediction7
- Cache coherence4
- Cache organization3
- Cache prefetching4
- Cell placement5
- Chip routing7
- Clock tree synthesis3
- Compiler backend code generation7
- Compiler optimization17
- Context-free parsing19
- Data race detection2
- Dataflow analysis6
- Dependency parsing3
- Dominator computation1
- Fault localization3
- Floorplanning3
- Formal language theory2
- Hardware arithmetic6
- Hardware test generation6
- High-level synthesis2
- Instruction scheduling3
- Latency hiding3
- Lexical analysis2
- Lithography compensation1
- Logic minimization and synthesis6
- Low-power design3
- Memory controller scheduling2
- Model checking9
- On-chip network routing3
- Out-of-order execution6
- Page replacement and caching policy3
- Points-to and interprocedural analysis5
- Program proof5
- Regular expression matching3
- Regular expression to automaton construction6
- SSA construction2
- Static security analysis2
- Technology mapping2
- Timing analysis and closure4
- Type inference and checking3