Sciweavers

12 search results - page 2 / 3
» Automatic Groups and String Rewriting
Sort
View
RTA
2005
Springer
14 years 4 months ago
On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
Alfons Geser, Dieter Hofbauer, Johannes Waldmann, ...
CIKM
2005
Springer
14 years 4 months ago
Access control for XML: a dynamic query rewriting approach
We introduce the notion of views as a mechanism for securing and providing access control in the context of XML. Research in XML has explored several efficient querying mechanism...
Sriram Mohan, Arijit Sengupta, Yuqing Wu
IVC
2008
101views more  IVC 2008»
13 years 10 months ago
A system for processing handwritten bank checks automatically
In the US and many other countries, bank checks are preprinted with the account number and the check number in MICR ink and format; as such, these two numeric fields can be easily...
Rafael Palacios, Amar Gupta
LACL
2005
Springer
14 years 4 months ago
A Note on the Complexity of Constraint Interaction: Locality Conditions and Minimalist Grammars
Locality Conditions (LCs) on (unbounded) dependencies have played a major role in the development of generative syntax ever since the seminal work by Ross [22]. Descriptively, they...
Hans-Martin Gärtner, Jens Michaelis
ECOOP
2007
Springer
14 years 2 months ago
Synchronizing Refactored UML Class Diagrams and OCL Constraints
UML class diagrams are usually annotated with OCL expressions that constrain their possible instantiation. In our work we have investigated how OCL annotations can be automatically...
Slavisa Markovic, Thomas Baar