Sciweavers

147 search results - page 23 / 30
» Unfolding semantics of graph transformation
Sort
View
JGAA
2002
86views more  JGAA 2002»
14 years 11 months ago
Planar Graphs with Topological Constraints
We address in this paper the problem of constructing embeddings of planar graphs satisfying declarative, user-defined topological constraints. The constraints consist each of a cy...
Christoph Dornheim
PLDI
2011
ACM
14 years 2 months 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...
SIGADA
2004
Springer
15 years 5 months ago
A refactoring tool for Ada 95
Refactoring is a technique for restructuring code to improve its design. A tool for automatically applying refactoring transformations to Ada 95 programs is described. The tool is...
Paul Anderson
KDD
1994
ACM
116views Data Mining» more  KDD 1994»
15 years 3 months ago
Exception Dags as Knowledge Structures
: The problem of transforming the knowledge bases of performance systems using induced rules or decision trees into comprehensible knowledgestructures is addressed. A knowledgestru...
Brian R. Gaines
SEMWEB
2007
Springer
15 years 5 months ago
SODA: an OWL-DL based Ontology Matching System
This paper describes SODA a novel ontology alignment method for the OWL-DL format. SODA uses a new approach that consists in computing local and semantic similarities among ontolog...
Sami Zghal, Sadok Ben Yahia, Engelbert Mephu Nguif...