A Discipline for Program Verification Based on Backpointers and Its Use in Observational Disjointness

@inproceedings{Kassios2013ADF,
  title={A Discipline for Program Verification Based on Backpointers and Its Use in Observational Disjointness},
  author={Ioannis T. Kassios and Eleftherios Kritikos},
  booktitle={ESOP},
  year={2013}
}
In the verification of programs that manipulate the heap, logics that emphasize localized reasoning, such as separation logic, are being used extensively. In such logics, state conditions may only refer to parts of the heap that are reachable from the stack. However, the correct implementation of some data structures is based on state conditions that depend on unreachable locations. For example, reference counting depends on the invariant that “the number of nodes pointing to a certain node is… CONTINUE READING
2 Citations
20 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-2 of 2 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 20 references

The need for flexible object invariants

  • A. Summers, S. Drossopoulou, P. Müller
  • In IWACO ’09, pages 1–9. ACM,
  • 2009
Highly Influential
3 Excerpts

P

  • R. Bornat, C. Calcagno
  • O’Hearn, and M. Parkinson. Permission accounting…
  • 2005
Highly Influential
7 Excerpts

The Spec# specification language: an overview

  • M. Barnett, K.R.M. Leino, W. Schulte
  • In G. Barthe, L. Burdy, M. Huisman, J.-L. Lanet…
  • 2004
Highly Influential
7 Excerpts

Similar Papers

Loading similar papers…