We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
We define a program semantics that is preserved by dependence-based slicing algorithms. It is a natural extension, to non-terminating programs, of the semantics introduced by Wei...
Richard W. Barraclough, David Binkley, Sebastian D...
Seamless exchange of models among different modeling tools increasingly becomes a crucial prerequisite for the success of modeldriven engineering. Current best practices use model ...
Gerti Kappel, Horst Kargl, Thomas Reiter, Werner R...
The concept of probabilistic Latent Semantic Analysis (pLSA) has gained much interest as a tool for feature transformation in image categorization and scene recognition scenarios. ...
Data provenance graphs are form of metadata that can be used to establish a variety of properties of data products that undergo sequences of transformations, typically specified as...
Paolo Missier, Satya Sanket Sahoo, Jun Zhao, Carol...