Abstract
We present a theory for the semantics of indeterminate operators in a dataflow network. The assumption is made that the language in which the indeterminate operators are written has a construct that allows for the testing of availability of data on input lines. We then show that indeterminacy arises through the use of such an operator together with the fact that communication channels produce unpredictable delays in the transmission of data. Our scheme is to use the notion of hiatons to represent delays as measured locally, and then to filter out the hiatons to obtain ordinary streams. This filtering process produces indeterminate behavior at the level of ordinary streams. We indicate how this can be justified using the formalism of abstract interpretation. We show that a particular fairness anomaly does not arise.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
8. References
Abramsky, S. Semantic Foundations of Applicative Multiprogramming. In Diaz, J. (editor), Automata, Languages and Programming, pages 1–14. Springer-Verlag, July, 1983.
Arbib M. A., Manes E. G. Arrows, Structures and Functors. Academic press, 1975.
P. Cousot and R. Cousot. Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. POPL IV:238–252, Jan. 1977.
P. Cousot. Semantic Foundations of program analysis. Prentice-Hall, 1981, pages 303–342.
Kahn G. The Semantics of a Simple Language for Parallel Programming. In Proc. IFIP 1974, pages 471–475. 1974.
Kahn G., McQueen D. Coroutines and Networks of Parallel Processes. In B. Gilchrist (editor), Information Processing 77, pages 994–998. 1977.
Karp R. M., Miller R. Parallel program schemata. JCSS, May, 1969.
Keiler R.M. Denotational Models for Parallel Programs With Indeterminate Operators. In E.J. Neuhold (editor), Formal Descriptions of Programming Concepts, pages 337–365. North-Holland, Amsterdam, 1978.
Keller R. M. Users' Manual for Function Equation Language. AMPS Technical Memorandum 7, U of Utah, July, 1983.
P. Mishra, R. M. Keller. Static inference of properties of applicative programs. In POPL XI, Salt Lake City. January, 1984.
A. Mycroft. Abstract Interpretation and Optimising Transformations for Applicative Programs. PhD thesis, University of Edinburgh, December, 1981.
Mycroft A. and Nielsen F. Strong Abstract Interpretation Using Powerdomains. In Diaz J. (editor), Automata, Languages and Programming, pages 536–547. EATCS, July, 1983.
Panangaden P., Mishra P. A Category Theoretic formalism for Abstract Interpretation. Technical Report UUCS-84-005, University of Utah, May, 1984.
Park D. The Fairness Problem and Nondeterministic Computing Networks. In Proc. 4th Advanced Course on Theoretical Computer Science. Mathematisch Centrum, 1982.
Plotkin G. A Powerdomain Construction. SIAM J. of Computing 5(3), September, 1976.
Tanaka J. and Keller R. M. S-code Extension in FEL. AMPS Technical Memorandum 10, U of Utah, July, 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag
About this paper
Cite this paper
Panangaden, P. (1985). Abstract interpretation and indeterminacy. In: Brookes, S.D., Roscoe, A.W., Winskel, G. (eds) Seminar on Concurrency. CONCURRENCY 1984. Lecture Notes in Computer Science, vol 197. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15670-4_24
Download citation
DOI: https://doi.org/10.1007/3-540-15670-4_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15670-3
Online ISBN: 978-3-540-39593-5
eBook Packages: Springer Book Archive