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 ide...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
2012-01.
|
| Subjects: | |
| Online Access: | Get fulltext Get fulltext |
| Summary: | 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. |
|---|