References

1. node.js. Available at http://nodejs.org/.
2. OAuth2.0. Available at http://oauth.net/2/.
3. PCI SSC Data Security Standards Overview. Available at https://www.pcisecuritystandards.org/security_standards/.
4. QuICDoc. Available at http://www.doc.ic.ac.uk/~jes204/quicdoc.zip.
5. Devdatta Akhawe, Adam Barth, Peifung E. Lam, John C. Mitchell & Dawn Song (2010): Towards a Formal Foundation of Web Security. In: CSF, pp. 290–304. Available at http://doi.ieeecomputersociety.org/10.1109/CSF.2010.27.
6. Jürgen Bohn, Werner Damm, Orna Grumberg, Hardi Hungar & Karen Laster (1998): First-Order-CTL Model Checking. In: FSTTCS. Available at http://dx.doi.org/10.1007/b71635.
7. Alin Deutsch, Liying Sui & Victor Vianu (2007): Specification and verification of data-driven Web applications. J. Comput. Syst. Sci. 73(3), pp. 442–474. Available at http://dx.doi.org/10.1016/j.jcss.2006.10.006.
8. E. Allen Emerson & Joseph Y. Halpern (1983): "Sometimes" and "not never" revisited. POPL '83. ACM, New York, NY, USA, pp. 127–140. Available at http://doi.acm.org/10.1145/567067.567081.
9. Alessandro Fantechi, Stefania Gnesi, Alessandro Lapadula, Franco Mazzanti, Rosario Pugliese & Francesco Tiezzi (2012): A logical verification methodology for service-oriented computing. ACM Trans. Softw. Eng. Methodol.. Available at http://doi.acm.org/10.1145/2211616.2211619.
10. Philippa Gardner, Sergio Maffeis & Gareth David Smith (2012): Towards a program logic for JavaScript. In: POPL, pp. 31–44. Available at http://doi.acm.org/10.1145/2103656.2103663.
11. Zef Hemel, Danny M. Groenewegen, Lennart C. L. Kats & Eelco Visser (2011): Static consistency checking of web applications with WebDSL. J. Symb. Comput. 46(2), pp. 150–182. Available at http://dx.doi.org/10.1016/j.jsc.2010.08.006.
12. Daniel R. Licata & Shriram Krishnamurthi (2004): Verifying Interactive Web Programs. In: ASE, pp. 164–173. Available at http://doi.ieeecomputersociety.org/10.1109/ASE.2004.10054.
13. Michael C. Martin, V. Benjamin Livshits & Monica S. Lam (2005): Finding application errors and security flaws using PQL: a program query language. In: OOPSLA, pp. 365–383. Available at http://doi.acm.org/10.1145/1094811.1094840.
14. Markus Müller-Olm, David A. Schmidt & Bernhard Steffen (1999): Model-Checking: A Tutorial Introduction. In: SAS, pp. 330–354. Available at http://dx.doi.org/10.1007/3-540-48294-6_22.
15. Lawrence C. Paulson (1999): Inductive Analysis of the Internet Protocol TLS. ACM Trans. Inf. Syst. Secur. 2(3), pp. 332–351. Available at http://doi.acm.org/10.1145/322510.322530.
16. Anders P. Ravn, JiríSrba & Saleem Vighio (2010): A Formal Analysis of the Web Services Atomic Transaction Protocol with UPPAAL. In: ISoLA (1), pp. 579–593. Available at http://dx.doi.org/10.1007/978-3-642-16558-0_47.
17. Jan Rutten & Daniele Turi (1994): Initial Algebra and Final Coalgebra Semantics for Concurrency.
18. James Smith (2013): Concur - An Algorithm for Merging Concurrent Changes without Conflicts. Available at http://arxiv.org/abs/1303.7462.
19. James Smith (2013): State-event based versus purely Action or State based Logics. Available at http://arxiv.org/abs/1303.7459.

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org