Abstraction refinement guided by a learnt probabilistic model

DOI10.1145/2837614.2837663zbMath1347.68084arXiv1511.01874OpenAlexW2264244749MaRDI QIDQ2828290

Radu Grigore, Hongseok Yang

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://arxiv.org/abs/1511.01874

zbMATH Keywords

hypergraphprobabilityDatalog

Mathematics Subject Classification ID

Applications of graph theory (05C90) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items

Learning a Strategy for Choosing Widening Thresholds from a Large Codebase, Learning analysis strategies for Octagon and context sensitivity from labeled data generated by static analyses