(Enter summary)
Abstract: ion of the Scheduling Problem . . . . . . . . 70
4.3.2 Specification . . . . . . . . . . . . . . . . . . . . . . . . . 71
4.3.3 A Scheduling Strategy . . . . . . . . . . . . . . . . . . . . 71
4.3.4 The Correctness of the Scheduling Strategy . . . . . . . . 72
4.3.5 Proof of Maximality . . . . . . . . . . . . . . . . . . . . . 74
4.3.6 Refining a Maximal Solution: Implementation of the Scheduling
Strategy . . . . . . . . . . . . . . . . . . . . . . . . . . 75
4.4 Designs of the Processors . . . ... (Update)
Cited by: More
Concurrent Maintenance of Rings - Xiaozhou Li Jayadev
(Correct)
Concurrent Program Design in the Extended Theory of Owicki and .. - Goldson, Dongol (2005)
(Correct)
Mechanizing Compositional Reasoning for Concurrent Systems.. - Ehmety, Paulson (2005)
(Correct)
Similar documents (at the sentence level):
24.0%: A Discipline of Multiprogramming - Misra (1996)
(Correct)
15.5%: A Reduction Theorem for Concurrent Object-Oriented Programs - Misra
(Correct)
13.9%: A Simple, Object-based View of Multiprogramming - Misra (1997)
(Correct)
Active bibliography (related documents): More All
0.0: An Object Model for Multiprogramming - Misra (1998)
(Correct)
0.0: Maximally Concurrent Programs - Joshi, Misra (1999)
(Correct)
0.0: Seuss: What the Doctor Ordered - Alvisi, Joshi, Lin, Misra (1997)
(Correct)
Similar documents based on text: More All
0.6: Seuss for Java - Language Reference - Joshi (1998)
(Correct)
0.5: An Experiment in Compiler Design for a Concurrent Object-Based.. - Krüger (1996)
(Correct)
0.4: An introduction to UNITY and Seuss - Krüger (1997)
(Correct)
Related documents from co-citation: More All
6: Parallel Program Design: A Foundation (context) - Chandy, Misra - 1988
4: Eliminating the substitution axiom from UNITY logic (context) - Sanders - 1991
3: Reasoning about program composition
- Chandy, Sanders - 1998
BibTeX entry: (Update)
J. Misra. A discipline of multiprogramming. In G. E. Blelloch, K. M. Chandy, and S. Jagannathan, editors, Specification of Parallel Algorithms, volume 18, pages 357--381, Providence, RI, 1994. DIMACS (Series in Discrete Mathematics) , American Mathematical Society. http://citeseer.ist.psu.edu/article/misra99discipline.html More
@article{ misra96discipline,
author = "Jayadev Misra",
title = "A discipline of multiprogramming",
journal = "ACM Computing Surveys",
volume = "28",
number = "4es",
pages = "49--49",
year = "1996",
url = "citeseer.ist.psu.edu/article/misra99discipline.html" }
Citations (may not include all citations):
2732
Communicating sequential processes (context) - Hoare - 1978 ACM DBLP
2732
Communicating Sequential Processes (context) - Hoare - 1984 ACM DBLP
1529
A method for obtaining digital signatures and public key cry..
- Rivest, Shamir et al. - 1978
1274
Object-Oriented Software Construction (context) - Meyer - 1997 ACM
1180
The temporal logic of reactive and concurrent systems (context) - Manna, Pnueli - 1991
625
ACM Transactions on Programming Languages and Systems (context) - Lamport, logic - 1994
375
ACM Transactions on Programming Languages and Systems (context) - Gelernter, in - 1985
202
International Series in Computer Science (context) - Milner, Concurrency - 1989
199
An introduction to input/output automata (context) - Lynch, Tuttle - 1989
120
A note on reliable full-duplex transmission over half-duplex.. (context) - Scantlebury, Bartlett et al. - 1969
62
DEC Systems Research Center (context) - Lamport, Schneider et al. - 1989
62
Reduction: A method of proving properties of parallel progra.. (context) - Lipton - 1975 DBLP
42
Rationale for the design of the Ada programming language (context) - Ichbiah - 1979
36
A logic for concurrent programming: Safety (context) - Misra - 1995
35
A logic for concurrent programming: Progress (context) - Misra - 1995
2
Misra's weakest fair buffer (context) - Dijkstra - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.utexas.edu/users/misra): More
Strategies to Combat Software Piracy - Misra (1999)
(Correct)
A walk over the shortest path: Dijkstra's Algorithm viewed as.. - Misra (2000)
(Correct)
Maximally Concurrent Programs - Joshi, Misra (1999)
(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