Jayadev Misra

Last updated
Jayadev Misra
NAEfullView.jpg
Born(1947-10-17)October 17, 1947
India
CitizenshipUS
Alma mater
Known forContributions in formal aspects of distributed and concurrent computing, in particular, projects Unity and Orc.
Scientific career
Fields Computer science
Institutions
Thesis A Study of Strategies for Multistage Testing  (1972)
Doctoral advisor Harlan Mills
Website "Jayadev Misra".
Notes

Jayadev Misra is an Indian-born computer scientist who has spent most of his professional career in the United States. He is the Schlumberger Centennial Chair Emeritus in computer science and a University Distinguished Teaching Professor Emeritus at the University of Texas at Austin. Professionally he is known for his contributions to the formal aspects of concurrent programming and for jointly spearheading, with Sir Tony Hoare, the project on Verified Software Initiative (VSI).

Contents

Education and early career

Misra received a B.Tech. in electrical engineering from IIT Kanpur, India in 1969 and a Ph.D. in electrical engineering and computer science from the Johns Hopkins University, Baltimore, Maryland in 1972. After a brief period working for IBM, he joined the University of Texas at Austin in 1974 where he has remained throughout his career, except for a sabbatical year spent at Stanford University during 1983–1984. He retired from active teaching in 2015.

Major professional contributions

Misra and K. Mani Chandy have made a number of important contributions in the area of concurrent computing. They developed a programming notation and a logic, called UNITY, to describe concurrent computations. Leslie Lamport says: "The first major step in getting beyond traditional programming languages to describe concurrent algorithms was Misra and Chandy's Unity" [1] and "Misra and Chandy developed proof rules to formalize the style of reasoning that had been developed for proving invariance and leads-to properties. Unity provided the most elegant formulation yet for these proofs." [2]

Misra and Chandy (and, independently, Randy Bryant) have developed a conservative algorithm for distributed discrete-event simulation, which is now commonly used in a variety of areas. They also developed a number of fundamental algorithms for resource allocation (the drinking philosophers problem), deadlock detection, graph algorithms, and a theory of knowledge transmission in distributed systems. In collaboration with David Gries, Misra proposed the first algorithm for the heavy-hitters problem. Misra proposed a set of axioms for concurrent memory access that underlie the theory of linearizability.

Misra's most recent research project, called Orc, [3] attempts to develop an algebra of concurrent computing that will help integrate different pieces of software for concurrent execution.

Awards and honors

Selected publications

Related Research Articles

<span class="mw-page-title-main">Computer science</span> Study of computation

Computer science is the study of computation, information, and automation. Computer science spans theoretical disciplines to applied disciplines.

<span class="mw-page-title-main">Mutual exclusion</span> In computing, restricting data to be accessible by one thread at a time

In computer science, mutual exclusion is a property of concurrency control, which is instituted for the purpose of preventing race conditions. It is the requirement that one thread of execution never enters a critical section while a concurrent thread of execution is already accessing said critical section, which refers to an interval of time during which a thread of execution accesses a shared resource or shared memory.

<span class="mw-page-title-main">Tony Hoare</span> British computer scientist

Sir Charles Antony Richard Hoare, also known as Tony Hoare or by his initials C. A. R. Hoare is a British computer scientist who has made foundational contributions to programming languages, algorithms, operating systems, formal verification, and concurrent computing. His work earned him the Turing Award, usually regarded as the highest distinction in computer science, in 1980.

<span class="mw-page-title-main">Leslie Lamport</span> American computer scientist and mathematician

Leslie B. Lamport is an American computer scientist and mathematician. Lamport is best known for his seminal work in distributed systems, and as the initial developer of the document preparation system LaTeX and the author of its first manual.

<span class="mw-page-title-main">Per Brinch Hansen</span> Danish-American computer scientist

Per Brinch Hansen was a Danish-American computer scientist known for his work in operating systems, concurrent programming and parallel and distributed computing.

<span class="mw-page-title-main">Concurrency (computer science)</span> Ability to execute a task in a non-serial manner

