Sciweavers

325 search results - page 10 / 65
» Rewriting Strategies in Java
Sort
View
AMAST
2008
Springer
14 years 11 months ago
Towards an Efficient Implementation of Tree Automata Completion
Term Rewriting Systems (TRSs) are now commonly used as a modeling language for applications. In those rewriting based models, reachability analysis, i.e. proving or disproving that...
Emilie Balland, Yohan Boichut, Thomas Genet, Pierr...
VLDB
2004
ACM
97views Database» more  VLDB 2004»
15 years 2 months ago
CHICAGO: A Test and Evaluation Environment for Coarse-Grained Optimization
Relational OLAP tools and other database applications generate sequences of SQL statements that are sent to the database server as result of a single information request issued by...
Tobias Kraft, Holger Schwarz
81
Voted
ENTCS
2008
114views more  ENTCS 2008»
14 years 9 months ago
Term-graph Rewriting in Tom Using Relative Positions
In this paper, we present the implementation in Tom of a de Bruijn indices generalization allowing the representation of term-graphs over an algebraic signature. By adding pattern...
Emilie Balland, Paul Brauner
ENTCS
2007
104views more  ENTCS 2007»
14 years 9 months ago
Lazy Context Cloning for Non-Deterministic Graph Rewriting
We define a rewrite strategy for a class of non-confluent constructor-based term graph rewriting systems and discuss its correctness. Our strategy and its extension to narrowing...
Sergio Antoy, Daniel W. Brown, Su-Hui Chiang
ACL
2011
14 years 1 months ago
Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems
We study the problem of finding the best headdriven parsing strategy for Linear ContextFree Rewriting System productions. A headdriven strategy must begin with a specified right...
Pierluigi Crescenzi, Daniel Gildea, Andrea Marino,...