A verified algebra for read-write linked data

Horne, Ross and Sassone, Vladimiro (2012) A verified algebra for read-write linked data. Author's Original, 1-30.


[img] PDF - Author's Original
Download (190Kb)
PDF - Updated Version
Download (302Kb) | Preview


The aim of this work is to verify an algebra for high level languages for reading and writing Linked Data. Linked Data refers to a collection of standards which aim to enhance the world’s data, by interlinking datasets through the Web. The starting point is as simple as using URIs as global identifiers in data, but the technical challenges of managing data in this distributed setting are immense. An algebra is an essential contribution to this application domain. To verify the algebra several useful things are established. A high level language is defined that concisely captures query and update languages for Linked Data. The language is provided with a concise operational semantics. The natural notions of equivalence, contextual equivalence, is shown to coincide with the bisimulation proof technique. Ultimately, bisimulation allows the algebra proven to be correct. Some novel techniques are used in establishing these results.

Item Type: Article
Keywords: linked data, sparql
Divisions : Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Web & Internet Science
ePrint ID: 273248
Accepted Date and Publication Date:
January 2012Submitted
Date Deposited: 29 Feb 2012 21:10
Last Modified: 07 Apr 2016 10:05
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/273248

Actions (login required)

View Item View Item

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics