Conference paper

HOLÍK Lukáš, LENGÁL Ondřej, ROGALEWICZ Adam, SEKANINA Lukáš, VAŠÍČEK Zdeněk and VOJNAR Tomáš. Towards Formal Relaxed Equivalence Checking in Approximate Computing Methodology. In: 2nd Workshop on Approximate Computing (WAPCO 2016). Prague, 2016, pp. 1-6. Available from:
Publication language:english
Original title:Towards Formal Relaxed Equivalence Checking in Approximate Computing Methodology
Proceedings:2nd Workshop on Approximate Computing (WAPCO 2016)
Conference:HiPEAC 2016
+Type Name Title Size Last modified
iconwapco16.pdf236 KB2016-01-23 18:51:54
^ Select all
With selected:
Most design automation methods developed for approximate computing evaluate candidate solutions by applying a set of input vectors and measuring the error of the output vectors with respect to an exact solution. This approach is not, however, applicable when approximating complex combinational or sequential circuits since the error is not computed precisely enough. This paper surveys various methods of formal verification that could be extended for purposes of determining the error of approximation more precisely and formulates this task through a notion of formal relaxed equivalence checking.
   author = {Luk{\'{a}}{\v{s}} Hol{\'{i}}k and Ond{\v{r}}ej
	Leng{\'{a}}l and Adam Rogalewicz and
	Luk{\'{a}}{\v{s}} Sekanina and Zden{\v{e}}k
	Va{\v{s}}{\'{i}}{\v{c}}ek and Tom{\'{a}}{\v{s}}
   title = {Towards Formal Relaxed Equivalence Checking in
	Approximate Computing Methodology},
   pages = {1--6},
   booktitle = {2nd Workshop on Approximate Computing (WAPCO 2016)},
   year = 2016,
   location = {Prague, },
   language = {english},
   url = {}

Your IPv4 address:
Switch to https