Run-time correctness checking is algorithmically undecidablefor pointer data

@inproceedings{Auguston1998RuntimeCC,
  title={Run-time correctness checking is algorithmically undecidablefor pointer data},
  author={structuresMikhail Auguston and Vladik Kreinovich and Luc Longpr},
  year={1998}
}
Programs routinely use complicated pointer (linked list-type) data structures such as linked lists, doubly linked lists, diierent types of trees, etc. These data structures are usually deened inductively: e.g., a tree can be deened as a structure that results from an empty tree by an arbitrary sequence of adding and deleting elements. When the program runs, these data structures take dynamically changing shapes. To test program correctness, it is important to check, at run-time, whether a… CONTINUE READING