Sciweavers

394 search results - page 21 / 79
» An Abstract Domain of Uninterpreted Functions
Sort
View
ICCAD
2008
IEEE
127views Hardware» more  ICCAD 2008»
14 years 5 months ago
Verification of arithmetic datapaths using polynomial function models and congruence solving
Abstract— This paper addresses the problem of solving finite word-length (bit-vector) arithmetic with applications to equivalence verification of arithmetic datapaths. Arithmet...
Neal Tew, Priyank Kalla, Namrata Shekhar, Sivaram ...
ECAI
2010
Springer
13 years 10 months ago
Learning Aggregation Functions for Expert Search
Abstract. Machine learning techniques are increasingly being applied to problems in the domain of information retrieval and text mining. In this paper we present an application of ...
Ronan Cummins, Mounia Lalmas, Colm O'Riordan
ICST
2009
IEEE
13 years 6 months ago
Proving Functional Equivalence of Two AES Implementations Using Bounded Model Checking
Bounded model checking--as well as symbolic equivalence checking--are highly successful techniques in the hardware domain. Recently, bit-vector bounded model checkers like CBMC ha...
Hendrik Post, Carsten Sinz
ADBIS
2005
Springer
101views Database» more  ADBIS 2005»
14 years 2 months ago
Conceptual Content Management for Software Engineering Processes
A major application area of information systems technology and multimedia content management is that of support systems for engineering processes. This includes the particularly im...
Sebastian Bossung, Hans-Werner Sehring, Michael Sk...
POPL
2009
ACM
14 years 9 months ago
A combination framework for tracking partition sizes
ibe an abstract interpretation based framework for proving relationships between sizes of memory partitions. Instances of this framework can prove traditional properties such as m...
Sumit Gulwani, Tal Lev-Ami, Mooly Sagiv