974 search results - page 98 / 195 » Hardware Synthesis from Term Rewriting Systems |
WIDM
2003
ACM
14 years 2 months ago
2003
ACM
Whenever XML data must be shared by heterogeneous applications, transformations between different applicationspecific XML formats are necessary. The state-of-the-art method transf...
RTA
2010
Springer
14 years 27 days ago
2010
Springer
Abstract. In this paper we present our formalization of two important termination techniques for term rewrite systems: the subterm criterion and the reduction pair processor in com...
FSEN
2009
Springer
14 years 26 days ago
2009
Springer
We propose and explore a formal approach for black-box testing asynchronously communicating components in open environments. Asynchronicity poses a challenge for validating and tes...
LDTA
2010
13 years 9 months ago
2010
Real programming languages are often defined using ambiguous context-free grammars. Some ambiguity is intentional while other ambiguity is accidental. A good grammar development e...
CCS
2011
ACM
12 years 9 months ago
2011
ACM
On the one hand, compilers for secure computation protocols, such as FairPlay or FairPlayMP, have significantly simplified the development of such protocols. On the other hand, ...