Abstract: We consider an extension of pushdown systems (PDSs), i.e. weighted PDSs, in which each transition is labeled with a value. The goal is to determine the meet-over-all-paths value (for paths that meet a certain criterion). The talk will show how weighted PDSs yield new algorithms for certain classes of interprocedural dataflow-analysis problems. The material in the talk is based on joint work with Tom Reps and Somesh Jha.

Stefan Schwoon is a member of the Software Reliability and Security Group at University of Stuttgart. He received his Ph.D. from Technical University of Munich in 2002.