1882 search results - page 194 / 377 » Transformational Programming and Forests |
157
click to vote
ECOOPWEXCEPTION
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. This paper describes a scheme of manipulating (partial) continuations in imperative languages such as Java and C++ in a portable manner, where the portability means that ...
154
click to vote
DFT
1999
IEEE
15 years 9 months ago
1999
IEEE
The paper describes a systematic approach for automatically introducing data and code redundancy into an existing program written using a high-level language. The transformations ...
113
click to vote
IFIP
1999
Springer
15 years 9 months ago
1999
Springer
: This paper presents a synthesis algorithm for pipelined circuits. The circuit is specified as a collection of independent, looselycoupled modules connected by queues. The synthe...
143
click to vote
OOPSLA
1999
Springer
15 years 9 months ago
1999
Springer
Java programs perform many synchronization operations on data structures. Some of these synchronizations are unnecessary; in particular, if an object is reachable only by a single ...
182
click to vote
COMPASS
1994
15 years 9 months ago
1994
We give a notation and a logical calculus for the description and deductive manipulation of dynamic networks of communicating components. We represent such nets by hierarchical sys...