The University of Southampton
University of Southampton Institutional Repository

A verified algebra for read-write linked data

A verified algebra for read-write linked data
A verified algebra for read-write linked data
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.
linked data, sparql
1-30
Horne, Ross
4847dccd-7a84-44b7-9402-341d942c9427
Sassone, Vladimiro
df7d3c83-2aa0-4571-be94-9473b07b03e7
Horne, Ross
4847dccd-7a84-44b7-9402-341d942c9427
Sassone, Vladimiro
df7d3c83-2aa0-4571-be94-9473b07b03e7

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

Record type: Article

Abstract

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.

Text
sparqlUpAlgSubm.pdf - Author's Original
Download (195kB)
Text
UpdateAlg.pdf - Other
Download (309kB)

More information

Submitted date: January 2012
Keywords: linked data, sparql
Organisations: Web & Internet Science

Identifiers

Local EPrints ID: 273248
URI: http://eprints.soton.ac.uk/id/eprint/273248
PURE UUID: c084a6dd-e3ff-4e4e-947b-569beca8e65a

Catalogue record

Date deposited: 29 Feb 2012 21:10
Last modified: 30 Sep 2020 16:33

Export record

Contributors

Author: Ross Horne
Author: Vladimiro Sassone

University divisions

Download statistics

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

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×