This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
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.
FARKAS, E.J. and SZABO, M.E. [1983] On the plausibility of nonstandard proofs in analysis, Dialectica. To appear.
HOPCROFT, J.E. and ULLMAN, J.D. [1969] Formal languages and their relation to automata, Addison-Wesley, Reading, Mass.
OWICKI, S. [1975] Axiomatic proof techniques for parallel programs, Ph.D. thesis, Cornell University.
OWICKI, S. and GRIES, D. [1976] Verifying properties of parallel programs, Comm. ACM, 19, pp. 279–284.
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.
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.
STROYAN, K.D. and LUXEMBURG, W.A.J. [1976] Introduction to the theory of infinitesimals, Academic Press, New York.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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
