1175 search results - page 20 / 235 » Abstract computability and algebraic specification |
SAC
2009
ACM
14 years 2 months ago
2009
ACM
We formalize paper fold (origami) by graph rewriting. Origami construction is abstractly described by a rewriting sys), where O is the set of abstract origami’s and ary relation...
ICCAD
2007
IEEE
2007
IEEE
Finding linear building-blocks for RTL synthesis of polynomial datapaths with fixed-size bit-vectors
13 years 11 months ago
Abstract: Polynomial computations over fixed-size bitvectors are found in many practical datapath designs. For efficient RTL synthesis, it is important to identify good decompositi...
SIGMOD
1993
ACM
13 years 11 months ago
1993
ACM
Abstract: We propose a framework for the specification of extensible database systems. A particular goal is to implement a software component for parsing and rule-based optimizatio...
ICCSA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Relational algebra is one of the main topics covered in undergraduate computer science database courses. In this paper, we present a web-based tool designed to automatica...
AMAST
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. This paper shows how systems can be built from their component parts with specified sharing. Its principle contribution is a modular language for configuring systems. A c...