Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHorne, Rossen
dc.contributor.authorSassone, Vladimiroen
dc.identifier.citationHorne, R., & Sassone, V. (2013). A verified algebra for read–write Linked Data. Science of Computer Programming, 89, 2-22.en
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.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: [].en
dc.subjectOperational semanticsen
dc.subjectLinked Dataen
dc.titleA Verified Algebra for Read-Write Linked Dataen
dc.typeJournal Articleen
dc.contributor.schoolSchool of Computer Engineeringen
dc.description.versionAccepted versionen
item.fulltextWith Fulltext-
Appears in Collections:SCSE Journal Articles
Files in This Item:
File Description SizeFormat 
UpdateAlg.pdf212.65 kBAdobe PDFThumbnail

Citations 50

Updated on Jan 28, 2023

Web of ScienceTM
Citations 50

Updated on Jan 30, 2023

Page view(s)

Updated on Feb 3, 2023

Download(s) 50

Updated on Feb 3, 2023

Google ScholarTM




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