Sciweavers

884 search results - page 134 / 177
» The Linear Logic of Multisets
Sort
View
LICS
2010
IEEE
13 years 7 months ago
Addition-Invariant FO and Regularity
We consider formulas which, in addition to the symbols in the vocabulary, may use two designated symbols ≺ and + that must be interpreted as a linear order and its associated ad...
Nicole Schweikardt, Luc Segoufin
SAT
2010
Springer
174views Hardware» more  SAT 2010»
13 years 7 months ago
A System for Solving Constraint Satisfaction Problems with SMT
Abstract. SAT Modulo Theories (SMT) consists of deciding the satisfiability of a formula with respect to a decidable background theory, such as linear integer arithmetic, bit-vect...
Miquel Bofill, Josep Suy, Mateu Villaret
GLVLSI
2011
IEEE
351views VLSI» more  GLVLSI 2011»
13 years 29 days ago
Design of low-power multiple constant multiplications using low-complexity minimum depth operations
Existing optimization algorithms for the multiplierless realization of multiple constant multiplications (MCM) typically target the minimization of the number of addition and subt...
Levent Aksoy, Eduardo Costa, Paulo F. Flores, Jos&...
EON
2008
13 years 10 months ago
Abductive Synthesis of the Mediator Scenario with jABC and GEM
We reuse here the framework, the setting, and the semantic modelling for the automated synthesis of the SWS Challenge Mediator presented in the companion paper [5], and show how to...
Christian Kubczak, Tiziana Margaria, Matthias Kais...
LICS
2012
IEEE
11 years 11 months ago
An Automata Model for Trees with Ordered Data Values
—Data trees are trees in which each node, besides carrying a label from a finite alphabet, also carries a data value infinite domain. They have been used as an abstraction mode...
Tony Tan