A tree-based approach to data flow proofs

DOI10.1007/978-3-030-03592-1_1zbMath1403.68040OpenAlexW2901735173MaRDI QIDQ1629956

Alexander Nutz, Andreas Podelski, Jochen Hoenicke

Publication date: 7 December 2018

Full work available at URL: https://doi.org/10.1007/978-3-030-03592-1_1

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Why does Astrée scale up?
• Inductive data flow graphs
• Verification of parameterized concurrent programs by modular reasoning about data and control
• Horn Clause Solvers for Program Verification
• Refinement of Trace Abstraction
• An axiomatic basis for computer programming

This page was built for publication: A tree-based approach to data flow proofs