In computer science, concurrency is the ability of different parts or units of a program, algorithm, or problem to be executed out-of-order or in partial order, without affecting the outcome. This allows for parallel execution of the concurrent units, which can significantly improve overall speed of the execution in multi-processor and multi-core systems. In more technical terms, concurrency refers to the decomposability of a program, algorithm, or problem into order-independent or partially-ordered components or units of computation.

A Byzantine fault is a condition of a system, particularly a distributed computing system, where a fault occurs such that different symptoms are presented to different observers, including imperfect information on whether a system component has failed. The term takes its name from an allegory, the "Byzantine generals problem", developed to describe a situation in which, to avoid catastrophic failure of a system, the system's actors must agree on a strategy, but some of these actors are unreliable in such a way as to cause other (good) actors to disagree on the strategy and they may be unaware of the disagreement.

The Larch Prover, or LP for short, is an interactive theorem proving system for multi-sorted first-order logic. It was used at MIT and elsewhere during the 1990s to reason about designs for circuits, concurrent algorithms, hardware, and software.

<span class="mw-page-title-main">Barbara Liskov</span> American computer scientist

Barbara Liskov is an American computer scientist who has made pioneering contributions to programming languages and distributed computing. Her notable work includes the introduction of abstract data types and the accompanying principle of data abstraction, along with the Liskov substitution principle, which applies these ideas to object-oriented programming, subtyping, and inheritance. Her work was recognized with the 2008 Turing Award, the highest distinction in computer science.

<span class="mw-page-title-main">David Gries</span> American computer scientist

David Gries is an American computer scientist at Cornell University, mainly known for his books The Science of Programming (1981) and A Logical Approach to Discrete Math.

Maurice Peter Herlihy is an American computer scientist active in the field of multiprocessor synchronization. Herlihy has contributed to areas including theoretical foundations of wait-free synchronization, linearizable data structures, applications of combinatorial topology to distributed computing, as well as hardware and software transactional memory. He is the An Wang Professor of Computer Science at Brown University, where he has been a member of the faculty since 1994.

Kanianthra Mani Chandy is the Simon Ramo Professor of Computer Science at the California Institute of Technology (Caltech). He has been the Executive Officer of the Computer Science Department twice, and he has been a professor at Caltech since 1989. He also served as Chair of the Division of Engineering and Applied Science at the California Institute of Technology.

<span class="mw-page-title-main">Orc (programming language)</span>

Orc is a concurrent, nondeterministic computer programming language created by Jayadev Misra at the University of Texas at Austin.

The Chandy–Misra–Haas algorithm resource model checks for deadlock in a distributed system. It was developed by K. Mani Chandy, Jayadev Misra and Laura M Haas.

Michel Raynal is a French informatics scientist, professor at IRISA, University of Rennes, France. He is known for his contributions in the fields of algorithms, computability, and fault-tolerance in the context of concurrent and distributed systems. Michel Raynal is also Distinguished Chair professor at the Hong Kong Polytechnic University and editor of the “Synthesis Lectures on Distributed Computing Theory” published by Morgan & Claypool. He is a senior member of Institut Universitaire de France and a member of Academia Europaea.

<span class="mw-page-title-main">Robert Shostak</span> American computer scientist

Robert Eliot Shostak is an American computer scientist and Silicon Valley entrepreneur. He is most noted academically for his seminal work in the branch of distributed computing known as Byzantine Fault Tolerance. He is also known for co-authoring the Paradox Database, and most recently, the founding of Vocera Communications, a company that makes wearable, Star Trek-like communication badges.

In computer science, interference freedom is a technique for proving partial correctness of concurrent programs with shared variables. Hoare logic had been introduced earlier to prove correctness of sequential programs. In her PhD thesis under advisor David Gries, Susan Owicki extended this work to apply to concurrent programs.

