dc.contributor.author | Tveretina, Olga | |
dc.contributor.author | Zaichenkov, Pavel | |
dc.contributor.author | Shafarenko, Alex | |
dc.date.accessioned | 2020-08-06T00:06:25Z | |
dc.date.available | 2020-08-06T00:06:25Z | |
dc.date.issued | 2020-08-05 | |
dc.identifier.citation | Tveretina , O , Zaichenkov , P & Shafarenko , A 2020 , ' Non-Local Configuration of Component Interfaces by Constraint Satisfaction ' , Constraints , vol. 25 , pp. 21–159 . https://doi.org/10.1007/s10601-020-09309-y | |
dc.identifier.issn | 1572-9354 | |
dc.identifier.uri | http://hdl.handle.net/2299/23048 | |
dc.description | © 2020 Springer-Verlag. The final publication is available at Springer via https://doi.org/10.1007/s10601-020-09309-y. | |
dc.description.abstract | Service-oriented computing is the paradigm that utilises services as fundamental elements for developing applications. Service composition, where data consistency becomes especially important, is still a key challenge for service-oriented computing. We maintain that there is one aspect of Web service communication on the data conformance side that has so far escaped the researchers attention. Aggregation of networked services gives rise to long pipelines, or quasi-pipeline structures, where there is a profitable form of inheritance called flow inheritance. In its presence, interface reconciliation ceases to be a local procedure, and hence it requires distributed constraint satisfaction of a special kind. We propose a constraint language for this, and present a solver which implements it. In addition, our approach provides a binding between the language and C++, whereby the assignment to the variables found by the solver is automatically translated into a transformation of C++ code. This makes the C++ Web service context compliant without any further communication. Besides, it uniquely permits a very high degree of flexibility of a C++ coded Web service without making public any part of its source code. | en |
dc.format.extent | 347340 | |
dc.language.iso | eng | |
dc.relation.ispartof | Constraints | |
dc.subject | Interface Configuration | |
dc.subject | Constraint Language | |
dc.subject | Constraint Satisfaction | |
dc.subject | Constraint language | |
dc.subject | Constraint satisfaction | |
dc.subject | Interface configuration | |
dc.subject | Software | |
dc.subject | Artificial Intelligence | |
dc.subject | Discrete Mathematics and Combinatorics | |
dc.subject | Computational Theory and Mathematics | |
dc.title | Non-Local Configuration of Component Interfaces by Constraint Satisfaction | en |
dc.contributor.institution | School of Physics, Engineering & Computer Science | |
dc.contributor.institution | Department of Computer Science | |
dc.contributor.institution | Centre for Computer Science and Informatics Research | |
dc.contributor.institution | Biocomputation Research Group | |
dc.description.status | Peer reviewed | |
dc.date.embargoedUntil | 2021-08-05 | |
dc.identifier.url | http://www.scopus.com/inward/record.url?scp=85089034217&partnerID=8YFLogxK | |
rioxxterms.versionofrecord | 10.1007/s10601-020-09309-y | |
rioxxterms.type | Journal Article/Review | |
herts.preservation.rarelyaccessed | true | |