Making compromises among antagonist constraints in a planner
Artificial Intelligence
Multi-way versus one-way constraints in user interfaces: experience with the DeltaBlue algorithm
Software—Practice & Experience
Solution reuse in dynamic constraint satisfaction problems
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Handbook of graph grammars and computing by graph transformation: volume I. foundations
The Programming Language Aspects of ThingLab, a Constraint-Oriented Simulation Laboratory
ACM Transactions on Programming Languages and Systems (TOPLAS)
Alloy: a lightweight object modelling notation
ACM Transactions on Software Engineering and Methodology (TOSEM)
Korat: automated testing based on Java predicates
ISSTA '02 Proceedings of the 2002 ACM SIGSOFT international symposium on Software testing and analysis
Dynamic Flexible Constraint Satisfaction
Applied Intelligence
On the Frame Problem in Procedure Specifications
IEEE Transactions on Software Engineering
Utilizing Constraint Satisfaction Techniques for Efficient Graph Pattern Matching
TAGT'98 Selected papers from the 6th International Workshop on Theory and Application of Graph Transformations
Using Randomization and Learning to Solve Hard Real-World Instances of Satisfiability
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Confluence of Typed Attributed Graph Transformation Systems
ICGT '02 Proceedings of the First International Conference on Graph Transformation
Introduction to PROGRESS, an Attribute Graph Grammar Based Specification Language
WG '89 Proceedings of the 15th International Workshop on Graph-Theoretic Concepts in Computer Science
Test input generation with java PathFinder
ISSTA '04 Proceedings of the 2004 ACM SIGSOFT international symposium on Software testing and analysis
A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs
IEEE Transactions on Pattern Analysis and Machine Intelligence
CUTE: a concolic unit testing engine for C
Proceedings of the 10th European software engineering conference held jointly with 13th ACM SIGSOFT international symposium on Foundations of software engineering
Theory of Constraints and Application Conditions: From Graphs to High-Level Structures
Fundamenta Informaticae - SPECIAL ISSUE ON ICGT 2004
The model transformation language of the VIATRA2 framework
Science of Computer Programming
UMLtoCSP: a tool for the formal verification of UML/OCL models using constraint programming
Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering
Electronic Notes in Theoretical Computer Science (ENTCS)
Incremental pattern matching in the viatra model transformation system
Proceedings of the third international workshop on Graph and model transformations
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Detecting Patterns of Poor Design Solutions Using Constraint Propagation
MoDELS '08 Proceedings of the 11th international conference on Model Driven Engineering Languages and Systems
Model Construction with External Constraints: An Interactive Journey from Semantics to Syntax
MoDELS '08 Proceedings of the 11th international conference on Model Driven Engineering Languages and Systems
Solving Constraints in Model Transformations
ICMT '09 Proceedings of the 2nd International Conference on Theory and Practice of Model Transformations
Constraint solving over semirings
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
CSP(M): Constraint Satisfaction Problem over Models
MODELS '09 Proceedings of the 12th International Conference on Model Driven Engineering Languages and Systems
Generalized symbolic execution for model checking and testing
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
FASE'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Fundamental approaches to software engineering
OCL and graph-transformations: a symbiotic alliance to alleviate the frame problem
MoDELS'05 Proceedings of the 2005 international conference on Satellite Events at the MoDELS
Counterexample-Guided abstraction refinement for the analysis of graph transformation systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Constructive techniques for meta- and model-level reasoning
MODELS'07 Proceedings of the 10th international conference on Model Driven Engineering Languages and Systems
A model-driven framework for guided design space exploration
ASE '11 Proceedings of the 2011 26th IEEE/ACM International Conference on Automated Software Engineering
Model-based automated and guided configuration of embedded software systems
ECMFA'12 Proceedings of the 8th European conference on Modelling Foundations and Applications
Lessons learned from building model-driven development tools
Software and Systems Modeling (SoSyM)
Hi-index | 0.00 |
In early phases of designing complex systems, models are not sufficiently detailed to serve as an input for automated synthesis tools. Instead, a design space is constituted by multiple models representing different valid design candidates. Design space exploration aims at searching through these candidates defined in the design space to find solutions that satisfy the structural and numeric design constraints and provide a balanced choice with respect to various quality metrics. Design space exploration in an model-driven engineering (MDE) context is frequently tackled as specific sort of constraint satisfaction problem (CSP). In CSP, declarative constraints capture restrictions over variables with finite domains where both the number of variables and their domains are required to be a priori finite. However, the existing formulation of constraint satisfaction problems can be too restrictive to capture design space exploration in many MDE applications with complex structural constraints expressed over the underlying models. In this paper, we interpret flexible and dynamic constraint satisfaction problems directly in the context of models. These extensions allow the relaxation of constraints during a solving process and address problems that are subject to change and require incremental re-evaluation. Furthermore, we present our prototype constraint solver for the domain of graph models built upon the Viatra2 model transformation framework and provide an evaluation of its performance with comparison to related tools.