Automated Backend Selection for ProB Using Deep Learning

Employing formal methods for software development usually involves using a multitude of tools such as model checkers and provers. Most of them again feature different backends and configuration options. Selecting an appropriate configuration for a successful employment becomes increasingly hard. In this article, we use machine learning methods to automate the backend selection for the ProB model checker. In particular, we explore different approaches to deep learning and outline how we apply them to find a suitable backend for given input constraints.

[1]  Frank Rosenblatt,et al.  PRINCIPLES OF NEURODYNAMICS. PERCEPTRONS AND THE THEORY OF BRAIN MECHANISMS , 1963 .

[2]  David D. Lewis,et al.  Heterogeneous Uncertainty Sampling for Supervised Learning , 1994, ICML.

[3]  Guigang Zhang,et al.  Deep Learning , 2016, Int. J. Semantic Comput..

[4]  Yehoshua Bar-Hillel,et al.  Foundations of Set Theory , 2012 .

[5]  Stephan Schulz,et al.  E - a brainiac theorem prover , 2002, AI Commun..

[6]  Emina Torlak,et al.  Kodkod: A Relational Model Finder , 2007, TACAS.

[7]  Yuri Malitsky,et al.  Deep Learning for Algorithm Portfolios , 2016, AAAI.

[8]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[9]  Ralph-Johan Back,et al.  On Correct Refinement of Programs , 1981, J. Comput. Syst. Sci..

[10]  Michael Leuschel,et al.  Validating B, Z and TLA + Using ProB and Kodkod , 2012, FM.

[11]  A. Fraenkel,et al.  Zu den Grundlagen der Cantor-Zermeloschen Mengenlehre , 1922 .

[12]  Leo Breiman,et al.  Random Forests , 2001, Machine Learning.

[13]  A. A. Mullin,et al.  Principles of neurodynamics , 1962 .

[14]  Nikolaj Bjørner,et al.  Z3: An Efficient SMT Solver , 2008, TACAS.

[15]  Dominique Cansell,et al.  Foundations of the B Method , 2003, Comput. Artif. Intell..

[16]  James F. Power,et al.  Evaluating the use of a general-purpose benchmark suite for domain-specific SMT-solving , 2016, SAC.

[17]  D. Wolpert,et al.  No Free Lunch Theorems for Search , 1995 .

[18]  Christoph Goller,et al.  Learning task-dependent distributed representations by backpropagation through structure , 1996, Proceedings of International Conference on Neural Networks (ICNN'96).

[19]  Stan Szpakowicz,et al.  Beyond Accuracy, F-Score and ROC: A Family of Discriminant Measures for Performance Evaluation , 2006, Australian Conference on Artificial Intelligence.

[20]  James F. Power,et al.  Predicting SMT Solver Performance for Software Verification , 2017, F-IDE@FM.

[21]  Michael J. Butler,et al.  ProB: an automated analysis toolset for the B method , 2008, International Journal on Software Tools for Technology Transfer.

[22]  Wolfgang Bibel,et al.  SETHEO: A high-performance theorem prover , 1992, Journal of Automated Reasoning.

[23]  François Bobot,et al.  Why3: Shepherd Your Herd of Provers , 2011 .

[24]  Michael J. Butler,et al.  ProB: A Model Checker for B , 2003, FME.

[25]  James P. Bridge.  Machine learning and automated theorem proving , 2010 .

[26]  Michael Leuschel,et al.  SMT Solvers for Validation of B and Event-B Models , 2016, IFM.

[27]  Mats Carlsson,et al.  An Open-Ended Finite Domain Constraint Solver , 1997, PLILP.

[28]  Michael Leuschel,et al.  From Animation to Data Validation: The ProB Constraint Solver 10 Years On , 2014 .

[29]  Geoffrey E. Hinton,et al.  Learning representations by back-propagating errors , 1986, Nature.

[30]  Ralph-Johan Back,et al.  Refinement Calculus: A Systematic Introduction , 1998 .

[31]  Michael Leuschel,et al.  From Failure to Proof: The ProB Disprover for B and Event-B , 2015, SEFM.

[32]  Yann LeCun,et al.  Convolutional networks and applications in vision , 2010, Proceedings of 2010 IEEE International Symposium on Circuits and Systems.

[33]  Éric Gaussier,et al.  A Probabilistic Interpretation of Precision, Recall and F-Score, with Implication for Evaluation , 2005, ECIR.

[34]  F ROSENBLATT,et al.  The perceptron: a probabilistic model for information storage and organization in the brain. , 1958, Psychological review.

[35]  Jean-Christophe Filliâtre,et al.  Why3 - Where Programs Meet Provers , 2013, ESOP.

[36]  Christoph Goller.  Learning search-control heuristics for automated deduction systems with folding architecture networks , 1999, ESANN.

[37]  Nathalie Japkowicz,et al.  The Class Imbalance Problem: Significance and Strategies , 2000 .

[38]  Wei-Yin Loh,et al.  Classification and regression trees , 2011, WIREs Data Mining Knowl. Discov..

[39]  Jean-Raymond Abrial,et al.  The B-book - assigning programs to meanings , 1996 .

[40]  Stan Matwin,et al.  Addressing the Curse of Imbalanced Training Sets: One-Sided Selection , 1997, ICML.

[41]  Marc Frappier,et al.  A Translation from Alloy to B , 2018, ABZ.

[42]  J. Ross Quinlan,et al.  Induction of Decision Trees , 1986, Machine Learning.