The course from NJU mainly focus on the classical technique to solve the current program analysis proble. The course from PKU is discussing different genre like symbolic execution/ formal methods/ JQF.
[Program Analysis] Intro
[Program Analysis] CFL recheability
A path is considered to connect two nodes A and B, or B is reachable from A. Only if the concatenation of the labels on the edges of the path is a word in a specified context-free language.