(Enter summary)
Abstract: Starting from the process algebra for Concurrent ML we develop two program analyses that facilitate the intelligent placement of processes on processors. Both analyses are obtained by augmenting an inference system for counting the number of channels created, the number of input and output operations performed, and the number of processes spawned by the execution of a Concurrent ML program. One analysis provides information useful for making a static decision about processor allocation; to this ... (Update)
Context of citations to this paper: More
.... for the same process (in the above case, recursive calls for point) This is one of the reasons why we cannot apply Nielson s techniques[9][10] to analysis for concurrent object oriented style programs. With their analyses, the number of input operations for getx and output...
.... for (lazy) functional programming languages[24] and recent work on analysis of communication for concurrent programming languages[16, 7]. In fact, the type system presented in this study was partially inspired by [24] and [7] In [24] the use can only be either 1 or . As a...
Cited by: More
Functions, Concurrency, Distribution and Mobility - Kirli
(Correct)
A Polymorphic Type and Effect System for Detecting Mobile Functions - Kirli
(Correct)
Communication Topology Analysis for Concurrent Programs - Martel, Gengler (2000)
(Correct)
Similar documents (at the sentence level):
46.7%: Static and Dynamic Processor Allocation for Higher-Order.. - Nielson, Nielson (1995)
(Correct)
Active bibliography (related documents): More All
1.2: From CML to its Process Algebra - Nielson, Nielson
(Correct)
0.4: Constraints for Polymorphic Behaviours of Concurrent ML - Nielson, Nielson (1994)
(Correct)
0.3: Asymptotic Enumeration Methods - Odlyzko (1996)
(Correct)
Similar documents based on text: More All
0.3: Annotated Type Systems for Program Analysis - Solberg (1995)
(Correct)
0.3: Type and Behaviour Reconstruction for Higher-Order.. - Amtoft, Nielson, Nielson (1995)
(Correct)
0.2: Inference Systems for Binding Time Analysis (Extended.. - Solberg, Nielson, Nielson (1992)
(Correct)
Related documents from co-citation: More All
4: Higher-Order Concurrent Programs with Finite Communicationn Topology
- Nielson - 1994
3: Actors: a model of concurrent computation in distributed systems (context) - Agha - 1988
3: Compiling with Continuations (context) - Appel - 1992
BibTeX entry: (Update)
Nielson, H. R., and F. Nielson, "Static and Dynamic Processor Allocation for Higher-Order Concurrent Languages." Technical Report DAIMI PB-483, Dept. of Comp. Science, Aarhus University, 1994. http://citeseer.ist.psu.edu/nielson95static.html More
@inproceedings{ nielson95static,
author = "Hanne Riis Nielson and Flemming Nielson",
title = "Static and Dynamic Processor Allocation for Higher-Order Concurrent Languages",
booktitle = "{TAPSOFT}'95: Theory and Practice of Software Development",
volume = "915",
publisher = "Springer-Verlag",
pages = "590--604",
year = "1995",
url = "citeseer.ist.psu.edu/nielson95static.html" }
Citations (may not include all citations):
10
Nielson: Higher-Order Concurrent Programs with Finite Commun.. (context) - Nielson - 1994
7
Nielson: From CML to Process Algebras (context) - Nielson - 1993
7
Nielson: Constraints for Polymorphic Behaviours for Concurre.. (context) - Nielson - 1994
6
Prasad: Operational and Algebraic Semantics for Facile: a Sy.. (context) - Giacalone, Mishra - 1990
4
North-Holland (context) - Hecht, of et al. - 1977
3
Smolka: Dataflow analysis of distributed communicating proce.. (context) - Reif - 1990
3
Springer Lecture Notes in Computer Science (context) - Reppy, ML et al. - 1993
3
Springer Lecture Notes in Computer Science (context) - Mercouroff, for et al. - 1992
3
Springer Lecture Notes in Computer Science (context) - Havelund, Larsen et al. - 1993
2
Paige: Program Derivation by Fixed Point Computation (context) - Cai - 1989
2
Goubault: Semantics and analysis of Linda-based languages (context) - Cridlig - 1993
2
Journal of parallel and distributed computing (context) - McDowell, algorithm et al. - 1989
2
Chen: Reverse reachability analysis: a new technique for dea.. (context) - Hung - 1993
2
Parigot: Techniques for Improving Grammar Flow Analysis (context) - Jourdan - 1990
2
Week: Analysing stores and references in a parallel symbolic.. (context) - Jagannathan - 1994
Documents on the same site (http://www.daimi.aau.dk/DAIMI/PB-list.html): More
Cryptanalysis of LOKI 91 - Knudsen (1993)
(Correct)
AVL Trees with Relaxed Balance - Larsen (1992)
(Correct)
Computer Aided Verification of Lamport's Fast Mutual.. - Jørgensen, Kristensen
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC