Dominion : an architecture-driven approach to generating efficient constraint solvers
Abstract
Constraints are used to solve combinatorial problems in a variety of industrial and academic disciplines. However most constraint solvers are designed to be general and monolithic, leading to problems with efficiency, scalability and extensibility. We propose a novel, architecture-driven constraint solver generation framework called Dominion to tackle these issues. For any given problem, Dominion generates a lean and efficient solver tailored to that problem. In this paper, we outline the Dominion approach and its implications for software architecture specification of the solver.
Citation
Balasubramaniam , D , De Silva , L R , Jefferson , C A , Kotthoff , L , Miguel , I J & Nightingale , P 2011 , ' Dominion : an architecture-driven approach to generating efficient constraint solvers ' . in Proceedings of the 9th Working IEEE/IFIP Conference on Software Architecture (WICSA) : Boulder, Colorado, USA 20-24 June 2011 . IEEE Computer Society , Los Alamiros, CA , pp. 228-231 , 9th Working IEEE/IFIP Conference on Software Architecture , Boulder , United States , 20-24 June . , 10.1109/WICSA.2011.37 conference
Version
Postprint
Publication
Proceedings of the 9th Working IEEE/IFIP Conference on Software Architecture (WICSA)
Type
Conference item
Rights
© 2011 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Description
This work is supported by the EPSRC grant “A Constraint Solver Synthesiser” (EP/H004092/1) and SICSA studentships.
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.