Sciweavers

721 search results - page 40 / 145
» Stability for Effective Algebras
Sort
View
CORR
2010
Springer
125views Education» more  CORR 2010»
14 years 12 months ago
Tree Languages Defined in First-Order Logic with One Quantifier Alternation
We study tree languages that can be defined in 2. These are tree languages definable by a first-order formula whose quantifier prefix is , and simultaneously by a first-order for...
Mikolaj Bojanczyk, Luc Segoufin
ICCAD
2005
IEEE
160views Hardware» more  ICCAD 2005»
15 years 8 months ago
Equivalence verification of polynomial datapaths with fixed-size bit-vectors using finite ring algebra
— This paper addresses the problem of equivalence verification of RTL descriptions. The focus is on datapathoriented designs that implement polynomial computations over fixed-s...
Namrata Shekhar, Priyank Kalla, Florian Enescu, Si...
ACSD
2006
IEEE
148views Hardware» more  ACSD 2006»
15 years 5 months ago
Functional Model Exploration for Multimedia Applications via Algebraic Operators
An optimized functional design space exploration method for multimedia applications is proposed. The basis of the method is a way of representing the dependency and the concurrenc...
Shinjiro Kakita, Yosinori Watanabe, Douglas Densmo...
PDSE
1998
108views more  PDSE 1998»
15 years 1 months ago
An Algebraic Framework for Optimizing Parallel Programs
This paper proposes a theoretical framework for verifying and deriving code optimizations for programs written in parallel programming languages. The key idea of this framework is...
Ichiro Satoh
AMAST
1998
Springer
15 years 4 months ago
An Algebraic View of Program Composition
Abstract. We propose a general categorical setting for modeling program composition in which the call-by-value and call-by-name disciplines fit as special cases. Other notions of c...
Pietro Cenciarelli