Proving Properties of Rich Internet Applications
We introduce application layer specifications, which allow us to reason about the state and transactions of rich Internet applications. We define variants of the state/event based logic UCTL* along with two example applications to demonstrate this approach, and then look at a distributed, rich Inter...
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2013-07-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1308.0391v1 |
id |
doaj-87571e42c3724431b5400220527c08d7 |
---|---|
record_format |
Article |
spelling |
doaj-87571e42c3724431b5400220527c08d72020-11-25T01:45:58ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802013-07-01123Proc. WWV 2013496310.4204/EPTCS.123.6Proving Properties of Rich Internet ApplicationsJames SmithWe introduce application layer specifications, which allow us to reason about the state and transactions of rich Internet applications. We define variants of the state/event based logic UCTL* along with two example applications to demonstrate this approach, and then look at a distributed, rich Internet application, proving properties about the information it stores and disseminates. Our approach enables us to justify proofs about abstract properties that are preserved in the face of concurrent, networked inputs by proofs about concrete properties in an Internet setting. We conclude that our approach makes it possible to reason about the programs and protocols that comprise the Internet's application layer with reliability and generality.http://arxiv.org/pdf/1308.0391v1 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
James Smith |
spellingShingle |
James Smith Proving Properties of Rich Internet Applications Electronic Proceedings in Theoretical Computer Science |
author_facet |
James Smith |
author_sort |
James Smith |
title |
Proving Properties of Rich Internet Applications |
title_short |
Proving Properties of Rich Internet Applications |
title_full |
Proving Properties of Rich Internet Applications |
title_fullStr |
Proving Properties of Rich Internet Applications |
title_full_unstemmed |
Proving Properties of Rich Internet Applications |
title_sort |
proving properties of rich internet applications |
publisher |
Open Publishing Association |
series |
Electronic Proceedings in Theoretical Computer Science |
issn |
2075-2180 |
publishDate |
2013-07-01 |
description |
We introduce application layer specifications, which allow us to reason about the state and transactions of rich Internet applications. We define variants of the state/event based logic UCTL* along with two example applications to demonstrate this approach, and then look at a distributed, rich Internet application, proving properties about the information it stores and disseminates. Our approach enables us to justify proofs about abstract properties that are preserved in the face of concurrent, networked inputs by proofs about concrete properties in an Internet setting. We conclude that our approach makes it possible to reason about the programs and protocols that comprise the Internet's application layer with reliability and generality. |
url |
http://arxiv.org/pdf/1308.0391v1 |
work_keys_str_mv |
AT jamessmith provingpropertiesofrichinternetapplications |
_version_ |
1725021587972816896 |