Mostrar el registro sencillo del ítem

Artículo

dc.creatorOakes, Bentley Jameses
dc.creatorTroya Castilla, Javieres
dc.creatorLúcio, Levyes
dc.creatorWimmer, Manueles
dc.date.accessioned2018-04-25T09:39:16Z
dc.date.available2018-04-25T09:39:16Z
dc.date.issued2016
dc.identifier.citationOakes, B.J., Troya Castilla, J., Lúcio, L. y Wimmer, M. (2016). Full contract verification for ATL using symbolic execution. Software and Systems Modeling, 2016, 1-35.
dc.identifier.issn1619-1366es
dc.identifier.urihttps://hdl.handle.net/11441/73568
dc.description.abstractThe Atlas Transformation Language (ATL) is currently one of the most used model transformation languages and has become a de facto standard in model-driven engineering for implementing model transformations. At the same time, it is understood by the community that enhancing methods for exhaustively verifying such transformations allows for a more widespread adoption of model-driven engineering in industry. A variety of proposals for the verification of ATL transformations have arisen in the past few years. However, the majority of these techniques are either based on non-exhaustive testing or on proof methods that require human assistance and/or are not complete. In this paper, we describe our method for statically verifying the declarative subset of ATL model transformations. This verification is performed by translating the transformation (including features like filters, OCL expressions, and lazy rules) into our model transformation language DSLTrans. As we handle only the declarative portion of ATL, and DSLTrans is Turing-incomplete, this reduction in expressivity allows us to use a symbolic-execution approach to generate representations of all possible input models to the transformation. We then verify pre-/post-condition contracts on these representations, which in turn verifies the transformation itself. The technique we present in this paper is exhaustive for the subset of declarative ATL model transformations. This means that if the prover indicates a contract holds on a transformation, then the contract’s pre-/post-condition pair will be true for any input model for that transformation. We demonstrate and explore the applicability of our technique by studying several relatively large and complex ATL model transformations, including a model transformation developed in collaboration with our industrial partner. As well, we present our ‘slicing’ technique. This technique selects only those rules in the DSLTrans transformation needed for contract proof, thereby reducing proving timees
dc.description.sponsorshipComisión Interministerial de Ciencia y Tecnología TIN2015-70560-Res
dc.description.sponsorshipJunta de Andalucía P10-TIC-5906es
dc.description.sponsorshipJunta de Andalucía P12-TIC-1867es
dc.formatapplication/pdfes
dc.language.isoenges
dc.publisherSpringeres
dc.relation.ispartofSoftware and Systems Modeling, 2016, 1-35.
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internacional*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.subjectModel transformationes
dc.subjectATLes
dc.subjectFormal verificationes
dc.subjectSymbolic executiones
dc.subjectContractses
dc.subjectPre-/Post-conditionses
dc.titleFull contract verification for ATL using symbolic executiones
dc.typeinfo:eu-repo/semantics/articlees
dcterms.identifierhttps://ror.org/03yxnpp24
dc.type.versioninfo:eu-repo/semantics/submittedVersiones
dc.rights.accessRightsinfo:eu-repo/semantics/openAccesses
dc.contributor.affiliationUniversidad de Sevilla. Departamento de Lenguajes y Sistemas Informáticoses
dc.relation.projectIDTIN2015-70560-Res
dc.relation.projectIDP10-TIC-5906es
dc.relation.projectIDP12-TIC-1867es
dc.relation.publisherversionhttps://link.springer.com/article/10.1007%2Fs10270-016-0548-7es
dc.identifier.doi10.1007/s10270-016-0548-7es
idus.format.extent36es
dc.journaltitleSoftware and Systems Modelinges
dc.publication.volumen2016es
dc.publication.initialPage1es
dc.publication.endPage35es

FicherosTamañoFormatoVerDescripción
paper_sosym_2016.pdf5.646MbIcon   [PDF] Ver/Abrir  

Este registro aparece en las siguientes colecciones

Mostrar el registro sencillo del ítem

Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Excepto si se señala otra cosa, la licencia del ítem se describe como: Attribution-NonCommercial-NoDerivatives 4.0 Internacional