Learning minimal abstractions

DOI10.1145/1926385.1926391MaRDI QIDQ5408529zbMATH OpenOpenAlexFDO

Authors Percy Liang, Omer Tripp, Mayur Naik

Publication date 10 April 2014

Published in Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1926385.1926391

zbMATH Keywords

concurrencyheap abstractionsmachine learningrandomizationstatic analysis

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Abstraction refinement guided by a learnt probabilistic model
• Learning a static analyzer from data
• scientific article; zbMATH DE number 1903343
• D^3: data-driven disjunctive abstraction
• Computer Aided Verification

Cited in

(9)

• Learning analysis strategies for Octagon and context sensitivity from labeled data generated by static analyses
• Accelerating program analyses in Datalog by merging library facts
• Learning a static analyzer from data
• Finding suitable variability abstractions for lifted analysis
• D^3: data-driven disjunctive abstraction
• Abstraction refinement guided by a learnt probabilistic model
• scientific article; zbMATH DE number 4166913 (Why is no real title available?)
• Bias-variance tradeoffs in program analysis
• Per-dereference verification of temporal heap safety via adaptive context-sensitive analysis

This page was built for publication: Learning minimal abstractions

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