1000 search results - page 68 / 200 » Nominal rewriting systems |
IEEEPACT
2007
IEEE
14 years 2 months ago
2007
IEEE
With the advent of chip-multiprocessors, we are faced with the challenge of parallelizing performance-critical software. Transactional memory (TM) has emerged as a promising progr...
CADE
2004
Springer
14 years 8 months ago
2004
Springer
LRR [3] is a rewriting system developed at the Computer Science Department of University of Houston. LRR has two subsystems: Smaran (for tabled rewriting), and TGR (for untabled re...
SYNASC
2008
IEEE
14 years 2 months ago
2008
IEEE
We formalize paper fold (origami) by graph rewriting. Origami tion is abstractly described by a rewrite system (O, ), where set of abstract origami’s and is a binary relation on ...
RTA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. In this paper it is described how a combination of polynomial interpretations, recursive path order, RFC match-bounds, the dependency pair method and semantic labelling c...
EDBT
2004
ACM
14 years 7 months ago
2004
ACM
Given the current trend towards application interoperability and XML-based data integration, there is an increasing need for XML interfaces to relational database management system...