[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Log in

Decidability of the Analysis Problem for Dataflow Models of Programs

  • Published:
Programming and Computer Software Aims and scope Submit manuscript

Abstract

In the paper, algorithmic decidability of the analysis problem for dataflow models of programs is studied. The solution of the problem is the least stable marking on upper semi-lattice of labels of arcs and vertices of the generalized dataflow graph of the program. The labels are allowed to be of arbitrary semantic nature. Whether the analysis problem is decidable depends on properties of the marking function that interprets the analysis scheme given by a system of functional equations.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

REFERENCES

  1. Najjar, W.A., Lee, E.A., and Gao, G.R., Advances in the Dataflow Computational Model, Parallel Computing, 1999, vol. 25, pp. 1907–1929.

    Google Scholar 

  2. Lee, E.A. and Parks, T.M., Dataflow Process Networks, Proc. IEEE, 1995, vol. 83, pp. 773–801.

    Google Scholar 

  3. Toporkov, V.V., Functionality of a Nondeterministic Model of Distributed Computation, Informatsionnye Tekhnol., 2001, no. 12, pp. 2–5.

    Google Scholar 

  4. Toporkov, V.V., Deadlock Decidability Problem in a Nondeterministic Model of Distributed Computation, Informatsionnye Tekhnol., 2002, no. 1, pp. 2–5.

    Google Scholar 

  5. Lee, E.A. and Messerschmitt, D.G., Synchronous Data Flow, Proc. IEEE, 1987, vol. 75, pp. 1235–1245.

    Google Scholar 

  6. Dennis, J.B., First Version of a Data-flow Procedure Language, Lecture Notes in Computer Science (Proc. of the Colloque sur la Programmation), Berlin: Springer, 1974, vol. 19, pp. 362–376.

    Google Scholar 

  7. Gao, G.R., Sreedhar, V.C., and Lee, Y.F., A New Framework for Exhaustive and Incremental Data Flow Analysis Using DJ Graphs, ACM SIGPLAN'96 Conf. on Programming Language Design and Implementation (PLDI), 1996, pp. 272–290.

  8. Masticola, S.P., Marlowe, T.J., and Ryder, B.G., Lattice Frameworks for Multisource and Bidirectional Data Flow Problems, ACM TOPLAS, 1995, vol. 17, no. 5, pp. 777–803.

    Google Scholar 

  9. Marlowe, T.J. and Ryder, B.G., Properties of Data Flow Frameworks: A Unified Model, Acta Informatica, 1990, vol. 28, pp. 121–163.

    Google Scholar 

  10. Kotov, V.E. and Sabel'fel'd, V.K., Teoriya skhem program (The Program Schemes Theory), Moscow: Nauka, 1991.

    Google Scholar 

  11. Kam, J.B. and Ullman, J.D., Global Flow Analysis and Iterative Algorithms, J. ACM, 1976, vol. 13, no. 1, pp. 158–171.

    Google Scholar 

  12. Kam, J.B. and Ullman, J.D., Monotone Data Flow Analysis Frameworks, Acta Informatica, 1977, no. 7, pp. 305–318.

    Google Scholar 

  13. Toporkov, V.V., Satisfiability of Dataflow Models of Distributed Programs, Programmirovanie, 2001, no. 5, pp. 18–25.

    Google Scholar 

  14. Kahn, G., The Semantics of a Simple Language for Parallel Programming, in Information Processing 74, North-Holland, 1974, pp. 471–475.

  15. Lee, E.A., Embedded Software, Advances in Computers, vol. 56, Zelkowithz, M., Ed., London: Academic, 2002; http://ptolemy.eecs.berkeley.edu/publications/papers/ 02/ embsoft.

    Google Scholar 

  16. Mal'tsev, A.I., Algoritmy i rekursivnye funktsii (Algorithms and Recursive Functions), Moscow: Nauka, 1986.

    Google Scholar 

  17. Manna, Z., Theory of Fixed Point of Programs, in Kibern. Sb., Moscow: Mir, 1978, vol. 15, pp. 38–100.

    Google Scholar 

  18. Kildall, G.A., A Unified Approach to Global Program Optimization, Conf. Record of the First ACM Symp. on Principles of Programming Languages, Boston, 1973, pp. 194–206.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Toporkov, V.V. Decidability of the Analysis Problem for Dataflow Models of Programs. Programming and Computer Software 29, 121–129 (2003). https://doi.org/10.1023/A:1023896821228

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1023896821228

Keywords

Navigation