Sciweavers

1882 search results - page 106 / 377
» Transformational Programming and Forests
Sort
View
SAC
2006
ACM
15 years 3 months ago
Evaluation of rule-based modularization in model transformation languages illustrated with ATL
This paper studies ways for modularizing transformation definitions in current rule-based model transformation languages. Two scenarios are shown in which the modular units are id...
Ivan Kurtev, Klaas van den Berg, Fréd&eacut...
JLP
2007
114views more  JLP 2007»
14 years 9 months ago
Deaccumulation techniques for improving provability
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automatic verification often fails for functions with accumulating arg...
Jürgen Giesl, Armin Kühnemann, Janis Voi...
PLDI
2011
ACM
14 years 21 days ago
Evaluating value-graph translation validation for LLVM
Translation validators are static analyzers that attempt to verify that program transformations preserve semantics. Normalizing translation validators do so by trying to match the...
Jean-Baptiste Tristan, Paul Govereau, Greg Morrise...
WEBI
2007
Springer
15 years 4 months ago
Extending XML Query Language Xcerpt by Ontology Queries
The paper addresses a problem of combining XML querying with ontology reasoning. We present an extension of a rule-based XML query and transformation language Xcerpt. The extensio...
Wlodzimierz Drabent, Artur Wilk
IFL
2005
Springer
103views Formal Methods» more  IFL 2005»
15 years 3 months ago
Accurate Step Counting
Abstract Starting with an evaluator for a language, an abstract machine for the same language can be mechanically derived using successive program transformations. This has relevan...
Catherine Hope, Graham Hutton