| 2007 |
|---|
| 71 | EE | Jayadev Misra,
William R. Cook:
Computation Orchestration.
Software and System Modeling 6(1): 83-110 (2007) |
| 2006 |
|---|
| 70 | | Jayadev Misra,
Tobias Nipkow,
Emil Sekerinski:
FM 2006: Formal Methods, 14th International Symposium on Formal Methods, Hamilton, Canada, August 21-27, 2006, Proceedings
Springer 2006 |
| 69 | EE | David Kitchin,
William R. Cook,
Jayadev Misra:
A Language for Task Orchestration and Its Semantic Properties.
CONCUR 2006: 477-491 |
| 68 | EE | William R. Cook,
Sourabh Patwardhan,
Jayadev Misra:
Workflow Patterns in Orc.
COORDINATION 2006: 82-96 |
| 67 | EE | Xiaozhou Li,
Jayadev Misra,
C. Greg Plaxton:
Concurrent Maintenance of Rings.
Distributed Computing 19(2): 126-148 (2006) |
| 2004 |
|---|
| 66 | EE | Xiaozhou Li,
Jayadev Misra,
C. Greg Plaxton:
Active and Concurrent Topology Maintenance.
DISC 2004: 320-334 |
| 65 | EE | Xiaozhou Li,
Jayadev Misra,
C. Greg Plaxton:
Brief announcement: concurrent maintenance of rings.
PODC 2004: 376 |
| 64 | EE | Jayadev Misra:
A Programming Model for the Orchestration of Web Services.
SEFM 2004: 2-11 |
| 2003 |
|---|
| 63 | EE | Jayadev Misra,
Wolfgang Reisig,
Michael Schoettner,
Laurent Lefèvre:
Topic Introduction.
Euro-Par 2003: 623 |
| 62 | EE | Young-ri Choi,
Siddhartha Rai,
Vinay Sampath Kumar,
Jayadev Misra,
Harrick M. Vin:
Computing with Distributed Resources.
JMLC 2003: 23-24 |
| 61 | EE | Jayadev Misra:
Derivation of a parallel string matching algorithm.
Inf. Process. Lett. 85(5): 255-260 (2003) |
| 2002 |
|---|
| 60 | EE | Markus Kaltenbach,
Jayadev Misra:
A Theory of Hints in Model Checking.
10th Anniversary Colloquium of UNU/IIST 2002: 423-438 |
| 59 | EE | Young-ri Choi,
Amit Garg,
Siddhartha Rai,
Jayadev Misra,
Harrick M. Vin:
Orchestrating Computations on the World-Wide Web.
Euro-Par 2002: 1-20 |
| 58 | EE | Jayadev Misra:
The Case against a Grand Unification Theory.
ICSR 2002: 328 |
| 57 | EE | Robert S. Boyer,
W. H. J. Feijen,
David Gries,
C. A. R. Hoare,
Jayadev Misra,
J. Moore,
H. Richards:
In memoriam: Edsger W. Dijkstra 1930-2002.
Commun. ACM 45(10): 21-22 (2002) |
| 56 | | Jayadev Misra:
A Simple, Object-Based View of Multiprogramming.
Formal Methods in System Design 20(1): 23-45 (2002) |
| 2001 |
|---|
| 55 | EE | Jayadev Misra,
Harrick M. Vin:
Orchestrating Computations on the World-Wide Web.
APSEC 2001: 305- |
| 54 | EE | Jayadev Misra:
A Programming Model for Wide-Area Computing.
FME 2001: 222 |
| 53 | EE | Jayadev Misra:
A walk over the shortest path: Dijkstra's Algorithm viewed as fixed-point computation.
Inf. Process. Lett. 77(2-4): 197-200 (2001) |
| 2000 |
|---|
| 52 | | Jayadev Misra:
Object-Oriented Programming for Wide-Area Computing.
FMOODS 2000: 209- |
| 51 | EE | Rajeev Joshi,
Jayadev Misra:
Toward a theory of maximally concurrent programs (shortened version).
PODC 2000: 319-328 |
| 50 | EE | Rajeev Joshi,
Jayadev Misra:
Maximally Concurrent Programs.
Formal Asp. Comput. 12(2): 100-119 (2000) |
| 1998 |
|---|
| 49 | | Jayadev Misra:
An Object Model for Multiprogramming.
IPPS/SPDP Workshops 1998: 881-889 |
| 1996 |
|---|
| 48 | | Jayadev Misra:
A Discipline of Multiprogramming.
ACM Comput. Surv. 28(4es): 49 (1996) |
| 1994 |
|---|
| 47 | EE | Jayadev Misra:
Powerlist: A Structure for Parallel Recursion.
ACM Trans. Program. Lang. Syst. 16(6): 1737-1767 (1994) |
| 1992 |
|---|
| 46 | | Jayadev Misra:
Corrigenda: Phase Synchronization.
Inf. Process. Lett. 41(1): 59 (1992) |
| 45 | | Jayadev Misra,
David Gries:
A Constructive Proof of Vizing's Theorem.
Inf. Process. Lett. 41(3): 131-133 (1992) |
| 1991 |
|---|
| 44 | | Jayadev Misra:
Loosely-Coupled Processes.
PARLE (2) 1991: 1-26 |
| 43 | | Jayadev Misra:
A Perspective on Parallel Program Design.
Research Directions in High-Level Parallel Programming Languages 1991: 2-5 |
| 42 | | Jayadev Misra:
Phase Synchronization.
Inf. Process. Lett. 38(2): 101-105 (1991) |
| 1990 |
|---|
| 41 | | Jayadev Misra:
Equational Reasoning About Nondeterministic Processes.
Formal Asp. Comput. 2(2): 167-195 (1990) |
| 40 | | Jayadev Misra:
Specifying Concurrent Objects as Communicating Processes.
Sci. Comput. Program. 14(2-3): 159-184 (1990) |
| 1989 |
|---|
| 39 | | Jayadev Misra:
Specifications of Concurrently Accessed Data.
MPC 1989: 91-114 |
| 38 | | Jayadev Misra:
Equational Reasoning About Nondeterministic Processes.
PODC 1989: 29-44 |
| 37 | | Jayadev Misra:
A Simple Proof of a Simple Consensus Algorithm.
Inf. Process. Lett. 33(1): 21-24 (1989) |
| 1987 |
|---|
| 36 | | K. Mani Chandy,
Jayadev Misra:
Parallelism and Programming: A Perspective.
FSTTCS 1987: 173-194 |
| 35 | | Rajive Bagrodia,
K. Mani Chandy,
Jayadev Misra:
A Message-Based Approach to Discrete-Event Simulation.
IEEE Trans. Software Eng. 13(6): 654-665 (1987) |
| 1986 |
|---|
| 34 | EE | Jayadev Misra:
Distributed Discrete-Event Simulation.
ACM Comput. Surv. 18(1): 39-65 (1986) |
| 33 | EE | Jayadev Misra:
Axioms for Memory Access in Asynchronous Hardware Systems.
ACM Trans. Program. Lang. Syst. 8(1): 142-153 (1986) |
| 32 | EE | K. Mani Chandy,
Jayadev Misra:
An Example of Stepwise Refinement of Distributed Programs: Quiescence Detection.
ACM Trans. Program. Lang. Syst. 8(3): 326-343 (1986) |
| 31 | | K. Mani Chandy,
Jayadev Misra:
How Processes Learn.
Distributed Computing 1(1): 40-52 (1986) |
| 30 | | K. Mani Chandy,
Jayadev Misra:
Systolic Algorithms as Programs.
Distributed Computing 1(3): 177-183 (1986) |
| 1985 |
|---|
| 29 | | K. Mani Chandy,
Jayadev Misra:
How Processes Learn.
PODC 1985: 204-214 |
| 1984 |
|---|
| 28 | | Jayadev Misra:
Axioms for Memory Access in Asynchronous Hardware Systems.
Seminar on Concurrency 1984: 96-110 |
| 27 | EE | K. Mani Chandy,
Jayadev Misra:
The Drinking Philosopher's Problem.
ACM Trans. Program. Lang. Syst. 6(4): 632-646 (1984) |
| 1983 |
|---|
| 26 | | Jayadev Misra:
Detecting Termination of Distributed Computations Using Markers.
PODC 1983: 290-294 |
| 25 | EE | K. Mani Chandy,
Jayadev Misra,
Laura M. Haas:
Distributed Deadlock Detection
ACM Trans. Comput. Syst. 1(2): 144-156 (1983) |
| 1982 |
|---|
| 24 | | K. Mani Chandy,
Jayadev Misra:
A Distributed Algorithm for Detecting Resource Deadlocks in Distributed Systems.
PODC 1982: 157-164 |
| 23 | | Jayadev Misra,
K. Mani Chandy,
Todd Smith:
Proving Safety and Liveness of Communicating Processes with Examples.
PODC 1982: 201-208 |
| 22 | EE | Jayadev Misra,
K. Mani Chandy:
Termination Detection of Diffusing Computations in Communicating Sequential Processes.
ACM Trans. Program. Lang. Syst. 4(1): 37-43 (1982) |
| 21 | EE | Jayadev Misra,
K. Mani Chandy:
A Distributed Graph Algorithm: Knot Detection.
ACM Trans. Program. Lang. Syst. 4(4): 678-686 (1982) |
| 20 | | K. Mani Chandy,
Jayadev Misra:
Distributed Computation on Graphs: Shortest Path Algorithms.
Commun. ACM 25(11): 833-837 (1982) |
| 19 | | Jayadev Misra,
David Gries:
Finding Repeated Elements.
Sci. Comput. Program. 2(2): 143-152 (1982) |
| 1981 |
|---|
| 18 | | Doug Neuse,
K. Mani Chandy,
Jayadev Misra,
R. Berry:
A Computer Modeling System Based on a User-Extensible Modeling Library.
Int. CMG Conference 1981: 127-129 |
| 17 | EE | Jayadev Misra:
An Exercise in Program Explanation.
ACM Trans. Program. Lang. Syst. 3(1): 104-109 (1981) |
| 16 | | K. Mani Chandy,
Jayadev Misra:
Asynchronous Distributed Simulation via a Sequence of Parallel Computations.
Commun. ACM 24(4): 198-206 (1981) |
| 15 | | Jayadev Misra,
K. Mani Chandy:
Proofs of Networks of Processes.
IEEE Trans. Software Eng. 7(4): 417-426 (1981) |
| 1979 |
|---|
| 14 | | K. Mani Chandy,
Victor Holmes,
Jayadev Misra:
Distributed Simulation of Networks.
Computer Networks 3: 105-113 (1979) |
| 13 | | K. Mani Chandy,
Jayadev Misra:
Distributed Simulation: A Case Study in Design and Verification of Distributed Programs.
IEEE Trans. Software Eng. 5(5): 440-452 (1979) |
| 12 | | Jayadev Misra:
Space-Time Trade Off in Implementing Certain Set Operations.
Inf. Process. Lett. 8(2): 81-85 (1979) |
| 11 | | K. Mani Chandy,
Jayadev Misra:
Deadlock Absence Proofs for Networks of Communicating Processes.
Inf. Process. Lett. 9(4): 185-189 (1979) |
| 1978 |
|---|
| 10 | | David Gries,
Jayadev Misra:
A Linear Sieve Algorithm for Finding Prime Numbers.
Commun. ACM 21(12): 999-1003 (1978) |
| 9 | | Jayadev Misra:
A Technique of Algorithm Construction on Sequences.
IEEE Trans. Software Eng. 4(1): 65-69 (1978) |
| 8 | | Jayadev Misra:
An Approach to Formal Definitions and Proofs of Programming Principles.
IEEE Trans. Software Eng. 4(5): 410-413 (1978) |
| 7 | | Jayadev Misra:
Some Aspects of the Verification of Loop Computations.
IEEE Trans. Software Eng. 4(6): 478-486 (1978) |
| 1977 |
|---|
| 6 | | Sukhamay Kundu,
Jayadev Misra:
A Linear Tree Partitioning Algorithm.
SIAM J. Comput. 6(1): 151-154 (1977) |
| 5 | | Jayadev Misra:
Prospects and Limitations of Automatic Assertion Generation for Loop Programs.
SIAM J. Comput. 6(4): 718-729 (1977) |
| 1976 |
|---|
| 4 | | Sanat K. Basu,
Jayadev Misra:
Some Classes of Naturally Provable Programs.
ICSE 1976: 400-406 |
| 1975 |
|---|
| 3 | EE | Jayadev Misra:
Remark on "Algorithm 246: Graycode [Z]".
ACM Trans. Math. Softw. 1(3): 285 (1975) |
| 2 | | Sanat K. Basu,
Jayadev Misra:
Proving Loop Programs.
IEEE Trans. Software Eng. 1(1): 76-86 (1975) |
| 1 | | Jayadev Misra,
Robert Endre Tarjan:
Optimal Chain Partitions of Trees.
Inf. Process. Lett. 4(1): 24-26 (1975) |
