Firecrow

Maras, Josip; Štula, Maja; Carlson, Jan

doi:10.1145/2642937.2648620

Cited by 1 publication

(1 citation statement)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Other tools detect parts of web pages that render differently in different browsers [Choudhary et al 2012;Mesbah and Prasad 2011;Roy Choudhary et al 2010]. Finally, some tools help developers transfer styles or content between web pages [Maras et al 2012[Maras et al , 2014. These heuristic tools are useful, and could be integrated with Troika; however, they do not provide sound guarantees.…”

Section: Debugging Web Page Layoutsmentioning

confidence: 99%

Modular verification of web page layout

Panchekha

Ernst

Tatlock

et al. 2019

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

Automated verification can ensure that a web page satisfies accessibility, usability, and design properties regardless of the end user's device, preferences, and assistive technologies. However, state-of-the-art verification tools for layout properties do not scale to large pages because they rely on whole-page analyses and must reason about the entire page using the complex semantics of the browser layout algorithm. This paper introduces and formalizes modular layout proofs. A modular layout proof splits a monolithic verification problem into smaller verification problems, one for each component of a web page. Each component specification can use rely/guarantee-style preconditions to make it verifiable independently of the rest of the page and enabling reuse across multiple pages. Modular layout proofs scale verification to pages an order of magnitude larger than those supported by previous approaches. We prototyped these techniques in a new proof assistant, Troika. In Troika, a proof author partitions a page into components and writes specifications for them. Troika then verifies the specifications, and uses those specifications to verify whole-page properties. Troika also enables the proof author to verify different component specifications with different verification tools, leveraging the strengths of each. In a case study, we use Troika to verify a large web page and demonstrate a speed-up of 13ś1469× over existing tools, taking verification time from hours to seconds. We develop a systematic approach to writing Troika proofs and demonstrate it on 8 proofs of properties from prior work to show that modular layout proofs are short, easy to write, and provide benefits over existing tools. CCS Concepts: • Software and its engineering → Software maintenance tools.

show abstract