Sciweavers

422 search results - page 12 / 85
» On combinations of CMA equalizers
Sort
View
66
Voted
ENTCS
2008
89views more  ENTCS 2008»
14 years 9 months ago
CC(X): Semantic Combination of Congruence Closure with Solvable Theories
We present a generic congruence closure algorithm for deciding ground formulas in the combination of the theory of equality with uninterpreted symbols and an arbitrary built-in so...
Sylvain Conchon, Evelyne Contejean, Johannes Kanig...
FMCAD
2004
Springer
15 years 3 months ago
Non-miter-based Combinational Equivalence Checking by Comparing BDDs with Different Variable Orders
This paper describes a new method that is useful in combinational equivalence checking with very challenging industrial designs. The method does not build a miter; instead it build...
In-Ho Moon, Carl Pixley
MCS
2000
Springer
15 years 1 months ago
Combining Fisher Linear Discriminants for Dissimilarity Representations
Abstract Investigating a data set of the critical size makes a classification task difficult. Studying dissimilarity data refers to such a problem, since the number of samples equa...
Elzbieta Pekalska, Marina Skurichina, Robert P. W....
FROCOS
2011
Springer
13 years 9 months ago
Sharing Is Caring: Combination of Theories
One of the main shortcomings of the traditional methods for combining theories is the complexity of guessing the arrangement of the variables shared by the individual theories. Thi...
Dejan Jovanovic, Clark Barrett
MEMOCODE
2003
IEEE
15 years 2 months ago
Executable Computational Logics: Combining Formal Methods and Programming Language Based System Design
An executable computational logic can provide the desired bridge between formal system properties and formal methods to verify them on the one hand, and executable models of syste...
José Meseguer