Sciweavers

179 search results - page 23 / 36
» Lazy Evaluation for OCL
Sort
View
ML
2008
ACM
15 years 1 months ago
Unrestricted pure call-by-value recursion
Call-by-value languages commonly restrict recursive definitions by only allowing functions and syntactically explicit values in the right-hand sides. As a consequence, some very a...
Johan Nordlander, Magnus Carlsson, Andy Gill
CORR
2007
Springer
126views Education» more  CORR 2007»
15 years 1 months ago
Linear Tabling Strategies and Optimizations
Recently there has been a growing interest of research in tabling in the logic programming community because of its usefulness in a variety of application domains including progra...
Neng-Fa Zhou, Taisuke Sato, Yi-Dong Shen
ICDE
2006
IEEE
149views Database» more  ICDE 2006»
16 years 3 months ago
An Efficient XPath Query Processor for XML Streams
Streaming XPath evaluation algorithms must record a potentially exponential number of pattern matches when both predicates and descendant axes are present in queries, and the XML ...
Yi Chen, Susan B. Davidson, Yifeng Zheng
MODELLIERUNG
2010
15 years 3 months ago
A Change Metamodel for the Evolution of MOF-Based Metamodels
: The evolution of software systems often produces incompatibilities with existing data and applications. To prevent incompatibilities, changes have to be wellplanned, and develope...
Erik Burger, Boris Gruschko
ENTCS
2008
87views more  ENTCS 2008»
15 years 2 months ago
A Lightweight Approach for the Semantic Validation of Model Refinements
Model Driven Engineering proposes the use of models at different levels of ion. Step by step validation of model refinements is necessary to guarantee the correctness of the final ...
Claudia Pons, Diego García