Learning a Strategy for Choosing Widening Thresholds from a Large Codebase

DOI10.1007/978-3-319-47958-3_2MaRDI QIDQ3179275zbMATH OpenOpenAlexFDO

Authors Sooyoung Cha, Sehun Jeong, Hakjoo Oh

Publication date 21 December 2016

Published in Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-47958-3_2

Mathematics Subject Classification ID

Theory of software (68N99) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Learning with the knowledge of an upper bound on program size
• Widening with Thresholds for Programs with Complex Control Graphs
• Predicting program properties from ``big code
• An empirical study of ICASE learning curves and probability bounds for software development effort
• Avoiding coding tricks by hyperrobust learning
• Learning a static analyzer from data

Cites work

• A data driven approach for algebraic loop invariants
• Abstraction refinement guided by a learnt probabilistic model
• Acceleration of the abstract fixpoint computation in numerical program analysis
• scientific article; zbMATH DE number 1953274 (Why is no real title available?)
• Why does Astrée scale up?
• Widening with Thresholds for Programs with Complex Control Graphs

Cited in

(3)

• Learning a variable-clustering strategy for Octagon from labeled data generated by a static analysis
• Learning analysis strategies for Octagon and context sensitivity from labeled data generated by static analyses
• Bias-variance tradeoffs in program analysis

Describes a project that uses

Uses Software

• ASTREE
• Sparrow

This page was built for publication: Learning a Strategy for Choosing Widening Thresholds from a Large Codebase

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