Analyzing Program Analyses

DOI10.1145/2676726.2676987zbMath1345.68106OpenAlexW2106647551MaRDI QIDQ2819811

Roberto Giacobazzi, Francesco Logozzo, Francesco Ranzato

Publication date: 29 September 2016

Published in: Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2676726.2676987

zbMATH Keywords

abstract interpretationabstract domain

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (4)

Deciding program properties via complete abstractions on bounded domains ⋮ Property-driven code obfuscations reinterpreting Jones-optimality in abstract interpretation ⋮ Local completeness logic on Kleene algebra with tests ⋮ Maximal incompleteness as obfuscation potency

This page was built for publication: Analyzing Program Analyses