Skip to main content

Investigating programs in terms of partial graphs

Extended abstract

  • Conference paper
  • First Online:
Graphtheoretic Concepts in Computer Science (WG 1980)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 100))

Included in the following conference series:

  • 148 Accesses

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

Access this chapter

Institutional subscriptions

References

  1. Schmidt, G.: Programme als partielle Graphen. Inst. für Informatik der Techn. Universität München, Bericht 7813, 1977

    Google Scholar 

  2. Schmidt, G.: Investigating Programs in Terms of Partial Graphs. In: H.A. Maurer (ed.): 6th Int. Coll. on Automata, Languages and Programming, Lecture Notes in Comp. Sci. 71, (Springer 1979) 505–519

    Google Scholar 

  3. Schmidt, G.: Programs as Partial Graphs I: Flow Equivalence and Correctness. Theoret. Comp. Sci. 14 No. 2, to appear 1981

    Google Scholar 

  4. Schmidt, G.: Programs as Partial Graphs II: Recursion. Theoret. Comp. Sci. 14 No. 3, to appear 1981

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Hartmut Noltemeier

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schmidt, G. (1981). Investigating programs in terms of partial graphs. In: Noltemeier, H. (eds) Graphtheoretic Concepts in Computer Science. WG 1980. Lecture Notes in Computer Science, vol 100. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10291-4_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-10291-4_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10291-5

  • Online ISBN: 978-3-540-38435-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics