Skip to main content
SpringerLink
Log in

Semantic specification and verification of data flow diagrams

  • Regular Papers
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

Data Flow Diagram (DFD) has been widely used in Software Engineering as means of requirement analysis and system specification. However, one defect of DFD approach remains untackled: the lack of formal semantics has brought about a lot of problems. In this paper, we model Data Flow Diagram as networks of concurrent processes. With the use of temporal logic language XYZ/E, the formal basis of the semantic specification of DFD can be ensured, and the system properties such as safety and liveness can be easily characterized. The main part of this paper is devoted to the study of the hierarchical decomposition of semantic specification and its correctness. A verification methodology is proposed and several examples are analyzed. The implementation of the tools which can support the formal specification, verification and simulation of DFD are also briefly described.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Apt, K. R., Francez, N., and Deroever, W. P., A proof system for communicating sequential processes.ACM TOPLAS, July 1980.

  2. Barringer, H. and Kuiper, R., Hierarchical Development of Concurrent Systems in a Temporal Logic Framework. Lecture Notes in Computer Science, No. 94, 1984.

  3. DeMarco, T., Structured Analysis and System Specification, Yourdon Inc., New York, 1978.

    Google Scholar 

  4. Feng, Y. L., Lin, H. M. and Tang, C. S., A Proof System for Temporal Logic Programs, The Development Methods, Tools and Environments of Computer Science. Northwest University Press, Xian, 1984.

    Google Scholar 

  5. Good, D. I., Mechanical Proofs about Computer Programs. InMathematical Logic and Programming Languages, Prentice-Hall, 1985.

  6. Hoare, C. A. R., Communicating sequential processes.Commun. ACM,21: 8, Aug. 1978.

  7. Hoare, C. A. R., Notes on Communicating Sequential Processes, Control Flow and Data Flow: Concepts of Distributed Programming. Springer Verlag, 1985.

  8. Lamport, L., Specifying concurrent program modules,ACM TOPLAS,5: 2 (1983), 190–222.

    Article  MATH  Google Scholar 

  9. Liu Tong, The Syntax and Semantics of Data Flow Diagrams, M. S. Thesis, 1989.

  10. Manna, Z. and Pnueli, A., Verification of Concurrent Programs. Tech. Rept. STAN-CS-81-836, Stanford University, 1981.

  11. Misra, J. and Chandy, K. M., Proof of networks of processes.IEEE TOSE, SE-7: 4 (1981).

    Google Scholar 

  12. Tang, C. S., An Introduction to XYZ System, Techn. Rept., IS-CAS-XYZ-88-1, 1988.

Download references

Author information

Authors and Affiliations

  1. Institute of Software, Academia Sinica, 100080, Beijing

    Liu Tong & C. S. Tang

Authors
  1. Liu Tong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. C. S. Tang
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liu, T., Tang, C.S. Semantic specification and verification of data flow diagrams. J. of Compt. Sci. & Technol. 6, 21–31 (1991). https://doi.org/10.1007/BF02943404

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02943404

Keywords

Search

Navigation