Lightweight string reasoning in model finding
| Autor: | Fabian Büttner, Jordi Cabot |
|---|---|
| Přispěvatelé: | Modeling Technologies for Software Production, Operation, and Evolution (ATLANMOD), Laboratoire d'Informatique de Nantes Atlantique (LINA), Mines Nantes (Mines Nantes)-Université de Nantes (UN)-Centre National de la Recherche Scientifique (CNRS)-Mines Nantes (Mines Nantes)-Université de Nantes (UN)-Centre National de la Recherche Scientifique (CNRS)-Département informatique - EMN, Mines Nantes (Mines Nantes)-Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), LINA, Mines Nantes (Mines Nantes) |
| Rok vydání: | 2013 |
| Předmět: |
Constraint Handling Rules
Theoretical computer science Programming language Computer science String (computer science) Solver Constraint satisfaction computer.software_genre [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL] String operations Modeling and Simulation Constraint logic programming Constraint programming computer Software Object Constraint Language computer.programming_language |
| Zdroj: | Software and Systems Modeling Software and Systems Modeling, 2013, ⟨10.1007/s10270-013-0332-x⟩ |
| ISSN: | 1619-1374 1619-1366 |
| DOI: | 10.1007/s10270-013-0332-x |
| Popis: | International audience; Models play a key role in assuring software quality in the model-driven approach. Precise models usually require the definition of well-formedness rules to specify constraints that cannot be expressed graphically. The Object Constraint Language (OCL) is a de-facto standard to define such rules. Techniques that check the satisfiability of such models and find corresponding instances of them are important in various activities, such as model-based testing and validation. Several tools for these activities have been developed, but to our knowledge, none of them supports OCL string operations on scale that is sufficient for, e.g., model-based testing. As, in contrast, many industrial models do contain such operations, there is evidently a gap. We present a lightweight solver that is specifically tailored to generate large solutions for tractable string constraints in model finding, and that is suitable for directly express the main operations of the OCL datatype String. It is based on constraint logic programming (CLP) and constraint handling rules (CHR), and can be seamlessly combined with other constraint solvers in CLP. We have integrated our solver into the EMFtoCSP model finder, and we show that our implementation efficiently solves several common string constraints on a large instances. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink