1. STORRE
  2. Faculty of Natural Sciences
  3. Computing Science and Mathematics
  4. Computing Science and Mathematics Conference Papers and Proceedings
Please use this identifier to cite or link to this item: http://hdl.handle.net/1893/575
Full metadata record
DC FieldValueLanguage
dc.contributor.authorTurner, Kenneth Jen_UK
dc.contributor.editorWang, Fen_UK
dc.date.accessioned2017-08-21T22:26:17Z-
dc.date.available2017-08-21T22:26:17Z-
dc.date.issued2005-10en_UK
dc.identifier.urihttp://hdl.handle.net/1893/575-
dc.description.abstractDespite the popularity of web services, creating them manually is an intricate task. Composite web services are defined using the evolving standard for BPEL (Business Process Execution Logic). It is explained how CRESS (Chisel Representation Employing Systematic Specification) has been extended to meet the challenge of graphically and formally describing web services. Sample CRESS descriptions are presented of web services. These are automatically translated into LOTOS, permitting rigorous analysis and automated validation.en_UK
dc.language.isoenen_UK
dc.publisherSpringer Verlagen_UK
dc.relationTurner KJ (2005) Formalising Web Services. In: Wang F (ed.) Formal Techniques for Networked and Distributed Systems - FORTE 2005: 25th IFIP WG 6.1 International Conference, Taipei, Taiwan, October 2-5, 2005. Proceedings. Lecture Notes in Computer Science 3731, volume 3731. 25th IFIP WG 6.1 International Conference on Formal Techniques for Networked and Distributed Systems (FORTE XVIII), Taipei, Japan, 02.10.2005-05.10.2005. Berlin: Springer Verlag, pp. 473-488. https://doi.org/10.1007/11562436en_UK
dc.relation.ispartofseriesLecture Notes in Computer Science 3731, volume 3731en_UK
dc.rightsPublished by Springer Verlag. The original publication is available at www.springerlink.comen_UK
dc.titleFormalising Web Servicesen_UK
dc.typeConference Paperen_UK
dc.identifier.doi10.1007/11562436en_UK
dc.citation.spage473en_UK
dc.citation.epage488en_UK
dc.citation.publicationstatusPublisheden_UK
dc.citation.peerreviewedRefereeden_UK
dc.type.statusAM - Accepted Manuscripten_UK
dc.author.emailkjt@cs.stir.ac.uken_UK
dc.citation.btitleFormal Techniques for Networked and Distributed Systems - FORTE 2005: 25th IFIP WG 6.1 International Conference, Taipei, Taiwan, October 2-5, 2005. Proceedingsen_UK
dc.citation.conferencedates2005-10-02 - 2005-10-05en_UK
dc.citation.conferencelocationTaipei, Japanen_UK
dc.citation.conferencename25th IFIP WG 6.1 International Conference on Formal Techniques for Networked and Distributed Systems (FORTE XVIII)en_UK
dc.citation.isbn978-3-540-29189-3en_UK
dc.publisher.addressBerlinen_UK
dc.contributor.affiliationComputing Scienceen_UK
dc.identifier.wtid831280en_UK
dcterms.dateAccepted2005-10-31en_UK
dc.date.filedepositdate2008-11-25en_UK
rioxxterms.typeConference Paper/Proceeding/Abstracten_UK
rioxxterms.versionAMen_UK
local.rioxx.authorTurner, Kenneth J|en_UK
local.rioxx.projectInternal Project|University of Stirling|https://isni.org/isni/0000000122484331en_UK
local.rioxx.contributorWang, F|en_UK
local.rioxx.freetoreaddate2008-11-25en_UK
local.rioxx.licencehttp://www.rioxx.net/licenses/all-rights-reserved|2008-11-25|en_UK
local.rioxx.filenameform-web.pdfen_UK
local.rioxx.filecount1en_UK
local.rioxx.source978-3-540-29189-3en_UK
Appears in Collections:Computing Science and Mathematics Conference Papers and Proceedings

Files in This Item:
File Description SizeFormat 
form-web.pdfFulltext - Accepted Version113.57 kBAdobe PDFView/Open


This item is protected by original copyright

View License
Show simple item record


Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

The metadata of the records in the Repository are available under the CC0 public domain dedication: No Rights Reserved https://creativecommons.org/publicdomain/zero/1.0/

If you believe that any material held in STORRE infringes copyright, please contact library@stir.ac.uk providing details and we will remove the Work from public display in STORRE and investigate your claim.