Program slicing is a technique to identify statements that may influence the computations in other statements. Despite the ongoing research of almost 25 years, program slicing still has problems that prevent a widespread use: Sometimes, slices are too big to understand and too expensive and complicated to be computed for real-life programs. This book presents solutions to these problems: It contains various approaches which help the user to understand a slice more easily by making it more focused on the user's problem. The underlying data structures used for slicing are program dependence graphs. They can also be used for different purposes: A new approach to clone detection based on identifying similar subgraphs in program dependence graphs is presented; it is able to detect modified clones better than other tools. In the theoretical part, this book presents a high-precision approach to slice concurrent procedural programs despite that optimal slicing is known to be undecidable. It is the first approach to slice concurrent programs that does not rely on inlining of called procedures.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Program slicing is a technique to identify statements that may influence the computations in other statements. Despite the ongoing research of almost 25 years, program slicing still has problems that prevent a widespread use: Sometimes, slices are too big to understand and too expensive and complicated to be computed for real-life programs. This book presents solutions to these problems: It contains various approaches which help the user to understand a slice more easily by making it more focused on the user's problem. The underlying data structures used for slicing are program dependence graphs. They can also be used for different purposes: A new approach to clone detection based on identifying similar subgraphs in program dependence graphs is presented; it is able to detect modified clones better than other tools. In the theoretical part, this book presents a high-precision approach to slice concurrent procedural programs despite that optimal slicing is known to be undecidable. It is the first approach to slice concurrent programs that does not rely on inlining of called procedures.
Jens Krinke received his Ph.D. in computer science from the University of Passau, Germany, in 2003. Shortly after, he became assistant professor for software technology at FernUniversität/University in Hagen, the only distance teaching university in Germany.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Vendeur : preigu, Osnabrück, Allemagne
Taschenbuch. Etat : Neu. Advanced Slicing of Sequential and Concurrent Programs | Jens Krinke | Taschenbuch | Englisch | VDM Verlag Dr. Müller | EAN 9783836475457 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu. N° de réf. du vendeur 101826226
Quantité disponible : 5 disponible(s)
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Program slicing is a technique to identify statements that may influence the computations in other statements. Despite the ongoing research of almost 25 years, program slicing still has problems that prevent a widespread use: Sometimes, slices are too big to understand and too expensive and complicated to be computed for real-life programs. This book presents solutions to these problems: It contains various approaches which help the user to understand a slice more easily by making it more focused on the user's problem. The underlying data structures used for slicing are program dependence graphs. They can also be used for different purposes: A new approach to clone detection based on identifying similar subgraphs in program dependence graphs is presented; it is able to detect modified clones better than other tools. In the theoretical part, this book presents a high-precision approach to slice concurrent procedural programs despite that optimal slicing is known to be undecidable. It is the first approach to slice concurrent programs that does not rely on inlining of called procedures.; Program slicing is a technique to identify statements that mayinfluence the computations in other statements. Despite the ongoingresearch of almost 25 years, program slicing still has problems thatprevent a widespread use: Sometimes, slices are too big to understandand too expensive and complicated to be computed for real-lifeprograms. This book presents solutions to these problems: Itcontains various approaches which help the user to understand a slicemore easily by making it more focused on the user's problem.The underlying data structures used for slicing are program dependencegraphs. They can also be used for different purposes: A new approachto clone detection based on identifying similar subgraphs in programdependence graphs is presented; it is able to detect modified clonesbetter than other tools.In the theoretical part, this book presents a high-precisionapproach to slice concurrent procedural programs despite that optimalslicing is known to be undecidable. It is the first approach to sliceconcurrent programs that does not rely on inlining of calledprocedures. N° de réf. du vendeur 9783836475457
Quantité disponible : 2 disponible(s)
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Paperback. Etat : Brand New. 252 pages. 8.66x5.91x0.57 inches. In Stock. N° de réf. du vendeur 3836475456
Quantité disponible : 1 disponible(s)