114 search results - page 7 / 23 » Algebraic Translations, Correctness and Algebraic Compiler C... |
FUIN
2007
13 years 7 months ago
2007
We present in this paper the algorithm which performs the translation of MSC’2000 diagrams into Petri net modulo strong bisimulation. The correctness of this algorithm is justifi...
SIGMOD
2007
ACM
14 years 7 months ago
2007
ACM
The Pathfinder XQuery compiler has been enhanced by a new code generator that can target any SQL:1999-compliant relational database system (RDBMS). This code generator marks an im...
PLILP
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. We address the problem of term normalisation modulo associativecommutative (AC) theories, and describe several techniques for compiling many-to-one AC matching and reduce...
EUROPAR
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. Block-recursive codes for dense numerical linear algebra computations appear to be well-suited for execution on machines with deep memory hierarchies because they are e e...
AISC
2010
Springer
13 years 10 months ago
2010
Springer
We prove formally that the first order theory of algebraically closed fields enjoy quantifier elimination, and hence is decidable. This proof is organized in two modular parts. We ...