Target Oriented Relational Model Finding

• Type: Article in International Conference Proceedings Book
• Date: 2014

Authors

Cunha, A (Author) Other; Macedo, N (Author) Other; Guimarães, T (Author) Other

Conference proceedings International

Title: Fundamental Approaches to Software Engineering - 17th International Conference, FASE 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014, Proceedings

Pages: 17-31

17th International Conference on Fundamental Approaches to Software Engineering, FASE 2014 - Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014

Grenoble, 5 April 2014 through 13 April 2014

Indexing

Scopus - 16 Citations

Other information

Authenticus ID: P-009-GT3

DOI: 10.1007/978-3-642-54804-8_2

Abstract (EN): Model finders are becoming useful in many software engineering problems. Kodkod [19] is one of the most popular, due to its support for relational logic (a combination of first order logic with relational algebra operators and transitive closure), allowing a simpler specification of constraints, and support for partial instances, allowing the specification of a priori (exact, but potentially partial) knowledge about a problem's solution. However, in some software engineering problems, such as model repair or bidirectional model transformation, knowledge about the solution is not exact, but instead there is a known target that the solution should approximate. In this paper we extend Kodkod's partial instances to allow the specification of such targets, and show how its model finding procedure can be adapted to support them (using both PMax-SAT solvers or SAT solvers with cardinality constraints). Two case studies are also presented, including a careful performance evaluation to assess the effectiveness of the proposed extension. © 2014 Springer-Verlag.

Language: English

Type (Professor's evaluation): Scientific