Hostname: page-component-6766d58669-nf276 Total loading time: 0 Render date: 2026-05-21T15:28:30.836Z Has data issue: false hasContentIssue false
  • English
  • Français

Modelling operating system structures by timed stream processing functions

Part of: JFP Research Articles

Published online by Cambridge University Press:  07 November 2008

Manfred Broy  and
Claus Dendorfer
Manfred Broy
Affiliation:
Institut für Informatik, Technische Universität München, Postfach 20 24 20, D-8000 München 2, Germany
Claus Dendorfer
Affiliation:
Institut für Informatik, Technische Universität München, Postfach 20 24 20, D-8000 München 2, Germany
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Some extensions of the basic formalism of stream processing functions are useful to specify complex structures such as operating systems. In this paper we give the foundations of higher order stream processing functions. These are functions which send and accept not only messages representing atomic data, but also complex elements such as functions. Some special notations are introduced for the specification and manipulation of such functions. A representation of time is outlined, which enables us to model time dependent behaviour. Finally, we demonstrate how characteristic operating system structures can be modelled by timed higher order stream processing functions.

Information

Type
Articles
Information
Journal of Functional Programming , Volume 2 , Issue 1 , January 1992 , pp. 1 - 21
Copyright
Copyright © Cambridge University Press 1992

References

Astesiano, E. and Reggio, G. 1987. SMoLCS-driven concurrent calculi. In Ehrig, H. et al. (Editors), Proc. Conference on Theory and Practice of Software Development. Lecture Notes in Computer Science 249, pp. 169–201. Springer-Verlag.Google Scholar
Brock, J. D. and Ackermann, W. B. 1981. Scenarios: A model of non-determinate computation. In Diaz, J. and Ramos, I. (Editors), Formalization of Programming Concepts. Lecture Notes in Computer Science 107, pp. 252–259. Springer-Verlag.CrossRefGoogle Scholar
Broy, M. 1988. Nondeterministic data flow programs: How to avoid the merge anomaly. Science of Computer Programming 10: 65–85.CrossRefGoogle Scholar
Broy, M. 1990. Functional specification of time sensitive communicating systems. In de Bakker, J. W. et al. (Editors), Stepwise Refinement of Distributed Systems. Lecture Notes in Computer Science 430, pp. 153–179. Springer-Verlag.Google Scholar
Dendorfer, C. 1991. Funktionale Modellierung eines Postsystems. SFB-Bericht Nr. 342/28/91A. Technische Universität München.Google Scholar
Friedman, D. P. and Wise, D. S. 1976. Cons should not evaluate its arguments. In Proc. 3rd Colloquium on Automata, Languages and Programming, pp. 257–284, Edinburgh University Press.Google Scholar
Hansen, M. R. and Chao-Chen, Z. 1990. Specification and verification of higher order processes. In Rovan, B. (Editor), Mathematical Foundations of Computer Science. Lecture Notes in Computer Science 452, pp. 322–327. Springer-Verlag.Google Scholar
Henderson, P. 1982. Purely functional operating systems. In Darlington, et al. (Editors), Functional Programming and its Applications. Cambridge University Press.Google Scholar
Henderson, P. and Morris, J. H. 1976. A lazy evaluator. In Proc. 3rd Conference on the Principles of Programming Languages, pp. 95–103. ACM.Google Scholar
Jones, S. B. 1984. A range of operating systems written in a purely functional style. Technical Monograph PRG-42. Programming Research Group, Oxford University.Google Scholar
Jones, S. B. and Sinclair, A. F. 1989. Functional programming and operating systems. The Computer Journal 32: 162–174.CrossRefGoogle Scholar
Kahn, G. 1974. The semantics of a simple language for parallel programming. In Rosenfeld, J. L. (Editor), Information Processing 74, pp. 471–475. Elsevier.Google Scholar
Karlsson, K. 1981. Nebula—A functional operating system. Laboratory for Programming Methodology, Chalmers University.Google Scholar
Milner, R., Parrow, J. and Walker, D. 1989. A Calculus of Mobile Processes, Parts I and II. LFCS Reports 89-85 and 89-86. Edinburgh University.Google Scholar
Nielson, F. 1989. The typed λ-calculus with first-class processes. In Odijk, E. et al. (Editors), Parallel Architectures and Languages Europe. Lecture Notes in Computer Science 366, pp. 357–373. Springer-Verlag.Google Scholar
Stoye, W. 1986. Message-based functional operating systems. Science of Computer Programming 6: 291–311.CrossRefGoogle Scholar
Thomsen, B. 1989. A calculus of higher order communicating systems. In Proc. 16th Symposium on Principles of Programming Languages, pp. 143–154. ACM.Google Scholar
Turner, D. 1990. An approach to functional operating systems. In Turner, D. (Editor), Research Topics in Functional Programming, pp. 199–217. Addison-Wesley.Google Scholar
Submit a response

Discussions

No Discussions have been published for this article.