“…Existing verification techniques for CAS often focus on specific subroutines or functions [6,7,13,21,25,26,30,31], such as a specific theorems [28], differential equations [23], or the implementation of the math.h library [29]. Most common are verification approaches that rely on intermediate verification languages [6,21,23,25,26], such as Boogie [2,30] or Why3 [5,26], which, in turn, rely on proof assistants and theorem provers, such as Coq [4,6], Isabelle [23,33], or HOL Light [20,21,25]. Kaliszyk and Wiedijk [25] proposed on entire new CAS which is built on top of the proof assistant HOL Light so that each simplification step can be proven by the underlying architecture.…”