Publicação
Target oriented relational model finding
| Resumo: | Model finders are becoming useful in many software engineering problems. Kodkod 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. |
|---|---|
| Autores principais: | Cunha, Alcino |
| Outros Autores: | Macedo, Nuno Filipe Moreira; Guimarães, Tiago Miguel Moreira |
| Assunto: | Model repair |
| Ano: | 2014 |
| País: | Portugal |
| Tipo de documento: | comunicação em conferência |
| Tipo de acesso: | acesso aberto |
| Instituição associada: | Universidade do Minho |
| Idioma: | inglês |
| Origem: | RepositóriUM - Universidade do Minho |
| _version_ | 1867438146272100352 |
|---|---|
| author | Cunha, Alcino |
| author2 | Macedo, Nuno Filipe Moreira Guimarães, Tiago Miguel Moreira |
| author2_role | author author |
| author_facet | Cunha, Alcino Macedo, Nuno Filipe Moreira Guimarães, Tiago Miguel Moreira |
| author_role | author |
| contributor_name_str_mv | RepositóriUM - Universidade do Minho |
| country_str | PT |
| creators_json_txt | [{\"Person.name\":\"Cunha, Alcino\"},{\"Person.name\":\"Macedo, Nuno Filipe Moreira\"},{\"Person.name\":\"Guimarães, Tiago Miguel Moreira\"}] |
| datacite.contributors.contributor.contributorName.fl_str_mv | RepositóriUM - Universidade do Minho |
| datacite.creators.creator.creatorName.fl_str_mv | Cunha, Alcino Macedo, Nuno Filipe Moreira Guimarães, Tiago Miguel Moreira |
| datacite.date.Accepted.fl_str_mv | 2014-01-01T00:00:00Z |
| datacite.date.available.fl_str_mv | 2015-10-22T13:22:18Z |
| datacite.date.embargoed.fl_str_mv | 2015-10-22T13:22:18Z |
| datacite.rights.fl_str_mv | http://purl.org/coar/access_right/c_abf2 |
| datacite.subjects.subject.fl_str_mv | Model repair |
| datacite.titles.title.fl_str_mv | Target oriented relational model finding |
| dc.contributor.none.fl_str_mv | RepositóriUM - Universidade do Minho |
| dc.creator.none.fl_str_mv | Cunha, Alcino Macedo, Nuno Filipe Moreira Guimarães, Tiago Miguel Moreira |
| dc.date.Accepted.fl_str_mv | 2014-01-01T00:00:00Z |
| dc.date.available.fl_str_mv | 2015-10-22T13:22:18Z |
| dc.date.embargoed.fl_str_mv | 2015-10-22T13:22:18Z |
| dc.format.none.fl_str_mv | application/pdf |
| dc.identifier.none.fl_str_mv | https://hdl.handle.net/1822/37709 |
| dc.language.none.fl_str_mv | eng |
| dc.publisher.none.fl_str_mv | Springer |
| dc.rights.none.fl_str_mv | http://purl.org/coar/access_right/c_abf2 |
| dc.subject.none.fl_str_mv | Model repair |
| dc.title.fl_str_mv | Target oriented relational model finding |
| dc.type.none.fl_str_mv | http://purl.org/coar/resource_type/c_5794 |
| description | Model finders are becoming useful in many software engineering problems. Kodkod 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. |
| dirty | 0 |
| eu_rights_str_mv | openAccess |
| format | conferencePaper |
| fulltext.url.fl_str_mv | https://repositorium.uminho.pt/bitstreams/cd1d897a-6099-4d88-9e86-d9eab11aa4a0/download |
| id | rum_a2929a0d99e4115e045a8381bbcd8df3 |
| identifier.url.fl_str_mv | https://hdl.handle.net/1822/37709 |
| instacron_str | repositorium |
| institution | Universidade do Minho |
| instname_str | Universidade do Minho |
| language | eng |
| network_acronym_str | rum |
| network_name_str | RepositóriUM - Universidade do Minho |
| oai_identifier_str | oai:repositorium.uminho.pt:1822/37709 |
| organization_str_mv | urn:organizationAcronym:repositorium |
| person_str_mv | Cunha, Alcino Macedo, Nuno Filipe Moreira Guimarães, Tiago Miguel Moreira |
| publishDate | 2014 |
| publisher.none.fl_str_mv | Springer |
| reponame_str | RepositóriUM - Universidade do Minho |
| repository_id_str | urn:repositoryAcronym:rum |
| service_str_mv | urn:repositoryAcronym:rum |
| spelling | engSpringerporModel finders are becoming useful in many software engineering problems. Kodkod 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.application/pdfporTarget oriented relational model findingCunha, AlcinoMacedo, Nuno Filipe MoreiraGuimarães, Tiago Miguel MoreiraHostingInstitutionOrganizationalRepositóriUM - Universidade do Minhoe-mailmailto:repositorium@usdb.uminho.ptrepositorium@usdb.uminho.ptISBNIsPartOf978-3-642-54803-1ISSNIsPartOf0302-9743DOIIsPartOf10.1007/978-3-642-54804-8_22015-10-22T13:22:18Z20142014-01-01T00:00:00ZHandlehttps://hdl.handle.net/1822/37709http://purl.org/coar/access_right/c_abf2open accessModel repair487220 bytesother research producthttp://purl.org/coar/resource_type/c_5794conference paperhttp://purl.org/coar/access_right/c_abf2application/pdffulltexthttps://repositorium.uminho.pt/bitstreams/cd1d897a-6099-4d88-9e86-d9eab11aa4a0/download |
| spellingShingle | Target oriented relational model finding Cunha, Alcino Model repair |
| status | SINGLETON |
| subject.fl_str_mv | Model repair |
| title | Target oriented relational model finding |
| title_full | Target oriented relational model finding |
| title_fullStr | Target oriented relational model finding |
| title_full_unstemmed | Target oriented relational model finding |
| title_short | Target oriented relational model finding |
| title_sort | Target oriented relational model finding |
| topic | Model repair |
| topic_facet | Model repair |
| url | https://hdl.handle.net/1822/37709 |
| visible | 1 |