Reachability analysis for annotated code

  • Authors:
  • Mikoláš Janota;Radu Grigore;Michal Moskal

  • Affiliations:
  • University College Dublin, Belfield, Dublin, Ireland;University College Dublin, Belfield, Dublin, Ireland;University of Wroclaw, Wroclaw, Poland

  • Venue:
  • Proceedings of the 2007 conference on Specification and verification of component-based systems: 6th Joint Meeting of the European Conference on Software Engineering and the ACM SIGSOFT Symposium on the Foundations of Software Engineering
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Well-specified programs enable code reuse and therefore techniques that help programmers to annotate code correctly are valuable. We devised an automated analysis that detects unreachable code in the presence of code annotations. We implemented it as an enhancement of the extended static checker ESC/Java2 where it serves as a check of coherency of specifications and code. In this article we define the notion of semantic unreachability, describe an algorithm for checking it and demonstrate on a case study that it detects a class of errors previously undetected, as well as describe different scenarios of these errors.