Ask others: ACM DL/Guide - - CSB - MetaPress - Google - Bing - Yahoo

2009 | ||
---|---|---|

81 | David Kitchin, Adrian Quark, William R. Cook, Jayadev Misra: The Orc Programming Language. FMOODS/FORTE 2009: 1-25 | |

80 | C. A. R. Hoare, Jayadev Misra: Preface to special issue on software verification. ACM Comput. Surv. 41(4): (2009) | |

79 | C. A. R. Hoare, Jayadev Misra, Gary T. Leavens, Natarajan Shankar: The verified software initiative: A manifesto. ACM Comput. Surv. 41(4): (2009) | |

2008 | ||

78 | David Kitchin, Evan Powell, Jayadev Misra: Simulation Using Orchestration. AMAST 2008: 2-15 | |

77 | David Kitchin, Evan Powell, Jayadev Misra: Simulation, Orchestration and Logical Clocks. FM 2008: 34 | |

76 | William R. Cook, Jayadev Misra: Structured Interacting Computations. Software-Intensive Systems and New Computing Paradigms 2008: 139-145 | |

75 | Ian Wehrman, David Kitchin, William R. Cook, Jayadev Misra: A timed semantics of Orc. Theor. Comput. Sci. 402(2-3): 234-248 (2008) | |

2007 | ||

74 | Jayadev Misra, William R. Cook: Computation Orchestration. Software and System Modeling 6(1): 83-110 (2007) | |

2006 | ||

73 | 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 | |

72 | David Kitchin, William R. Cook, Jayadev Misra: A Language for Task Orchestration and Its Semantic Properties. CONCUR 2006: 477-491 | |

71 | William R. Cook, Sourabh Patwardhan, Jayadev Misra: Workflow Patterns in Orc. COORDINATION 2006: 82-96 | |

70 | Xiaozhou Li, Jayadev Misra, C. Greg Plaxton: Concurrent Maintenance of Rings. Distributed Computing 19(2): 126-148 (2006) | |

2005 | ||

69 | Tony Hoare, Jayadev Misra: Verified Software: Theories, Tools, Experiments Vision of a Grand Challenge Project. VSTTE 2005: 1-18 | |

2004 | ||

68 | Xiaozhou Li, Jayadev Misra, C. Greg Plaxton: Active and Concurrent Topology Maintenance. DISC 2004: 320-334 | |

67 | Xiaozhou Li, Jayadev Misra, C. Greg Plaxton: Brief announcement: concurrent maintenance of rings. PODC 2004: 376 | |

66 | Jayadev Misra: A Programming Model for the Orchestration of Web Services. SEFM 2004: 2-11 | |

2003 | ||

65 | Jayadev Misra, Wolfgang Reisig, Michael Schoettner, Laurent Lefèvre: Topic Introduction. Euro-Par 2003: 623 | |

64 | Young-ri Choi, Siddhartha Rai, Vinay Sampath Kumar, Jayadev Misra, Harrick M. Vin: Computing with Distributed Resources. JMLC 2003: 23-24 | |

63 | Jayadev Misra: Derivation of a parallel string matching algorithm. Inf. Process. Lett. 85(5): 255-260 (2003) | |

2002 | ||

62 | Markus Kaltenbach, Jayadev Misra: A Theory of Hints in Model Checking. 10th Anniversary Colloquium of UNU/IIST 2002: 423-438 | |

61 | Young-ri Choi, Amit Garg, Siddhartha Rai, Jayadev Misra, Harrick M. Vin: Orchestrating Computations on the World-Wide Web. Euro-Par 2002: 1-20 | |

60 | Jayadev Misra: The Case against a Grand Unification Theory. ICSR 2002: 328 | |

59 | 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) | |

58 | Jayadev Misra: A Simple, Object-Based View of Multiprogramming. Formal Methods in System Design 20(1): 23-45 (2002) | |

2001 | ||

57 | Jayadev Misra, Harrick M. Vin: Orchestrating Computations on the World-Wide Web. APSEC 2001: 305- | |

56 | Jayadev Misra: A Programming Model for Wide-Area Computing. FME 2001: 222 | |

55 | 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 | ||

54 | Jayadev Misra: Object-Oriented Programming for Wide-Area Computing. FMOODS 2000: 209- | |

