Dominion: an architecture-driven approach to generating efficient constraint solvers

Dharini Balasubramaniam; Lakshitha Ramesh De Silva; Christopher Anthony Jefferson; Lars Kotthoff; Ian James Miguel; Peter Nightingale

doi:10.1109/WICSA.2011.37

Dominion: an architecture-driven approach to generating efficient constraint solvers

Dharini Balasubramaniam, Lakshitha Ramesh De Silva, Christopher Anthony Jefferson, Lars Kotthoff, Ian James Miguel, Peter Nightingale

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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.

Original language	English
Title of host publication	Proceedings of the 9th Working IEEE/IFIP Conference on Software Architecture (WICSA)
Subtitle of host publication	Boulder, Colorado, USA 20-24 June 2011
Place of Publication	Los Alamiros, CA
Publisher	IEEE Computer Society
Pages	228-231
Number of pages	4
ISBN (Print)	978-1-61284-399-5
DOIs	https://doi.org/10.1109/WICSA.2011.37
Publication status	Published - Jun 2011
Event	9th Working IEEE/IFIP Conference on Software Architecture - Boulder, United States Duration: 20 Jun 2011 → 24 Jun 2011

Conference

Conference	9th Working IEEE/IFIP Conference on Software Architecture
Country/Territory	United States
City	Boulder
Period	20/06/11 → 24/06/11

Keywords

Software architecture
Constraint solver
Generative programming

Access to Document

10.1109/WICSA.2011.37

WICSA-2011-Dominion
© 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.
Accepted author manuscript, 149 KB

Cite this

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 (pp. 228-231). IEEE Computer Society. https://doi.org/10.1109/WICSA.2011.37

@inproceedings{a1c339f6721f44c0adae7913271c017e,

title = "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.",

keywords = "Software architecture, Constraint solver, Generative programming",

author = "Dharini Balasubramaniam and {De Silva}, {Lakshitha Ramesh} and Jefferson, {Christopher Anthony} and Lars Kotthoff and Miguel, {Ian James} and Peter Nightingale",

note = "This work is supported by the EPSRC grant “A Constraint Solver Synthesiser” (EP/H004092/1) and SICSA studentships.; 9th Working IEEE/IFIP Conference on Software Architecture ; Conference date: 20-06-2011 Through 24-06-2011",

year = "2011",

month = jun,

doi = "10.1109/WICSA.2011.37",

language = "English",

isbn = "978-1-61284-399-5",

pages = "228--231",

booktitle = "Proceedings of the 9th Working IEEE/IFIP Conference on Software Architecture (WICSA)",

publisher = "IEEE Computer Society",

address = "United States",

}

Balasubramaniam, D, De Silva, LR, Jefferson, CA, Kotthoff, L, Miguel, IJ & 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

Dominion: an architecture-driven approach to generating efficient constraint solvers. / Balasubramaniam, Dharini; De Silva, Lakshitha Ramesh; Jefferson, Christopher Anthony et al.
Proceedings of the 9th Working IEEE/IFIP Conference on Software Architecture (WICSA): Boulder, Colorado, USA 20-24 June 2011. Los Alamiros, CA: IEEE Computer Society, 2011. p. 228-231.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Dominion

T2 - 9th Working IEEE/IFIP Conference on Software Architecture

AU - Balasubramaniam, Dharini

AU - De Silva, Lakshitha Ramesh

AU - Jefferson, Christopher Anthony

AU - Kotthoff, Lars

AU - Miguel, Ian James

AU - Nightingale, Peter

N1 - This work is supported by the EPSRC grant “A Constraint Solver Synthesiser” (EP/H004092/1) and SICSA studentships.

PY - 2011/6

Y1 - 2011/6

N2 - 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.

AB - 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.

KW - Software architecture

KW - Constraint solver

KW - Generative programming

UR - http://www.wicsa.net/

U2 - 10.1109/WICSA.2011.37

DO - 10.1109/WICSA.2011.37

M3 - Conference contribution

SN - 978-1-61284-399-5

SP - 228

EP - 231

BT - Proceedings of the 9th Working IEEE/IFIP Conference on Software Architecture (WICSA)

PB - IEEE Computer Society

CY - Los Alamiros, CA

Y2 - 20 June 2011 through 24 June 2011

ER -

Balasubramaniam D, De Silva LR, Jefferson CA, Kotthoff L, Miguel IJ, Nightingale P. 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. Los Alamiros, CA: IEEE Computer Society. 2011. p. 228-231 doi: 10.1109/WICSA.2011.37

Dominion: an architecture-driven approach to generating efficient constraint solvers

Abstract

Conference

Keywords

Access to Document

Other files and links

Fingerprint

A Constraint Solver Synthesiser: A Constraint Solver Synthesiser

Cite this

Dominion: an architecture-driven approach to generating efficient constraint solvers

Abstract

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Projects

A Constraint Solver Synthesiser: A Constraint Solver Synthesiser

Cite this