Clustering-Guided SMT($\mathcal {L\!R\!A}$) Learning
暂无分享,去创建一个
Rolf Drechsler | Marcel Walter | Daniel Große | Tim Meywerk | R. Drechsler | Daniel Große | Tim Meywerk | Marcel Walter
[1] Roberto Baldoni,et al. A Survey of Symbolic Execution Techniques , 2016, ACM Comput. Surv..
[2] Luc De Raedt,et al. Inductive Logic Programming: Theory and Methods , 1994, J. Log. Program..
[3] Rajeev Alur,et al. TRANSIT: specifying protocols with concolic snippets , 2013, PLDI.
[4] Luc De Raedt,et al. Learning constraints in spreadsheets and tabular data , 2017, Machine Learning.
[5] Lucas C. Cordeiro,et al. Verifying multi-threaded software using smt-based context-bounded model checking , 2011, 2011 33rd International Conference on Software Engineering (ICSE).
[6] Arjun Radhakrishna,et al. Scaling Enumerative Program Synthesis via Divide and Conquer , 2017, TACAS.
[7] C. Cordell Green,et al. Application of Theorem Proving to Problem Solving , 1969, IJCAI.
[8] Nikolaj Bjørner,et al. Z3: An Efficient SMT Solver , 2008, TACAS.
[9] Craig A. Knoblock,et al. Exploiting automatically inferred constraint-models for building identification in satellite imagery , 2007, GIS.
[10] Wilfried Steiner,et al. An Evaluation of SMT-Based Schedule Synthesis for Time-Triggered Multi-hop Networks , 2010, 2010 31st IEEE Real-Time Systems Symposium.
[11] Luc De Raedt,et al. Learning SMT(LRA) Constraints using SMT Solvers , 2018, IJCAI.
[12] Barry O'Sullivan,et al. A SAT-Based Version Space Algorithm for Acquiring Constraint Satisfaction Problems , 2005, ECML.
[13] Leslie G. Valiant,et al. A theory of the learnable , 1984, STOC '84.
[14] Niklas Sörensson,et al. An Extensible SAT-solver , 2003, SAT.
[15] Mathias Soeken,et al. SAT Based Exact Synthesis using DAG Topology Families , 2018, 2018 55th ACM/ESDA/IEEE Design Automation Conference (DAC).
[16] Gaël Varoquaux,et al. Scikit-learn: Machine Learning in Python , 2011, J. Mach. Learn. Res..
[17] Toby Walsh,et al. Handbook of satisfiability , 2009 .
[18] Franco Turini,et al. A Survey of Methods for Explaining Black Box Models , 2018, ACM Comput. Surv..
[19] Lior Rokach,et al. Data Mining and Knowledge Discovery Handbook, 2nd ed , 2010, Data Mining and Knowledge Discovery Handbook, 2nd ed..
[20] Hillel Kugler,et al. SMT-Based Analysis of Biological Computation , 2013, NASA Formal Methods.
[21] James C. King,et al. Symbolic execution and program testing , 1976, CACM.
[22] Robin Sibson,et al. SLINK: An Optimally Efficient Algorithm for the Single-Link Cluster Method , 1973, Comput. J..
[23] Cesare Tinelli,et al. Extending enumerative function synthesis via SMT-driven classification , 2019, 2019 Formal Methods in Computer Aided Design (FMCAD).
[24] Cesare Tinelli,et al. cvc4sy: Smart and Fast Term Enumeration for Syntax-Guided Synthesis , 2019, CAV.
[25] Karem A. Sakallah,et al. GRASP—a new search algorithm for satisfiability , 1996, ICCAD 1996.