Sciweavers

557 search results - page 35 / 112
» Useful Transformations in Answer set programming
Sort
View
CIBSE
2009
ACM
14 years 18 days 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...
POPL
2004
ACM
14 years 8 months ago
Incremental execution of transformation specifications
We aim to specify program transformations in a declarative style, and then to generate executable program transformers from such specifications. Many transformations require non-t...
Ganesh Sittampalam, Oege de Moor, Ken Friis Larsen
CC
2010
Springer
172views System Software» more  CC 2010»
14 years 2 months ago
Verifying Local Transformations on Relaxed Memory Models
The problem of locally transforming or translating programs without altering their semantics is central to the construction of correct compilers. For concurrent shared-memory progr...
Sebastian Burckhardt, Madanlal Musuvathi, Vasu Sin...
MICRO
1997
IEEE
141views Hardware» more  MICRO 1997»
14 years 4 days ago
Unroll-and-Jam Using Uniformly Generated Sets
Modern architectural trends in instruction-level parallelism (ILP) are to increase the computational power of microprocessors significantly. As a result, the demands on memory ha...
Steve Carr, Yiping Guan
RTA
2010
Springer
13 years 11 months ago
Declarative Debugging of Missing Answers for Maude
Abstract. Declarative debugging is a semi-automatic technique that starts from an incorrect computation and locates a program fragment responsible for the error by building a tree ...
Adrián Riesco, Alberto Verdejo, Narciso Mar...