Automated program verification made SYMPLAR: symbolic permissions for lightweight automated reasoning

@inproceedings{Bierhoff2011AutomatedPV,
  title={Automated program verification made SYMPLAR: symbolic permissions for lightweight automated reasoning},
  author={Kevin Bierhoff},
  booktitle={Onward!},
  year={2011}
}
Research in automated program verification against specifications written in first-order logic has come a long way. Ever-faster Satisfiability Modulo Theories (SMT) solvers [Barrett et al. 2010] promise to verify program instructions quickly against specifications. Unfortunately, aliasing still prevents automated program verification tools from easily and soundly verifying interesting programs. This paper introduces the use of symbolic permissions as the basis for sound automated program… CONTINUE READING
4 Citations
11 References
Similar Papers

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…