GRASShopper - Complete Heap Verification with Mixed Specifications

By R. Piskac, Thomas Wies, D. Zufferey. 2014

68 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Gated Graph Sequence Neural Networks (2015, background): “Static program analysis tools (e.g., (Piskac et al., 2014)) can check whether a candidate formula is sufficient to prove the desired properties (e.g., memory safety).”
Learning Shape Analysis (2017, methodology): “This can be checked using a complete program verifier such as GRASShopper by using ϕh ∧ ϕ` as precondition of a procedure whose body is assert false.”
Learning to Decipher the Heap for Program Verification (2016, background): “Given a candidate description, tools from static program verification (Piskac et al., 2014) can determine whether the description is accurate and whether the description allows one to prove that the program satisfies the desired properties (e.g., memory safety).”