Analysing ProB's Constraint Solving Backends - What Do They Know? Do They Know Things? Let's Find Out

Publication
7th International Conference on Rigorous State Based Methods (ABZ'20)

Abstract

We evaluate the strengths and weaknesses of different backends of the ProB constraint solver. For this, we train a random forest over a database of constraints to classify whether a backend is able to find a solution within a given amount of time or answers unknown. The forest is then analysed in regards of feature importances to determine subsets of the B language in which the respective backends excel or lack for performance. The results are compared to our initial assumptions over each backend’s performance in these subsets based on personal experiences. While we do employ classifiers, we do not aim for a good predictor, but are rather interested in analysis of the classifier’s learned knowledge over the utilised B constraints. The aim is to strengthen our knowledge of the different tools at hand by finding subsets of the B language in which a backend performs better than others.

Document

If you cannot see the document below, the PDF document is most likely not freely accessible. In this case, please try to access the document via this link.

Reference

% BibTex
@inproceedings{DunkelauSL20,
  author       = {Jannik Dunkelau and
                  Joshua Schmidt and
                  Michael Leuschel},
  editor       = {Alexander Raschke and
                  Dominique M{\'{e}}ry and
                  Frank Houdek},
  title        = {Analysing ProB's Constraint Solving Backends - What Do They Know?
                  Do They Know Things? Let's Find Out!},
  booktitle    = {Rigorous State-Based Methods - 7th International Conference, {ABZ}
                  2020, Ulm, Germany, May 27-29, 2020, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {12071},
  pages        = {107--123},
  publisher    = {Springer},
  year         = {2020},
  url          = {https://doi.org/10.1007/978-3-030-48077-6\_8},
  doi          = {10.1007/978-3-030-48077-6\_8},
  timestamp    = {Wed, 16 Mar 2022 23:56:06 +0100},
  biburl       = {https://dblp.org/rec/conf/asm/DunkelauSL20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}


Related