Sciweavers

1882 search results - page 81 / 377
» Transformational Programming and Forests
Sort
View
CIBSE
2009
ACM
15 years 2 months ago
Product Derivation in a Model-Driven Software Product Line using Decision Models
We present a mechanism to derivate products of Software Product Lines (SPLs) using decision models. Our approach to create SPLs is based on Model Driven Engineering principles. It ...
Hugo Arboleda, Andrés Romero, Rubby Casalla...
SODA
2012
ACM
225views Algorithms» more  SODA 2012»
13 years 7 days ago
Approximating rooted Steiner networks
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
Joseph Cheriyan, Bundit Laekhanukit, Guyslain Nave...
ENTCS
2002
148views more  ENTCS 2002»
14 years 9 months ago
A Declarative Debugging System for Lazy Functional Logic Programs
We present a declarative debugger for lazy functional logic programs with polymorphic type discipline. Whenever a computed answer is considered wrong by the user (error symptom), ...
Rafael Caballero, Mario Rodríguez-Artalejo
AGTIVE
2007
Springer
15 years 1 months ago
Shaped Generic Graph Transformation
Abstract. Since the systematic evolution of graph-like program models has become important in software engineering, graph transformation has gained much attention in this area. For...
Frank Drewes, Berthold Hoffmann, Dirk Janssens, Ma...
ENTCS
2008
91views more  ENTCS 2008»
14 years 10 months ago
Towards Concrete Syntax Patterns for Logic-based Transformation Rules
Logic meta-programming in Prolog is a powerful way to express program analysis and transformation. However, its use can be difficult and error-prone because it requires programmer...
Malte Appeltauer, Günter Kniesel