✦ LIBER ✦

Satisfiability of Dataflow Models of Distributed Programs

✍ Scribed by V. V. Toporkov

Book ID: 110311946
Publisher: SP MAIK Nauka/Interperiodica
Year: 2001
Tongue: English
Weight: 67 KB
Volume: 27
Category: Article
ISSN: 0361-7688
DOI: 10.1023/a:1012336809259

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Decidability of the Analysis Problem for

Decidability of the Analysis Problem for Dataflow Models of Programs

✍ V. V. Toporkov 📂 Article 📅 2003 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 100 KB

Synthetic models of distributed-memory p

Synthetic models of distributed-memory parallel programs

✍ David A. Poplawski 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 425 KB

Intensional and Extensional Semantics of

Intensional and Extensional Semantics of Dataflow Programs

✍ Simon Gay; Rajagopal Nagarajan 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 287 KB

Analysis of Dataflow Programs with Inter

Analysis of Dataflow Programs with Interval-limited Data-rates

✍ Teich, Jürgen ;Bhattacharyya, Shuvra S. 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 308 KB

Transformation of Logic Programs to FP P

Transformation of Logic Programs to FP Programs Based on Dataflows

✍ Susumu Yamasaki; Kentaro Iida 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 692 KB

This paper is concerned with functionality of a logic program. Functionality based on input-output relations declared in predicates is not treated, but functionality of extensionalities of predicates, involved in a logic program, is realized by a dataflow computation and a functional programming (FP

Joint Minimization of Code and Data for

Joint Minimization of Code and Data for Synchronous Dataflow Programs

✍ Praveen K. Murthy; Shuvra S. Bhattacharyya; Edward A. Lee 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 253 KB