A Theory of Singly-Linked Lists and its Extensible Decision Procedure

@article{Ranise2006ATO,
  title={A Theory of Singly-Linked Lists and its Extensible Decision Procedure},
  author={Silvio Ranise and Calogero G. Zarba},
  journal={Fourth IEEE International Conference on Software Engineering and Formal Methods (SEFM'06)},
  year={2006},
  pages={206-215}
}
The key to many approaches to reason about pointer based data structures is the availability of a decision procedure to automatically discharge proof obligations in a theory encompassing data, pointers, and the reachability relation induced by pointers. So far, only approximate solutions have been proposed which abstract either the data or the reachability component. Indeed, such approximations cause a lack of precision in the verification techniques where the decision procedures are exploited… CONTINUE READING
Highly Cited
This paper has 38 citations. REVIEW CITATIONS

References

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

Combining container data structures with non-stably infinite theories of elements

S. Ranise, C. Ringeissen, C. G. Zarba
Proc. of the Int. Workshop on Frontiers of Combining Systems (FroCos’05), LNCS, • 2005
View 5 Excerpts
Highly Influenced

Some techniques for proving correctness of programs which alter data structures

R. M. Burstall
Machine Intelligence, 7:23–50, • 1972
View 4 Excerpts
Highly Influenced

Verifying Reachability Invariants of Linked Structures

POPL • 1983
View 4 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…