Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/80958
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHorne, Rossen
dc.contributor.authorSassone, Vladimiroen
dc.date.accessioned2015-12-08T07:54:03Zen
dc.date.accessioned2019-12-06T14:18:18Z-
dc.date.available2015-12-08T07:54:03Zen
dc.date.available2019-12-06T14:18:18Z-
dc.date.issued2014en
dc.identifier.citationHorne, R., & Sassone, V. (2013). A verified algebra for read–write Linked Data. Science of Computer Programming, 89, 2-22.en
dc.identifier.issn0167-6423en
dc.identifier.urihttps://hdl.handle.net/10356/80958-
dc.description.abstractThe aim of this work is to verify an algebra for high level languages for reading and writing Linked Data. Linked Data is raw data published on the Web and interlinked using a collection of standards. The main innovation is simply to use dereferenceable URIs as global identifiers in data, rather than a key local to a dataset. This introduces significant challenges for managing data that is pulled from distributed sources over the Web. An algebra is an essential contribution to this application domain, for rewriting programs that read and write Linked Data. To verify the algebra, a syntax, operational semantics and proof technique are introduced. The syntax provides an abstract representation for a high level language that concisely captures queries and updates over Linked Data. The behaviour of the language is defined using a concise operational semantics. The natural notion of behavioural equivalence, contextual equivalence, is shown to coincide with the bisimulation proof technique. Bisimulation is used to verify that the algebra preserves the operational semantics, hence rewrites of programs using the algebra do not change their operational meaning. A novel combination of techniques is used to establish the correctness of the proof technique itself.en
dc.language.isoenen
dc.relation.ispartofseriesScience of Computer Programmingen
dc.rights© 2013 Elsevier B.V. This is the author created version of a work that has been peer reviewed and accepted for publication by Science of Computer Programming, Elsevier B.V. It incorporates referee’s comments but changes resulting from the publishing process, such as copyediting, structural formatting, may not be reflected in this document. The published version is available at: [http://dx.doi.org/10.1016/j.scico.2013.07.005].en
dc.subjectOperational semanticsen
dc.subjectBisimulationen
dc.subjectLinked Dataen
dc.titleA Verified Algebra for Read-Write Linked Dataen
dc.typeJournal Articleen
dc.contributor.schoolSchool of Computer Engineeringen
dc.identifier.doi10.1016/j.scico.2013.07.005en
dc.description.versionAccepted versionen
item.grantfulltextopen-
item.fulltextWith Fulltext-
Appears in Collections:SCSE Journal Articles
Files in This Item:
File Description SizeFormat 
UpdateAlg.pdf212.65 kBAdobe PDFThumbnail
View/Open

SCOPUSTM   
Citations 50

6
Updated on Jan 28, 2023

Web of ScienceTM
Citations 50

4
Updated on Jan 30, 2023

Page view(s)

271
Updated on Feb 3, 2023

Download(s) 50

130
Updated on Feb 3, 2023

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.