Learning minimal abstractions

DOI10.1145/1926385.1926391zbMath1284.68519OpenAlexW4252599801MaRDI QIDQ5408529

Mayur Naik, Omer Tripp, Percy Liang

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

randomizationstatic analysisconcurrencymachine learningheap abstractions

Mathematics Subject Classification ID

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

Related Items (2)

Accelerating program analyses in Datalog by merging library facts ⋮ Finding suitable variability abstractions for lifted analysis

This page was built for publication: Learning minimal abstractions