79 search results - page 10 / 16 » Graph Rewriting in Computational Origami |
SEMCO
2007
IEEE
14 years 1 months ago
2007
IEEE
Model-driven development depends on good initial models. Creating these models by hand is a challenging task, because of complex specification documents and change requests. We p...
BIRTHDAY
2010
Springer
13 years 5 months ago
2010
Springer
To prove termination of Java Bytecode (JBC) automatically, we transform JBC to finite termination graphs which represent all possible runs of the program. Afterwards, the graph can...
PPDP
2007
Springer
14 years 1 months ago
2007
Springer
We propose a new definition and use of a primitive getAllValues, for computing all the values of a non-deterministic expression in a functional logic program. Our proposal restri...
DAC
2006
ACM
14 years 8 months ago
2006
ACM
This paper presents a technique for preprocessing combinational logic before technology mapping. The technique is based on the representation of combinational logic using And-Inve...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. The distinguishing feature of...