default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJayadev Misra
Person information
- affiliation: University of Texas at Austin, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[b3]Jayadev Misra:
Effective Theories in Programming Practice. ACM Books 47, ACM 2023, ISBN 978-1-4503-9973-9- 2022
- [p8]Jayadev Misra:
An Homage to the Beautiful Mathematical EWDs. Edsger Wybe Dijkstra 2022: 247-282 - 2021
- [p7]Cliff B. Jones, Jayadev Misra:
Finding Effective Abstractions. Theories of Programming 2021: 23-40 - [p6]C. A. R. Hoare, Jayadev Misra:
Preface to Special Issue on Software Verification. Theories of Programming 2021: 77-80 - [p5]Tony Hoare, Jayadev Misra, Gary T. Leavens, Natarajan Shankar:
The Verified Software Initiative: A Manifesto. Theories of Programming 2021: 81-92 - [p4]Cliff B. Jones, Jayadev Misra:
Preface. Theories of Programming 2021 - [p3]Jayadev Misra:
Cv. Theories of Programming 2021: 387-392 - [e3]Cliff B. Jones
, Jayadev Misra:
Theories of Programming: The Life and Works of Tony Hoare. ACM Books 39, ACM / Morgan & Claypool 2021, ISBN 978-1-4503-8728-6 [contents]
2010 – 2019
- 2017
- [c42]Richard M. Fujimoto, Rajive L. Bagrodia, Randal E. Bryant, K. Mani Chandy, David R. Jefferson, Jayadev Misra, David M. Nicol, Brian W. Unger:
Parallel discrete event simulation: The making of a field. WSC 2017: 262-291 - [i1]Jayadev Misra:
Bilateral Proofs of Safety and Progress Properties of Concurrent Programs. CoRR abs/1704.01814 (2017) - 2015
- [j54]Jayadev Misra:
Mapping among the nodes of infinite trees: A variation of Kőnig's infinity lemma. Inf. Process. Lett. 115(5): 548-549 (2015) - [c41]Jayadev Misra:
A Denotational Semantic Theory of Concurrent Systems. Logic, Rewriting, and Concurrency 2015: 493-518 - 2014
- [c40]Jayadev Misra:
A personal perspective on concurrency. PLDI 2014: 395 - 2013
- [c39]Jayadev Misra:
Orchestration. FACS 2013: 5-12 - 2012
- [j53]Jayadev Misra:
A secure voting scheme based on rational self-interest. Formal Aspects Comput. 24(4-6): 793-805 (2012) - 2011
- [c38]Jayadev Misra:
Virtual Time and Timeout in Client-Server Networks - (Extended Abstract). ICTAC 2011: 1-3 - 2010
- [j52]Xiaozhou Li, Jayadev Misra, C. Greg Plaxton:
Maintaining the Ranch topology. J. Parallel Distributed Comput. 70(11): 1142-1158 (2010) - [p2]David Kitchin, Adrian Quark, Jayadev Misra:
Quicksort: Combining Concurrency, Recursion, and Mutable Data Structures. Reflections on the Work of C. A. R. Hoare 2010: 229-254
2000 – 2009
- 2009
- [j51]C. A. R. Hoare, Jayadev Misra:
Preface to special issue on software verification. ACM Comput. Surv. 41(4): 18:1-18:3 (2009) - [j50]C. A. R. Hoare, Jayadev Misra, Gary T. Leavens, Natarajan Shankar:
The verified software initiative: A manifesto. ACM Comput. Surv. 41(4): 22:1-22:8 (2009) - [c37]David Kitchin, Adrian Quark, William R. Cook, Jayadev Misra:
The Orc Programming Language. FMOODS/FORTE 2009: 1-25 - 2008
- [j49]Ian Wehrman, David Kitchin, William R. Cook, Jayadev Misra:
A timed semantics of Orc. Theor. Comput. Sci. 402(2-3): 234-248 (2008) - [c36]David Kitchin, Evan Powell, Jayadev Misra:
Simulation Using Orchestration. AMAST 2008: 2-15 - [c35]David Kitchin, Evan Powell, Jayadev Misra:
Simulation, Orchestration and Logical Clocks. FM 2008: 34 - [p1]William R. Cook, Jayadev Misra:
Structured Interacting Computations. Software-Intensive Systems and New Computing Paradigms 2008: 139-145 - 2007
- [j48]Jayadev Misra, William R. Cook:
Computation Orchestration. Softw. Syst. Model. 6(1): 83-110 (2007) - 2006
- [j47]Xiaozhou Li, Jayadev Misra, C. Greg Plaxton:
Concurrent Maintenance of Rings. Distributed Comput. 19(2): 126-148 (2006) - [c34]David Kitchin, William R. Cook, Jayadev Misra:
A Language for Task Orchestration and Its Semantic Properties. CONCUR 2006: 477-491 - [c33]William R. Cook, Sourabh Patwardhan, Jayadev Misra:
Workflow Patterns in Orc. COORDINATION 2006: 82-96 - [e2]Jayadev Misra, Tobias Nipkow, Emil Sekerinski:
FM 2006: Formal Methods, 14th International Symposium on Formal Methods, Hamilton, Canada, August 21-27, 2006, Proceedings. Lecture Notes in Computer Science 4085, Springer 2006, ISBN 3-540-37215-6 [contents] - 2005
- [c32]Tony Hoare, Jayadev Misra:
Verified Software: Theories, Tools, Experiments Vision of a Grand Challenge Project. VSTTE 2005: 1-18 - 2004
- [c31]Xiaozhou Li, Jayadev Misra, C. Greg Plaxton:
Brief announcement: concurrent maintenance of rings. PODC 2004: 376 - [c30]Jayadev Misra:
A Programming Model for the Orchestration of Web Services. SEFM 2004: 2-11 - [c29]Xiaozhou Li, Jayadev Misra, C. Greg Plaxton:
Active and Concurrent Topology Maintenance. DISC 2004: 320-334 - 2003
- [j46]Jayadev Misra:
Derivation of a parallel string matching algorithm. Inf. Process. Lett. 85(5): 255-260 (2003) - [c28]Jayadev Misra, Wolfgang Reisig, Michael Schöttner, Laurent Lefèvre:
Topic Introduction. Euro-Par 2003: 623 - [c27]Young-ri Choi, Siddhartha Rai, Vinay Sampath Kumar, Jayadev Misra, Harrick M. Vin:
Computing with Distributed Resources. JMLC 2003: 23-24 - 2002
- [j45]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) - [j44]Jayadev Misra:
A Simple, Object-Based View of Multiprogramming. Formal Methods Syst. Des. 20(1): 23-45 (2002) - [c26]Young-ri Choi, Amit Garg, Siddhartha Rai, Jayadev Misra, Harrick M. Vin:
Orchestrating Computations on the World-Wide Web. Euro-Par 2002: 1-20 - [c25]Jayadev Misra:
The Case against a Grand Unification Theory. ICSR 2002: 328 - [c24]Markus Kaltenbach, Jayadev Misra:
A Theory of Hints in Model Checking. 10th Anniversary Colloquium of UNU/IIST 2002: 423-438 - 2001
- [b2]Jayadev Misra:
A Discipline of Multiprogramming - Programming Theory for Distributed Applications. Monographs in Computer Science, Springer 2001, ISBN 978-1-4612-6427-9, pp. 1-420 - [j43]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) - [j42]Edsger W. Dijkstra, Jayadev Misra:
Designing a Calculational Proof of Cantor's Theorem. Am. Math. Mon. 108(5): 440-443 (2001) - [c23]Jayadev Misra, Harrick M. Vin:
Orchestrating Computations on the World-Wide Web. APSEC 2001: 305- - [c22]Jayadev Misra:
A Programming Model for Wide-Area Computing. FME 2001: 222 - 2000
- [j41]Rajeev Joshi, Jayadev Misra:
Maximally Concurrent Programs. Formal Aspects Comput. 12(2): 100-119 (2000) - [c21]Jayadev Misra:
Object-Oriented Programming for Wide-Area Computing. FMOODS 2000: 209 - [c20]Rajeev Joshi, Jayadev Misra:
Toward a theory of maximally concurrent programs (shortened version). PODC 2000: 319-328
1990 – 1999
- 1998
- [c19]Jayadev Misra:
An Object Model for Multiprogramming. IPPS/SPDP Workshops 1998: 881-889 - 1997
- [c18]Lorenzo Alvisi, Rajeev Joshi, Calvin Lin, Jayadev Misra:
Seuss: What the Doctor Ordered. PDSE 1997: 284-290 - 1996
- [j40]Jayadev Misra:
A Discipline of Multiprogramming. ACM Comput. Surv. 28(4es): 49 (1996) - [j39]J. Allen Carruth, Jayadev Misra:
Proof of a Real-Time Mutual-Exclusion Algorithm. Parallel Process. Lett. 6(2): 251-257 (1996) - 1994
- [j38]Jayadev Misra:
Powerlist: A Structure for Parallel Recursion. ACM Trans. Program. Lang. Syst. 16(6): 1737-1767 (1994) - [c17]Jayadev Misra:
A Discipline of Multiprogramming. Specification of Parallel Algorithms 1994: 357-381 - 1992
- [j37]Jayadev Misra:
Loosely-coupled processes. Future Gener. Comput. Syst. 8(4): 269-286 (1992) - [j36]Jayadev Misra:
Corrigenda: Phase Synchronization. Inf. Process. Lett. 41(1): 59 (1992) - [j35]Jayadev Misra, David Gries:
A Constructive Proof of Vizing's Theorem. Inf. Process. Lett. 41(3): 131-133 (1992) - 1991
- [j34]Jayadev Misra:
Phase Synchronization. Inf. Process. Lett. 38(2): 101-105 (1991) - [c16]Jayadev Misra:
A Perspective on Parallel Program Design. Research Directions in High-Level Parallel Programming Languages 1991: 2-5 - [c15]Jayadev Misra:
Loosely-Coupled Processes. PARLE (2) 1991: 1-26 - 1990
- [j33]Jayadev Misra:
Equational Reasoning About Nondeterministic Processes. Formal Aspects Comput. 2(2): 167-195 (1990) - [j32]Jayadev Misra:
Specifying Concurrent Objects as Communicating Processes. Sci. Comput. Program. 14(2-3): 159-184 (1990)
1980 – 1989
- 1989
- [b1]K. Mani Chandy, Jayadev Misra:
Parallel program design - a foundation. Addison-Wesley 1989, ISBN 978-0-201-05866-6, pp. I-XXVIII, 1-516 - [j31]Jayadev Misra:
A Simple Proof of a Simple Consensus Algorithm. Inf. Process. Lett. 33(1): 21-24 (1989) - [c14]Jayadev Misra:
Specifications of Concurrently Accessed Data. MPC 1989: 91-114 - [c13]Jayadev Misra:
Equational Reasoning About Nondeterministic Processes. PODC 1989: 29-44 - 1988
- [j30]K. Mani Chandy, Jayadev Misra:
Another view on "fairness". ACM SIGSOFT Softw. Eng. Notes 13(3): 20 (1988) - 1987
- [j29]Rajive L. Bagrodia, K. Mani Chandy, Jayadev Misra:
A Message-Based Approach to Discrete-Event Simulation. IEEE Trans. Software Eng. 13(6): 654-665 (1987) - [c12]K. Mani Chandy, Jayadev Misra:
Parallelism and Programming: A Perspective. FSTTCS 1987: 173-194 - 1986
- [j28]Jayadev Misra:
Distributed Discrete-Event Simulation. ACM Comput. Surv. 18(1): 39-65 (1986) - [j27]K. Mani Chandy, Jayadev Misra:
How Processes Learn. Distributed Comput. 1(1): 40-52 (1986) - [j26]K. Mani Chandy, Jayadev Misra:
Systolic Algorithms as Programs. Distributed Comput. 1(3): 177-183 (1986) - [j25]Jayadev Misra:
Axioms for Memory Access in Asynchronous Hardware Systems. ACM Trans. Program. Lang. Syst. 8(1): 142-153 (1986) - [j24]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) - 1985
- [c11]K. Mani Chandy, Jayadev Misra:
How Processes Learn. PODC 1985: 204-214 - 1984
- [j23]K. Mani Chandy, Jayadev Misra:
The Drinking Philosopher's Problem. ACM Trans. Program. Lang. Syst. 6(4): 632-646 (1984) - [c10]Jayadev Misra:
Axioms for Memory Access in Asynchronous Hardware Systems. Seminar on Concurrency 1984: 96-110 - [c9]K. Mani Chandy, Jayadev Misra:
A Paradigm for Detecting Quiescent Properties in Distributed Computations. Logics and Models of Concurrent Systems 1984: 325-341 - [e1]Tiko Kameda, Jayadev Misra, Joseph G. Peters, Nicola Santoro:
Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, Vancouver, B. C., Canada, August 27-29, 1984. ACM 1984, ISBN 0-89791-143-1 [contents] - 1983
- [j22]K. Mani Chandy, Jayadev Misra, Laura M. Haas:
Distributed Deadlock Detection. ACM Trans. Comput. Syst. 1(2): 144-156 (1983) - [c8]Jayadev Misra:
Detecting Termination of Distributed Computations Using Markers. PODC 1983: 290-294 - 1982
- [j21]K. Mani Chandy, Jayadev Misra:
Distributed Computation on Graphs: Shortest Path Algorithms. Commun. ACM 25(11): 833-837 (1982) - [j20]Jayadev Misra, David Gries:
Finding Repeated Elements. Sci. Comput. Program. 2(2): 143-152 (1982) - [j19]Jayadev Misra, K. Mani Chandy:
Termination Detection of Diffusing Computations in Communicating Sequential Processes. ACM Trans. Program. Lang. Syst. 4(1): 37-43 (1982) - [j18]Jayadev Misra, K. Mani Chandy:
A Distributed Graph Algorithm: Knot Detection. ACM Trans. Program. Lang. Syst. 4(4): 678-686 (1982) - [c7]K. Mani Chandy, Jayadev Misra, Robert Berry, Doug Neuse:
The use of performance models in systematic design. AFIPS National Computer Conference 1982: 251-256 - [c6]K. Mani Chandy, Jayadev Misra:
A Distributed Algorithm for Detecting Resource Deadlocks in Distributed Systems. PODC 1982: 157-164 - [c5]Jayadev Misra, K. Mani Chandy, Todd Smith:
Proving Safety and Liveness of Communicating Processes with Examples. PODC 1982: 201-208 - 1981
- [j17]K. Mani Chandy, Jayadev Misra:
Asynchronous Distributed Simulation via a Sequence of Parallel Computations. Commun. ACM 24(4): 198-206 (1981) - [j16]Jayadev Misra:
An Exercise in Program Explanation. ACM Trans. Program. Lang. Syst. 3(1): 104-109 (1981) - [j15]Jayadev Misra, K. Mani Chandy:
Proofs of Networks of Processes. IEEE Trans. Software Eng. 7(4): 417-426 (1981) - [c4]Doug Neuse, K. Mani Chandy, Jayadev Misra, Robert Berry:
A Computer Modeling System Based on a User-Extensible Modeling Library. Int. CMG Conference 1981: 127-129 - 1980
- [j14]K. Mani Chandy, Jayadev Misra:
A simple model of distributed programs based on implementation-hiding and process autonomy. ACM SIGPLAN Notices 15(7-8): 26-35 (1980)
1970 – 1979
- 1979
- [j13]K. Mani Chandy, Victor Holmes, Jayadev Misra:
Distributed Simulation of Networks. Comput. Networks 3: 105-113 (1979) - [j12]Jayadev Misra:
Space-Time Trade Off in Implementing Certain Set Operations. Inf. Process. Lett. 8(2): 81-85 (1979) - [j11]K. Mani Chandy, Jayadev Misra:
Deadlock Absence Proofs for Networks of Communicating Processes. Inf. Process. Lett. 9(4): 185-189 (1979) - [j10]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) - 1978
- [j9]David Gries, Jayadev Misra:
A Linear Sieve Algorithm for Finding Prime Numbers. Commun. ACM 21(12): 999-1003 (1978) - [j8]Jayadev Misra:
A Technique of Algorithm Construction on Sequences. IEEE Trans. Software Eng. 4(1): 65-69 (1978) - [j7]Jayadev Misra:
An Approach to Formal Definitions and Proofs of Programming Principles. IEEE Trans. Software Eng. 4(5): 410-413 (1978) - [j6]Jayadev Misra:
Some Aspects of the Verification of Loop Computations. IEEE Trans. Software Eng. 4(6): 478-486 (1978) - [c3]K. Mani Chandy, Jayadev Misra:
A nontrivial example of concurrent processing: Distributed simulation. COMPSAC 1978: 822-826 - 1977
- [j5]Sukhamay Kundu, Jayadev Misra:
A Linear Tree Partitioning Algorithm. SIAM J. Comput. 6(1): 151-154 (1977) - [j4]Jayadev Misra:
Prospects and Limitations of Automatic Assertion Generation for Loop Programs. SIAM J. Comput. 6(4): 718-729 (1977) - 1976
- [c2]Jayadev Misra:
A principle of algorithm design on limited problem domain. DAC 1976: 479-483 - [c1]Sanat K. Basu, Jayadev Misra:
Some Classes of Naturally Provable Programs. ICSE 1976: 400-406 - 1975
- [j3]Jayadev Misra, Robert Endre Tarjan:
Optimal Chain Partitions of Trees. Inf. Process. Lett. 4(1): 24-26 (1975) - [j2]Jayadev Misra:
Remark on "Algorithm 246: Graycode [Z]". ACM Trans. Math. Softw. 1(3): 285 (1975) - [j1]Sanat K. Basu, Jayadev Misra:
Proving Loop Programs. IEEE Trans. Software Eng. 1(1): 76-86 (1975)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-21 21:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
