Skip to main content
SpringerLink
Log in

A star-finite relational semantics for parallel programs

  • Conference paper
  • First Online:
Computation and Proof Theory

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 1104))

  • 329 Accesses

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • ASHCROFT, E.A. and MANNA, Z. [1971] Formalization of properties of parallel programs, Machine Intelligence, 6, pp. 17–41.

    MathSciNet  MATH  Google Scholar 

  • FARKAS, E.J. and SZABO, M.E. [1983] On the plausibility of nonstandard proofs in analysis, Dialectica. To appear.

    Google Scholar 

  • HOPCROFT, J.E. and ULLMAN, J.D. [1969] Formal languages and their relation to automata, Addison-Wesley, Reading, Mass.

    MATH  Google Scholar 

  • OWICKI, S. [1975] Axiomatic proof techniques for parallel programs, Ph.D. thesis, Cornell University.

    Google Scholar 

  • OWICKI, S. and GRIES, D. [1976] Verifying properties of parallel programs, Comm. ACM, 19, pp. 279–284.

    Article  MathSciNet  MATH  Google Scholar 

  • RICHTER, M.M. and SZABO, M.E. [1983] Towards a nonstandard analysis of programs, in: Nonstandard analysis-recent developments, A.E. Hurd (editor), Lecture Notes in Computer Science, 983, pp. 186–203.

    Google Scholar 

  • RICHTER, M.M. and SZABO, M.E. [1984] Nonstandard computation theory, Proceedings of the Colloquium on Algebra, Combinatorics, and Logic in Computer Science, Gyoer, Hungary. To appear.

    Google Scholar 

  • STROYAN, K.D. and LUXEMBURG, W.A.J. [1976] Introduction to the theory of infinitesimals, Academic Press, New York.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Concordia University, Montreal, Canada

    E. J. Farkas & M. E. Szabo

Authors
  1. E. J. Farkas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. E. Szabo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egon Börger Walter Oberschelp Michael M. Richter Brigitta Schinzel Wolfgang Thomas

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag

About this paper

Cite this paper

Farkas, E.J., Szabo, M.E. (1984). A star-finite relational semantics for parallel programs. In: Börger, E., Oberschelp, W., Richter, M.M., Schinzel, B., Thomas, W. (eds) Computation and Proof Theory. Lecture Notes in Mathematics, vol 1104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0099483

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13901-0

  • Online ISBN: 978-3-540-39119-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation