An SMT-based approach to automated configuration

11 pages•Published: August 19, 2013

Raphaël Michel, Arnaud Hubaux, Vijay Ganesh and Patrick Heymans

Abstract

We present a novel use of SMT solvers: configuration problems. Configuration problems are everywhere and particularly in product lines, where different yet similar products can be built from a common set of assets, which are then chosen, specialized and combined to form a product. Designing a product line boils down to enumerate the different parts of the products and the rules for combining them. These rules are often expressed as constraints. Various categories of constraint solvers exist, but SMT-solvers appear to be a solution of choice for configuration problem. In this paper, we present the configuration problem, we briefly introduce how we represent this type of problem and we map this representation to the input language of an STP solver able to support the various types of constraints found in configuration problems.

Keyphrases: configuration, mapping, product lines, satisfiability, smt, stp, tvl, variability

In: Pascal Fontaine and Amit Goel (editors). SMT 2012. 10th International Workshop on Satisfiability Modulo Theories, vol 20, pages 109-119.

Links:	https://easychair.org/publications/paper/bKGs
	https://doi.org/10.29007/5n7n

BibTeX entry

@inproceedings{SMT2012:SMT_based_approach_automated,
  author    = {Raphaël Michel and Arnaud Hubaux and Vijay Ganesh and Patrick Heymans},
  title     = {An SMT-based approach to automated configuration},
  booktitle = {SMT 2012. 10th International Workshop on Satisfiability Modulo Theories},
  editor    = {Pascal Fontaine and Amit Goel},
  series    = {EPiC Series in Computing},
  volume    = {20},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/bKGs},
  doi       = {10.29007/5n7n},
  pages     = {109-119},
  year      = {2013}}

Download PDF Open PDF in browser