Sciweavers

1000 search results - page 185 / 200
» Nominal rewriting systems
Sort
View
LDTA
2010
13 years 8 months ago
Faster ambiguity detection by grammar filtering
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...
H. J. S. Basten, Jurgen J. Vinju
CORR
2008
Springer
120views Education» more  CORR 2008»
13 years 8 months ago
XQuery Join Graph Isolation
A purely relational account of the true XQuery semantics can turn any relational database system into an XQuery processor. Compiling nested expressions of the fully compositional X...
Torsten Grust, Manuel Mayr, Jan Rittinger
CORR
2006
Springer
95views Education» more  CORR 2006»
13 years 8 months ago
SAT Solving for Argument Filterings
Abstract. This paper introduces a propositional encoding for lexicographic path orders in connection with dependency pairs. This facilitates the application of SAT solvers for term...
Michael Codish, Peter Schneider-Kamp, Vitaly Lagoo...
ENTCS
2006
101views more  ENTCS 2006»
13 years 8 months ago
Mumbo: A Rule-Based Implementation of a Run-time Program Generation Language
We describe our efforts to use rule-based programming to produce a model of Jumbo, a run-time program generation (RTPG) system for Java. Jumbo incorporates RTPG following the simp...
Baris Aktemur, Samuel N. Kamin
FMSD
2006
131views more  FMSD 2006»
13 years 8 months ago
Specification and analysis of the AER/NCA active network protocol suite in Real-Time Maude
This paper describes the application of the Real-Time Maude tool and the Maude formal methodology to the specification and analysis of the AER/NCA suite of active network multicast...
Peter Csaba Ölveczky, José Meseguer, C...