53 | Rajeev Joshi, Jayadev Misra: Toward a theory of maximally concurrent programs (shortened version). PODC 2000: 319-328 | |

52 | Rajeev Joshi, Jayadev Misra: Maximally Concurrent Programs. Formal Asp. Comput. 12(2): 100-119 (2000) | |

1998 | ||

51 | Jayadev Misra: An Object Model for Multiprogramming. IPPS/SPDP Workshops 1998: 881-889 | |

1996 | ||

50 | Jayadev Misra: A Discipline of Multiprogramming. ACM Comput. Surv. 28(4es): 49 (1996) | |

49 | J. Allen Carruth, Jayadev Misra: Proof of a Real-Time Mutual-Exclusion Algorithm. Parallel Processing Letters 6(2): 251-257 (1996) | |

1994 | ||

48 | Jayadev Misra: Powerlist: A Structure for Parallel Recursion. ACM Trans. Program. Lang. Syst. 16(6): 1737-1767 (1994) | |

1992 | ||

47 | Jayadev Misra: Corrigenda: Phase Synchronization. Inf. Process. Lett. 41(1): 59 (1992) | |

46 | Jayadev Misra, David Gries: A Constructive Proof of Vizing's Theorem. Inf. Process. Lett. 41(3): 131-133 (1992) | |

1991 | ||

45 | Jayadev Misra: Loosely-Coupled Processes. PARLE (2) 1991: 1-26 | |

44 | Jayadev Misra: A Perspective on Parallel Program Design. Research Directions in High-Level Parallel Programming Languages 1991: 2-5 | |

43 | Jayadev Misra: Phase Synchronization. Inf. Process. Lett. 38(2): 101-105 (1991) | |

1990 | ||

42 | Jayadev Misra: Equational Reasoning About Nondeterministic Processes. Formal Asp. Comput. 2(2): 167-195 (1990) | |

41 | Jayadev Misra: Specifying Concurrent Objects as Communicating Processes. Sci. Comput. Program. 14(2-3): 159-184 (1990) | |

1989 | ||

40 | Jayadev Misra: Specifications of Concurrently Accessed Data. MPC 1989: 91-114 | |

39 | Jayadev Misra: Equational Reasoning About Nondeterministic Processes. PODC 1989: 29-44 | |

38 | Jayadev Misra: A Simple Proof of a Simple Consensus Algorithm. Inf. Process. Lett. 33(1): 21-24 (1989) | |

1987 | ||

37 | K. Mani Chandy, Jayadev Misra: Parallelism and Programming: A Perspective. FSTTCS 1987: 173-194 | |

36 | 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 | ||

35 | Jayadev Misra: Distributed Discrete-Event Simulation. ACM Comput. Surv. 18(1): 39-65 (1986) | |

34 | Jayadev Misra: Axioms for Memory Access in Asynchronous Hardware Systems. ACM Trans. Program. Lang. Syst. 8(1): 142-153 (1986) | |

33 | 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) | |

32 | K. Mani Chandy, Jayadev Misra: How Processes Learn. Distributed Computing 1(1): 40-52 (1986) | |

31 | K. Mani Chandy, Jayadev Misra: Systolic Algorithms as Programs. Distributed Computing 1(3): 177-183 (1986) | |

1985 | ||

30 | K. Mani Chandy, Jayadev Misra: How Processes Learn. PODC 1985: 204-214 | |

1984 | ||

29 | Jayadev Misra: Axioms for Memory Access in Asynchronous Hardware Systems. Seminar on Concurrency 1984: 96-110 | |

28 | K. Mani Chandy, Jayadev Misra: The Drinking Philosopher's Problem. ACM Trans. Program. Lang. Syst. 6(4): 632-646 (1984) | |

1983 | ||

27 | Jayadev Misra: Detecting Termination of Distributed Computations Using Markers. PODC 1983: 290-294 | |

26 | K. Mani Chandy, Jayadev Misra, Laura M. Haas: Distributed Deadlock Detection ACM Trans. Comput. Syst. 1(2): 144-156 (1983) | |

1982 | ||

25 | K. Mani Chandy, Jayadev Misra, R. Berry, Doug Neuse: The use of performance models in systematic design. AFIPS National Computer Conference 1982: 251-256 | |

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 | 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 | 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 | 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 | 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) |