References

  1. ↑ Lamport, Leslie (May 1994). The Temporal Logic of Actions (Technical report) (ACM Transactions on Programming Languages and Systems 16 ed.). Microsoft. 79.
  2. ↑ Lamport, Leslie (1994). "Verification and specification of concurrent programs". Distributed Systems, Methods and Tools for Specification. An Advanced Course. A Decade of Concurrency Reflections and Perspectives. Lecture Notes in Computer Science (LNCS). Vol. 803. Springer, Berlin, Heidelberg. p. 352. doi:10.1007/3-540-58043-3_23.
  3. ↑ "Orc Language".
  4. ↑ "IFIP Announces 2023 Awards". IFIP. 26 October 2023. Archived from the original on 2023-11-03. Retrieved 2023-11-03.
  5. ↑ "NAE Website - Dr. Jayadev Misra". NAE . Retrieved 2023-11-03.
  6. ↑ "Docteur Honoris Causa ENS-PARIS-SACLAY".
  7. ↑ "Two UTCS Faculty Among the Most Highly Cited Researchers | Department of Computer Science". Computer Science Department, UT Austin. Archived from the original on 2015-12-25. Retrieved 2023-11-03.
  8. ↑ "ACM Fellows". ACM . Retrieved 2023-11-03.
  9. ↑ "IEEE Fellows Directory - Chronological Listing". IEEE . Retrieved 2023-11-03.
  10. ↑ "Past Distinguished Alumnus Awardees (DAA)". IIT Kanpur . Retrieved 2023-11-03.
  11. ↑ "Members - TAMEST (The Academy of Medicine, Engineering and Science of Texas)". TAMEST. Archived from the original on 2023-10-18. Retrieved 2023-11-03.
  12. ↑ Chandy, K. Mani; Misra, Jayadev (1988). Parallel Program Design - a Foundation. Addison-Wesley. ISBN   978-0-201-05866-6.
  13. ↑ Misra, Jayadev (March 1986). "Distributed discrete-event simulation". ACM Computing Surveys. 18 (1): 39–65. doi:10.1145/6462.6485. S2CID   18130323.
  14. ↑ Misra, Jayadev; Chandy, K. Mani (July 1981). "Proofs of networks of processes". IEEE Transactions on Software Engineering. SE-7 (4): 417–426. doi:10.1109/TSE.1981.230844. S2CID   15624919.
  15. ↑ Chandy, K. Mani; Misra, Jayadev; Haas, LAURA M. (May 1983). "Distributed deadlock detection". ACM Transactions on Computer Systems. 1 (2): 144–156. doi: 10.1145/357360.357365 . S2CID   9147318.
  16. ↑ Chandy, K. Mani; Misra, Jayadev (October 1984). "The drinking philosophers problem". ACM Transactions on Programming Languages and Systems. 6 (4): 632–646. doi: 10.1145/1780.1804 . S2CID   5922362.
  17. ↑ Gries, David; Misra, Jayadev (November 1982). "Finding repeated elements". Science of Computer Programming. 2 (2): 143–152. doi: 10.1016/0167-6423(82)90012-0 . hdl: 1813/6345 .
  18. ↑ Chandy, K. Mani; Misra, Jayadev (August 1985). How processes learn. PODC 85: Proceedings of the fourth annual ACM Symposium on Principles of Distributed Computing. Minaki, Ontario, Canada: Association for Computing Machinery. pp. 204–214. doi:10.1145/323596.323615.
  19. ↑ Kitchin, David; Quark, Adrian; Cook, William; Misra, Jayadev (2009). "The Orc Programming Language". In David Lee; Antónia Lopes; Arnd Poetzsch-Heffter (eds.). Lecture Notes in Computer Science. Formal Techniques for Distributed Systems, Joint 11th IFIP WG 6.1. Vol. 5522. Springer Verlag. pp. 204–214. doi: 10.1007/978-3-642-02138-1_1 .
  20. ↑ Misra, Jayadev (January 1986). "Axioms for memory access in asynchronous hardware systems". ACM Transactions on Programming Languages and Systems. 8 (1): 142–153. doi: 10.1145/5001.5007 . S2CID   1326311.
  21. ↑ Misra, Jayadev (November 1994). "Powerlist: A structure for parallel recursion". ACM Transactions on Programming Languages and Systems. 16 (6): 1737–1767. doi: 10.1145/197320.197356 . S2CID   2913474.
  22. ↑ Hoare, Tony; Misra, Jayadev (2008). "Verified Software: Theories, Tools, Experiments Vision of a Grand Challenge Project". In B. Meyer, J. Woodcock (ed.). Verified Software: Theories, Tools, Experiments. VSTTE 2005. Lecture Notes in Computer Science. Vol. 4171. Springer Verlag. doi: 10.1007/978-3-540-69149-5_1 .
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.