Lightweight Control-Flow Abstraction

dc.contributor.author	Lindig, Christian
dc.contributor.author	Dallmeier, Valentin
dc.contributor.author	Zeller, Andreas
dc.contributor.editor	Kelter, Udo
dc.date.accessioned	2024-10-25T08:11:31Z
dc.date.available	2024-10-25T08:11:31Z
dc.date.issued	2005
dc.description.abstract	To dynamically capture an application’s control flow, we propose call sequence sets as a light-weight abstraction. Unlike prior approaches based on grammars or trees, call sequence sets are easy to aggregate and compare, which facilitates incremental construction and comparison of control flow within and across program runs.	en
dc.identifier.doi	10.18420/swt25-2_17
dc.identifier.doi	10.18420/swt25-2_17
dc.identifier.uri	https://dl.gi.de/handle/20.500.12116/45301
dc.language.iso	en
dc.pubPlace	Bonn
dc.publisher	Gesellschaft für Informatik e.V.
dc.relation.ispartof	Softwaretechnik-Trends Band 25, Heft 2
dc.relation.ispartofseries	Softwaretechnik-Trends
dc.subject	control flow
dc.subject	call sequence set
dc.subject	reverse engineering
dc.title	Lightweight Control-Flow Abstraction	en
dc.type	Text/Conference Paper
mci.conference.date	2.-4. Mai 2005
mci.conference.location	Bad Honnef
mci.conference.sessiontitle	7. Workshop Software Engineering (WSR 2005) der GI-Fachgruppe Software-Reengineering (SRE)
mci.reference.pages	36-37

Dateien

1 - 1 von 1