Counterexample to theorems of Cox and Fine
Joseph Y. Halpern
aaai 1996
The Task-Level Dataflow Language is a graphical language for architecture-independent parallel programming and is intended for the writing of new programs and the adaptation of existing ones. It is the first coarse-grained dataflow language that supports dynamic modification of program graphs. It provides a systematic use of program constructs to support particular programming styles, such as nondeterminism, iteration, and replication. It has been used successfully in a course on parallel programming. © 1990.
Joseph Y. Halpern
aaai 1996
Hironori Takeuchi, Tetsuya Nasukawa, et al.
Transactions of the Japanese Society for Artificial Intelligence
Merve Unuvar, Yurdaer Doganata, et al.
CLOUD 2014
Sashi Novitasari, Takashi Fukuda, et al.
INTERSPEECH 2025