论文信息 - Local Reasoning about Mashups

Local Reasoning about Mashups

Web mashups are complex programs that dynamically compose data and code from many sources. Whereas data is sometimes formally specified by XML schema, code never is. This makes it difficult to construct reliable software. Using local Hoare reasoning, introduced in separation logic to reason about e.g. C programs and extended in context logic to reason about e.g. the DOM library, we are able to reason about mashup programs, proving that they are fault-free and providing specifications for code that are analogous to XML schema for data.

Philippa Gardner | Gareth Smith | Adam Wright

[1] Peter Thiemann. A Type Safe DOM API , 2005, DBPL.

[2] Peter W. O'Hearn,et al. Local Reasoning about Programs that Alter Data Structures , 2001, CSL.

[3] C. A. R. HOARE,et al. An axiomatic basis for computer programming , 1969, CACM.

[4] Philippa Gardner,et al. DOM: Towards a Formal Specification , 2008, PLAN-X.

[5] Benjamin C. Pierce,et al. XDuce: A statically typed XML processing language , 2003, TOIT.

[6] Hongseok Yang,et al. Nested Hoare Triples and Frame Rules for Higher-Order Store , 2009, CSL.

[7] Matthew J. Parkinson,et al. jStar: towards practical verification for java , 2008, OOPSLA.

[8] Ankur Taly,et al. An Operational Semantics for JavaScript , 2008, APLAS.

[9] Charles Reis,et al. Architectural Principles for Safe Web Programs , 2007, HotNets.

[10] John C. Reynolds,et al. Separation logic: a logic for shared mutable data structures , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[11] Philippa Gardner,et al. Context logic and tree update , 2005, POPL '05.

[12] Philippa Gardner,et al. Local Hoare reasoning about DOM , 2008, PODS.

[13] Helen J. Wang,et al. Subspace: secure cross-domain communication for web mashups , 2007, WWW '07.

[14] Klaus Ostermann,et al. Modular logic metaprogramming , 2010, OOPSLA.