Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Combinatorial enumeration of groups, graphs, and chemical compounds
Combinatorial enumeration of groups, graphs, and chemical compounds
Simulated annealing: theory and applications
Simulated annealing: theory and applications
Tabu search and design optimization
Computer-Aided Design
A framework for user assisted design space exploration
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Model checking
Tabu Search
AToM3: A Tool for Multi-formalism and Meta-modelling
FASE '02 Proceedings of the 5th International Conference on Fundamental Approaches to Software Engineering
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
On the Expressive Power of OCL
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
The Art of Software Testing
Methods for evaluating and covering the design space during early design development
Integration, the VLSI Journal
Proceedings of the conference on Design, automation and test in Europe: Proceedings
Functional Model Exploration for Multimedia Applications via Algebraic Operators
ACSD '06 Proceedings of the Sixth International Conference on Application of Concurrency to System Design
Generating effective symmetry-breaking predicates for search problems
Discrete Applied Mathematics
Automating component-based system assembly
Proceedings of the 2007 international symposium on Software testing and analysis
Specifying and Composing Non-functional Requirements in Model-Based Development
SC '09 Proceedings of the 8th International Conference on Software Composition
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
Components, platforms and possibilities: towards generic automation for MDA
EMSOFT '10 Proceedings of the tenth ACM international conference on Embedded software
Automated reasoning on feature models
CAiSE'05 Proceedings of the 17th international conference on Advanced Information Systems Engineering
Weaving executability into object-oriented meta-languages
MoDELS'05 Proceedings of the 8th international conference on Model Driven Engineering Languages and Systems
Feature models, grammars, and propositional formulas
SPLC'05 Proceedings of the 9th international conference on Software Product Lines
| Hi-index | 0.00 |
Design space exploration (DSE) refers to the activity of exploring design alternatives prior to implementation. The power to operate on the space of potential design candidates renders DSE useful for many engineering tasks, including rapid prototyping, optimization, and system integration. The main challenge in DSE arises from the sheer size of the design space that must be explored. Typically, a large system has millions, if not billions, of possibilities, and so enumerating every point in the design space is prohibitive. In this paper, we present a method for systematically exploring the design space in a cost-effective manner. The key idea is that many of the design candidates may be considered equivalent as far as the user is concerned, and so only a small subset of the space needs to be explored. Our approach takes the user-defined notion of equivalence, and generates symmetry breaking predicates to ensure that the underlying exploration engine does not sample multiple equivalent design candidates. We describe how the method is integrated into our DSE framework, FORMULA, which uses an SMT solver to solve a set of global design constraints and search for valid design instances.