4485 search results - page 395 / 897 » Equivalences on Observable Processes |
183
click to vote
ICCAD
2008
IEEE
16 years 3 months ago
2008
IEEE
Abstract— This paper addresses the problem of solving finite word-length (bit-vector) arithmetic with applications to equivalence verification of arithmetic datapaths. Arithmet...
168
click to vote
ICCAD
2005
IEEE
16 years 3 months ago
2005
IEEE
Technology mapping based on DAG-covering suffers from the problem of structural bias: the structure of the mapped netlist depends strongly on the subject graph. In this paper we ...
178
click to vote
DCC
2010
IEEE
16 years 1 months ago
2010
IEEE
Word-based compression over natural language text has shown to be a good choice to trade compression ratio and speed, obtaining compression ratios close to 30% and very fast decom...
221
click to vote
PADS
2009
ACM
16 years 1 months ago
2009
ACM
Semantic composability aims to ensure that the composition of simulation components is meaningful in terms of their expressed behavior, and achieves the desired objective of the n...
237
click to vote
ECMDAFA
2009
Springer
16 years 1 months ago
2009
Springer
The need for a design language that is rigorous but accessible and intuitive is often at odds with the formal and mathematical nature of languages used for analysis. UML and Petri ...