Files in this item
Dominion : an architecture-driven approach to generating efficient constraint solvers
Item metadata
dc.contributor.author | Balasubramaniam, Dharini | |
dc.contributor.author | De Silva, Lakshitha Ramesh | |
dc.contributor.author | Jefferson, Christopher Anthony | |
dc.contributor.author | Kotthoff, Lars | |
dc.contributor.author | Miguel, Ian James | |
dc.contributor.author | Nightingale, Peter | |
dc.date.accessioned | 2011-08-12T08:29:02Z | |
dc.date.available | 2011-08-12T08:29:02Z | |
dc.date.issued | 2011-06 | |
dc.identifier | 11754766 | |
dc.identifier | a1c339f6-721f-44c0-adae-7913271c017e | |
dc.identifier | 80051963311 | |
dc.identifier.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/06/11 . https://doi.org/10.1109/WICSA.2011.37 | en |
dc.identifier.citation | conference | en |
dc.identifier.isbn | 978-1-61284-399-5 | |
dc.identifier.other | ORCID: /0000-0002-5052-8634/work/34029963 | |
dc.identifier.other | ORCID: /0000-0003-2979-5989/work/60887563 | |
dc.identifier.other | ORCID: /0000-0002-6930-2686/work/68281457 | |
dc.identifier.other | ORCID: /0000-0002-5093-0906/work/77132543 | |
dc.identifier.uri | https://hdl.handle.net/10023/1967 | |
dc.description | This work is supported by the EPSRC grant “A Constraint Solver Synthesiser” (EP/H004092/1) and SICSA studentships. | en |
dc.description.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. | |
dc.format.extent | 4 | |
dc.format.extent | 152422 | |
dc.language.iso | eng | |
dc.publisher | IEEE Computer Society | |
dc.relation.ispartof | Proceedings of the 9th Working IEEE/IFIP Conference on Software Architecture (WICSA) | en |
dc.subject | Software architecture | en |
dc.subject | Constraint solver | en |
dc.subject | Generative programming | en |
dc.subject | QA76 Computer software | en |
dc.subject.lcc | QA76 | en |
dc.title | Dominion : an architecture-driven approach to generating efficient constraint solvers | en |
dc.type | Conference item | en |
dc.contributor.sponsor | EPSRC | en |
dc.contributor.institution | University of St Andrews. School of Computer Science | en |
dc.contributor.institution | University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra | en |
dc.identifier.doi | https://doi.org/10.1109/WICSA.2011.37 | |
dc.identifier.url | http://www.wicsa.net/ | en |
dc.identifier.grantnumber | EP/H004092/1 | en |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.