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: | James Smith |
---|---|
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 |
Similar Items
-
Proving acceptability properties of relaxed nondeterministic approximate programs
by: Carbin, Michael James, et al.
Published: (2012) -
Templates as heuristics for proving properties of medical devices
by: Michael Harrison, et al.
Published: (2015-12-01) -
Proving Properties of Programs on Hierarchical Nominative Data
by: Ievgen Ivanov, et al.
Published: (2016-12-01) -
Using simulation techniques to prove timing properties
by: Luchangco, Victor
Published: (2007) -
Impossible to prove
by: Nielsen, Philippa
Published: (2013)