Identifying dynamic data structures by learning evolving patterns in memory

DOI10.1007/978-3-642-36742-7_25MaRDI QIDQ5326337zbMATH OpenOpenAlexFDO

Authors David H. White, Gerald Lüttgen

Publication date 5 August 2013

Published in Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-36742-7_25

zbMATH Keywords

machine learningpattern recognitiondynamic data structurespointer programsprogram comprehension

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Data structures (68P05) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• scientific article; zbMATH DE number 1940294
• Learning shape analysis
• Structural and behavioral detection of design patterns
• Pattern-based verification of programs with extended linear linked data structures
• Detecting loop-carried dependences in programs with dynamic data structures

Cited in

(3)

• The Daikon system for dynamic detection of likely invariants
• Efficient learning in adaptive processing of data structures
• Recurring concept memory management in data streams: exploiting data stream concept evolution to improve performance and transparency

This page was built for publication: Identifying dynamic data structures by learning evolving patterns in memory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5326337)