DOM: Specification and Client Reasoning

Raad, Azalea; Santos, José Augusto Rodrigues dos; Gardner, Philippa

doi:10.1007/978-3-319-47958-3_21

Cited by 3 publications

(5 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Fig. 2 shows the most important interfaces of the Core DOM using Web IDL [22], a formal notation used in the standard [24]. For each class (expressed as an interface in Web IDL), the Core DOM formalization introduces a HOL datatype representing a typed pointer.…”

Section: The Core Dommentioning

confidence: 99%

See 1 more Smart Citation

A Formally Verified Model of Web Components

Brucker

Herzberg

2020

Formal Aspects of Component Software

View full text Add to dashboard Cite

The trend towards ever more complex client-side web applications is unstoppable. Compared to traditional software development, client-side web development lacks a well-established component model, i. e., a method for easily and safely reusing already developed functionality. To address this issue, the web community started to adopt shadow trees as part of the Document Object Model (DOM). Shadow trees allow developers to "partition" a DOM instance into parts that should be safely separated, e. g., code modifying one part should not unintentionally affect other parts of the DOM. While shadow trees provide the technical basis for defining web components, the DOM standard neither defines the concept of web components nor specifies the safety properties that web components should guarantee. Consequently, the standard also does not discuss how or even if the methods for modifying the DOM respect component boundaries. In this paper, we present a formally verified model of web components and define safety properties which ensure that different web components can only interact with each other using well-defined interfaces. Moreover, our verification of the application programming interface (API) of the DOM revealed numerous invariants that implementations of the DOM API need to preserve to ensure the integrity of components.

show abstract

Section: The Core Dommentioning

confidence: 99%

“…On the Relationship Between the "DOM Standard" and the "Shadow DOM Standard." The development of shadow trees started in the context of the dedicated "Shadow DOM" standard [23]. This standard has been considered obsolete since at least March 2018, as shadow trees have been integrated into the DOM standard [24] itself.…”

Section: Introductionmentioning

confidence: 99%

A Formally Verified Model of Web Components

Brucker

Herzberg

2020

Formal Aspects of Component Software

View full text Add to dashboard Cite

show abstract

“…Our DOM typed formalization shares several design decision with the type-safe DOM API of Thiemann [20]. The most closely related works are [9,17,18] in which the authors present a nonexecutable, non-extensible, and non-mechanized operational semantics of a minimal DOM and show how this semantics can be used for Hoare-style reasoning for analyzing heaps of DOMs. The authors focus on providing a formal foundation for reasoning over client-side JavaScript programs that modify the DOM.…”

Section: Related Workmentioning

confidence: 99%

“…Thus, web browsers should be developed as rigidly and formally as operating systems. While formal methods are a well-established technique in the development of operating systems (see, e. g., Klein [15] for an overview), there are few proposals for improving the development of web browsers using formal approaches [2,9,12,17].…”

Section: Introductionmentioning

confidence: 99%

A Formal Semantics of the Core DOM in Isabelle/HOL

Brucker

Herzberg

2018

Companion of the the Web Conference 2018 on the Web Conference 2018 - WWW '18

View full text Add to dashboard Cite

At its core, the Document Object Model (DOM) deines a tree-like data structure for representing documents in general and HTML documents in particular. It is the heart of any modern web browser. Formalizing the key concepts of the DOM is a prerequisite for the formal reasoning over client-side JavaScript programs and for the analysis of security concepts in modern web browsers. We present a formalization of the core DOM, with focus on the node-tree and the operations deined on node-trees, in Isabelle/HOL. We use the formalization to verify the functional correctness of the most important functions deined in the DOM standard. Moreover, our formalization is (1) extensible, i.e., can be extended without the need of reproving already proven properties and (2) executable, i.e., we can generate executable code from our speciication.

show abstract

“…We may investigate how to reason about the DOM using JaVerT, building on the work of Raad et al [2016]. We are also looking for ways to reuse the infrastructure behind JaVerT for other styles of JavaScript analysis.…”

Section: Javert: Verifying Javascript Programsmentioning

confidence: 99%

JaVerT: JavaScript verification toolchain

Santos

Maksimovic

Naudžiūnienė

et al. 2017

Proc. ACM Program. Lang.

Self Cite

View full text Add to dashboard Cite

The dynamic nature of JavaScript and its complex semantics make it a difficult target for logic-based verification. We introduce JaVerT, a semi-automatic JavaScript Verification Toolchain, based on separation logic and aimed at the specialist developer wanting rich, mechanically verified specifications of critical JavaScript code. To specify JavaScript programs, we design abstractions that capture its key heap structures (for example, prototype chains and function closures), allowing the developer to write clear and succinct specifications with minimal knowledge of the JavaScript internals. To verify JavaScript programs, we develop JaVerT, a verification pipeline consisting of: JS-2-JSIL, a well-tested compiler from JavaScript to JSIL, an intermediate goto language capturing the fundamental dynamic features of JavaScript; JSIL Verify, a semi-automatic verification tool based on a sound JSIL separation logic; and verified axiomatic specifications of the JavaScript internal functions. Using JaVerT, we verify functional correctness properties of: data-structure libraries (key-value map, priority queue) written in an object-oriented style; operations on data structures such as binary search trees (BSTs) and lists; examples illustrating function closures; and test cases from the official ECMAScript test suite. The verification times suggest that reasoning about larger, more complex code using JaVerT is feasible. INTRODUCTIONSeparation logic was developed in order to reason about programs that manipulate data structures in the heap. The reasoning has been shown to be tractable, with compositional techniques that scale [Reynolds 2002] and properly engineered tools applied to real-world code. In particular, separation logic has been used to reason about programs written in static languages: for example, the semi-automatic verification tool Verifast [Jacobs et al. 2011] for reasoning about C and Java Authors' addresses: José Fragoso Santos, Imperial College London, UK, jose.fragoso.santos@imperial.ac.uk; Petar Maksimović, Imperial College London, UK, petar.maksimovic@imperial.ac.uk, Mathematical Institute SASA, Serbia; Daiva Naudžiūnienė, Imperial College London, UK, daiva.naudziuniene@imperial.ac.uk; Thomas Wood, Imperial College London, UK, thomas.wood@imperial.ac.uk; Philippa Gardner, Imperial College London, UK, p.gardner@imperial.ac.uk.Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the owner/author(s). 50:2 J. Fragoso Santos, P. Maksimović, D. Naudžiūnienė, T. Wood, P. Gardner programs; the automatic verification tool Infer [Calcagno et al. 2015], being developed at Facebook, for reasoning about C, Java, C++ and Objective C programs; and the interactive Coq development for reasoning about, f...

show abstract

DOM: Specification and Client Reasoning

Abstract: We present an axiomatic specification of a key fragment of DOM using structural separation logic. This specification allows us to develop modular reasoning about client programs that call the DOM.

Cited by 3 publications

References 21 publications

A Formally Verified Model of Web Components

A Formally Verified Model of Web Components

A Formal Semantics of the Core DOM in Isabelle/HOL

JaVerT: JavaScript verification toolchain

Contact Info

Product

Resources

About