Verifying Relative Safety, Accuracy, and Termination for Program Approximations

Share

Shaobo He, Shuvendu K. Lahiri, Zvonimir Rakamaric. 8th NASA Formal Methods Symposium (NFM 2016), Minneapolis, MN, USA.
[pdf] [bib]

Abstract: Approximate computing is an emerging area for trading off the accuracy of an application for improved performance, lower energy costs, and tolerance to unreliable hardware. However, developers must ensure that the leveraged approximations do not introduce significant, intolerable divergence from the reference implementation, as specified by several established robustness criteria. In this work, we show the application of automated differential verification towards verifying relative safety, accuracy, and termination criteria for a class of program approximations. We use mutual summaries to express relative specifications for approximations, and SMT-based invariant inference to automate the verification of such specifications. We perform a detailed feasibility study showing promise of applying automated verification to the domain of approximate computing in a cost-effective manner.

Note: An extend version of this paper is available as a journal article and technical report.

Bibtex:

@inproceedings{nfm2016-hlr,
  author = {Shaobo He and Shuvendu K. Lahiri and Zvonimir Rakamari\'c},
  title = {Verifying Relative Safety, Accuracy, and Termination for Program Approximations},
  booktitle = {Proceedings of the 8th NASA Formal Methods Symposium (NFM)},
  series = {Lecture Notes in Computer Science},
  volume = {9690},
  publisher = {Springer},
  editor = {Sanjai Rayadurgam and Oksana Tkachuk},
  year = {2016},
  pages = {237--254},
}