Sciweavers

1000 search results - page 119 / 200
» Nominal rewriting systems
Sort
View
AISC
2008
Springer
13 years 12 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,...
ENTCS
2008
106views more  ENTCS 2008»
13 years 10 months ago
Reduction Semantics and Formal Analysis of Orc Programs
Orc is a language for orchestration of web services developed by J. Misra that offers simple, yet powerful and elegant, constructs to program sophisticated web orchestration appli...
Musab AlTurki, José Meseguer
ENTCS
2006
168views more  ENTCS 2006»
13 years 10 months ago
Case Study: Model Transformations for Time-triggered Languages
In this study, we introduce a model transformation tool for a time-triggered language: Giotto. The tool uses graphs to represent the source code (Giotto) and the target (the sched...
Tivadar Szemethy
ENTCS
2006
113views more  ENTCS 2006»
13 years 10 months ago
Mining Propositional Simplification Proofs for Small Validating Clauses
The problem of obtaining small conflict clauses in SMT systems has received a great deal of attention recently. We report work in progress to find small subsets of the current par...
Ian Wehrman, Aaron Stump
VLDB
2011
ACM
245views Database» more  VLDB 2011»
13 years 4 months ago
Normalization and optimization of schema mappings
Schema mappings are high-level specifications that describe the relationship between two database schemas. They are an important tool in several areas of database research, notab...
Georg Gottlob, Reinhard Pichler, Vadim Savenkov