Learning programs from noisy data

DOI10.1145/2837614.2837671MaRDI QIDQ2828319zbMATH OpenOpenAlexFDO

Authors Veselin Raychev, Pavol Bielik, Martin Vechev, Andreas Krause

Publication date 24 October 2016

Published in Proceedings of the 43rd 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/2837614.2837671

zbMATH Keywords

regularizationanomaly detectionnoisy dataprogram synthesisbig codestatistical code completion

Mathematics Subject Classification ID

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

Recommendations

• Learning abstractions for program synthesis
• Data-driven synthesis of full probabilistic programs
• Learning a static analyzer from data
• scientific article; zbMATH DE number 2077170
• Program synthesis in the presence of infinite number of inaccuracies

Cited in

(7)

• Predicting program properties from ``big code
• Learning programs with magic values
• Bootstrapping library-based synthesis
• Learning analysis strategies for Octagon and context sensitivity from labeled data generated by static analyses
• scientific article; zbMATH DE number 92608 (Why is no real title available?)
• Program boosting: program synthesis via crowd-sourcing
• Introduction to model checking

Describes a project that uses

Uses Software

• CheckCell

This page was built for publication: Learning programs from noisy data

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