Show simple item record

Files in this item

Thumbnail

Item metadata

dc.contributor.authorBalasubramaniam, Dharini
dc.contributor.authorDe Silva, Lakshitha Ramesh
dc.contributor.authorJefferson, Christopher Anthony
dc.contributor.authorKotthoff, Lars
dc.contributor.authorMiguel, Ian James
dc.contributor.authorNightingale, Peter
dc.date.accessioned2011-08-12T08:29:02Z
dc.date.available2011-08-12T08:29:02Z
dc.date.issued2011-06
dc.identifier.citationBalasubramaniam , 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.37en
dc.identifier.citationconferenceen
dc.identifier.isbn978-1-61284-399-5
dc.identifier.otherPURE: 11754766
dc.identifier.otherPURE UUID: a1c339f6-721f-44c0-adae-7913271c017e
dc.identifier.otherScopus: 80051963311
dc.identifier.otherORCID: /0000-0002-5052-8634/work/34029963
dc.identifier.otherORCID: /0000-0003-2979-5989/work/60887563
dc.identifier.otherORCID: /0000-0002-6930-2686/work/68281457
dc.identifier.otherORCID: /0000-0002-5093-0906/work/77132543
dc.identifier.urihttp://hdl.handle.net/10023/1967
dc.descriptionThis work is supported by the EPSRC grant “A Constraint Solver Synthesiser” (EP/H004092/1) and SICSA studentships.en
dc.description.abstractConstraints 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.extent4
dc.language.isoeng
dc.publisherIEEE Computer Society
dc.relation.ispartofProceedings of the 9th Working IEEE/IFIP Conference on Software Architecture (WICSA)en
dc.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.en
dc.subjectSoftware architectureen
dc.subjectConstraint solveren
dc.subjectGenerative programmingen
dc.subjectQA76 Computer softwareen
dc.subject.lccQA76en
dc.titleDominion : an architecture-driven approach to generating efficient constraint solversen
dc.typeConference itemen
dc.description.versionPostprinten
dc.contributor.institutionUniversity of St Andrews.School of Computer Scienceen
dc.contributor.institutionUniversity of St Andrews.Centre for Interdisciplinary Research in Computational Algebraen
dc.identifier.doihttps://doi.org/10.1109/WICSA.2011.37
dc.identifier.urlhttp://www.wicsa.net/en


This item appears in the following Collection(s)

Show simple item record