Sciweavers

52 search results - page 4 / 11
» Programmed Graph Rewriting with DEVS
Sort
View
CADE
2007
Springer
14 years 6 months ago
Dependency Pairs for Rewriting with Non-free Constructors
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...
Stephan Falke, Deepak Kapur
CORR
2010
Springer
96views Education» more  CORR 2010»
13 years 5 months ago
Realizing evaluation strategies by hierarchical graph rewriting
We discuss the realization of evaluation strategies for the concurrent constraint-based functional language ccfl within the translation schemata when compiling ccfl programs into t...
Petra Hofstedt
PLILP
1998
Springer
13 years 10 months ago
A Compiler for Rewrite Programs in Associative-Commutative Theories
Abstract. We address the problem of term normalisation modulo associativecommutative (AC) theories, and describe several techniques for compiling many-to-one AC matching and reduce...
Pierre-Etienne Moreau, Hélène Kirchn...
GG
2004
Springer
13 years 11 months ago
Extending Graph Rewriting for Refactoring
Refactorings are transformations that change the structure of a program, while preserving the behavior. The topic has attracted a lot of attention recently, since it is a promising...
Niels Van Eetvelde, Dirk Janssens
MODELS
2010
Springer
13 years 4 months ago
Transforming Process Models: Executable Rewrite Rules versus a Formalized Java Program
Abstract. In the business process management community, transformations for process models are usually programmed using imperative languages (such as Java). The underlying mapping ...
Pieter Van Gorp, Rik Eshuis