Sciweavers

168 search results - page 11 / 34
» Imperative Program Transformation by Rewriting
Sort
View
ENTCS
2007
144views more  ENTCS 2007»
13 years 8 months ago
Partial Order Reduction for Rewriting Semantics of Programming Languages
Software model checkers are typically language-specific, require substantial development efforts, and are hard to reuse for other languages. Adding partial order reduction (POR)...
Azadeh Farzan, José Meseguer
ENTCS
2007
168views more  ENTCS 2007»
13 years 8 months ago
Bytecode Rewriting in Tom
In this paper, we present a term rewriting based library for manipulating Java bytecode. We define a mapping from bytecode programs to algebraic terms, and we use Tom, an extensi...
Emilie Balland, Pierre-Etienne Moreau, Antoine Rei...
QOSA
2010
Springer
14 years 17 days ago
Evaluating Maintainability with Code Metrics for Model-to-Model Transformations
Using model-to-model transformations to generate analysis models or code from architecture models is sought to promote compliance and reuse of components. The maintainability of tr...
Lucia Kapová, Thomas Goldschmidt, Steffen B...
IANDC
2008
131views more  IANDC 2008»
13 years 8 months ago
Termination of just/fair computations in term rewriting
The main goal of this paper is to apply rewriting termination technology --enjoying a quite mature set of termination results and tools-- to the problem of proving automatically t...
Salvador Lucas, José Meseguer
LCPC
1995
Springer
14 years 5 days ago
V-cal: A Calculus for the Compilation of Data Parallel Languages
V-cal is a calculus designed to support the compilation of data parallel languages that allows to describe program transformations and optimizations as semantics preserving rewrite...
P. F. G. Dechering, J. A. Trescher, J. P. M. de Vr...