Program analysis is harder than verification: a computability perspective

DOI10.1007/978-3-319-96142-2_8zbMath1511.68074OpenAlexW2883500998MaRDI QIDQ6039396

Francesco Ranzato, Roberto Giacobazzi, Patrick Cousot

Publication date: 5 May 2023

Published in: Computer Aided Verification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-96142-2_8

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (3)

Property-driven code obfuscations reinterpreting Jones-optimality in abstract interpretation ⋮ Decoupling the ascending and descending phases in abstract interpretation ⋮ Intensional Kleene and Rice theorems for abstract program semantics

This page was built for publication: Program analysis is harder than verification: a computability perspective