Activity: Talk or presentation › Lecture and oral contribution
Tree automata describe sets of terms. Together with closely related notions such as regular types and set constraints they attract growing attention in automatic program analysis and verification. This talk will survey some applications of tree automata in program analysis, such as program specialisation, data flow analysis for a variety of languages, shape analysis of pointer-based data structures, polymorphic type inference, binding time analysis, termination analysis, infinite state model checking and cryptographic protocol analysis.
Emneord: Tree automata, abstract interpretation, static analysis
14 Sep 2007
Jornadas sobre Programación y Lenguajes, PROLE’2007: null
Zaragoza, Congress Centre, Spain
Tree automata, abstract interpretation, static analysis