Sciweavers

331 search results - page 3 / 67
» When are Two Rewrite Systems More than None
Sort
View
AISC
2008
Springer
13 years 11 months ago
Search Techniques for Rational Polynomial Orders
Polynomial interpretations are a standard technique used in almost all tools for proving termination of term rewrite systems (TRSs) automatically. Traditionally, one applies interp...
Carsten Fuhs, Rafael Navarro-Marset, Carsten Otto,...
ANLP
2000
126views more  ANLP 2000»
13 years 11 months ago
The Automatic Translation of Discourse Structures
We empirically show that there are significant differences between the discourse structure of Japanese texts and the discourse structure of their corresponding English translation...
Daniel Marcu, Lynn Carlson, Maki Watanabe
FASE
2007
Springer
14 years 4 months ago
Declared Type Generalization Checker: An Eclipse Plug-In for Systematic Programming with More General Types
The Declared Type Generalization Checker is a plug-in for Eclipse’s Java Development Tools (JDT) that supports developers in systematically finding and using better fitting types...
Markus Bach, Florian Forster, Friedrich Steimann
FCT
1999
Springer
14 years 2 months ago
Tile Transition Systems as Structured Coalgebras
The aim of this paper is to investigate the relation between two models of concurrent systems: tile rewrite systems and coalgebras. Tiles are rewrite rules with side e ects which a...
Andrea Corradini, Reiko Heckel, Ugo Montanari
RTSS
1997
IEEE
14 years 2 months ago
More optimism about real-time distributed commit processing
In [6], we proposed a new commit protocol, OPT, specially designed for use in distributed firm-deadline real-time database systems. OPT allows transactions to “optimistically...
Ramesh Gupta, Jayant R. Haritsa, Krithi Ramamritha...