Slicing and Clone Detection for Sequential and Concurrent Programs: Two Applications of Dependence Graphs

Liebe Kollegen, liebe Studenten:

Am Freitag, den 31.01. um 14:00 c.t. (Seminarraum 328) spricht

Jens Krinke, Universität Passau

zum Thema

Slicing and Clone Detection for Sequential and Concurrent Programs:
Two Applications of Dependence Graphs

We present an approach to context-sensitive slicing of concurrent
programs based on realizable paths in threaded program dependence
graphs. Unfortunately, precise slicing of concurrent programs is
undecidable in general. However, our approach yields a high
precision approximation.

A new application of program dependence graphs is detection of
cloned code: We show how similar subgraphs are identified, thus
enabling the detection of modified clones. In a contest, our tool
showed best detection rates in this category.

Jens Krinke ist wissenschaftlicher Assistent an der Universität
Passau; er forscht auf den Gebieten Program-Slicing, Analyse
paralleler und objektorientierter Programmiersprachen sowie moderne
Programmiersprachen.

Mit freundlichen Grüssen,

Andreas Zeller

--
Andreas Zeller Universitaet des Saarlandes, Saarbruecken, Germany
http://www.st.cs.uni-sb.de/~zeller/