This paper proposes a new approach for proving arithmetic correctness of data paths in System-on-Chip modules. It complements existing techniques which are, for reasons of complexi...
Oliver Wienand, Markus Wedler, Dominik Stoffel, Wo...
efined abstract representation of a semantic path that respects the ontological classes of a particular semantic network. A discrete "walker" utilizes the grammar to dete...
This paper presents a novel research investigation on legal amount recognition of unconstrained cursive handwritten Chinese character in the environment of A2iA CheckReaderTM ? a ...
Ching Y. Suen, Emmanuel Augustin, Hanshen Tang, Mo...
Runtime assertion checking is useful for debugging programs and specifications. Existing tools check invariants as well as method preand postconditions, but mostly ignore assignabl...
In this paper, we study the property of generic uniform observability for structured bilinear systems. More precisely, to check whether or not a structured bilinear system generic...