Abstract domains for type juggling

DOI10.1016/j.entcs.2017.02.003zbMath1412.68033OpenAlexW2597324076WikidataQ113317604 ScholiaQ113317604MaRDI QIDQ1650957

Vincenzo Arceri, Sergio Maffeis

Publication date: 16 July 2018

Full work available at URL: https://doi.org/10.1016/j.entcs.2017.02.003

zbMATH Keywords

static analysisabstract interpretationPHPtype conversions

Mathematics Subject Classification ID

Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (2)

Twinning automata and regular expressions for string static analysis ⋮ Completeness of string analysis for dynamic languages

Uses Software

• JavaScript
• PHP
• JSAI
• Phantm

Cites Work

• ``A la Burstall intermittent assertions induction principles for proving inevitability properties of programs
• Making abstract interpretations complete

This page was built for publication: Abstract domains for type juggling