Sciweavers

958 search results - page 73 / 192
» Model Transformation Languages and Their Implementation by B...
Sort
View
ICLP
2011
Springer
14 years 4 months ago
Constraints in Non-Boolean Contexts
In high-level constraint modelling languages, constraints can occur in non-Boolean contexts: implicitly, in the form of partial functions, or more explicitly, in the form of const...
Leslie De Koninck, Sebastian Brand, Peter J. Stuck...
ENTCS
2007
168views more  ENTCS 2007»
15 years 1 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...
PLDI
2004
ACM
15 years 6 months ago
KISS: keep it simple and sequential
The design of concurrent programs is error-prone due to the interaction between concurrently executing threads. Traditional automated techniques for finding errors in concurrent ...
Shaz Qadeer, Dinghao Wu
ISCAS
1999
IEEE
109views Hardware» more  ISCAS 1999»
15 years 5 months ago
Solution of vector partial differential equations by transfer function models
Transfer function models for the descriptionof physical systems have recently been introduced to the field of multidimensional digital signal processing. They provide an alternati...
Rudolf Rabenstein, Lutz Trautmann
ENTCS
2008
101views more  ENTCS 2008»
15 years 1 months ago
Rewriting Strategies in Java
In any language designed to express transformations, the notion of rewrite rule is a key feature. Its conciseness as well as its strong theoretical foundations are essential. The ...
Emilie Balland, Pierre-Etienne Moreau, Antoine Rei...