Jayadev Misra

According to our database1, Jayadev Misra authored at least 94 papers between 1975 and 2017.

Collaborative distances:
  • Dijkstra number2 of one.
  • Erdős number3 of three.


IEEE Fellow

IEEE Fellow 1992, "For contributions to the algorithms and theory of distributed computing.".



In proceedings 
PhD thesis 



On csauthors.net:


Bilateral Proofs of Safety and Progress Properties of Concurrent Programs.
CoRR, 2017

Parallel discrete event simulation: The making of a field.
Proceedings of the 2017 Winter Simulation Conference, 2017

Mapping among the nodes of infinite trees: A variation of Kőnig's infinity lemma.
Inf. Process. Lett., 2015

A Denotational Semantic Theory of Concurrent Systems.
Proceedings of the Logic, Rewriting, and Concurrency, 2015

A personal perspective on concurrency.
Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 2014

Proceedings of the Formal Aspects of Component Software - 10th International Symposium, 2013

A secure voting scheme based on rational self-interest.
Formal Asp. Comput., 2012

Virtual Time and Timeout in Client-Server Networks - (Extended Abstract).
Proceedings of the Theoretical Aspects of Computing - ICTAC 2011 - 8th International Colloquium, Johannesburg, South Africa, August 31, 2011

Maintaining the Ranch topology.
J. Parallel Distributed Comput., 2010

Quicksort: Combining Concurrency, Recursion, and Mutable Data Structures.
Proceedings of the Reflections on the Work of C. A. R. Hoare., 2010

The verified software initiative: A manifesto.
ACM Comput. Surv., 2009

Preface to special issue on software verification.
ACM Comput. Surv., 2009

The Orc Programming Language.
Proceedings of the Formal Techniques for Distributed Systems, 2009

Structured Interacting Computations.
Proceedings of the Software-Intensive Systems and New Computing Paradigms, 2008

A timed semantics of Orc.
Theor. Comput. Sci., 2008

Simulation, Orchestration and Logical Clocks.
Proceedings of the FM 2008: Formal Methods, 2008

Simulation Using Orchestration.
Proceedings of the Algebraic Methodology and Software Technology, 2008

Computation Orchestration.
Software and Systems Modeling, 2007

Concurrent Maintenance of Rings.
Distributed Comput., 2006

Workflow Patterns in Orc.
Proceedings of the Coordination Models and Languages, 8th International Conference, 2006

A Language for Task Orchestration and Its Semantic Properties.
Proceedings of the CONCUR 2006 - Concurrency Theory, 17th International Conference, 2006

Verified Software: Theories, Tools, Experiments Vision of a Grand Challenge Project.
Proceedings of the Verified Software: Theories, 2005

Active and Concurrent Topology Maintenance.
Proceedings of the Distributed Computing, 18th International Conference, 2004

A Programming Model for the Orchestration of Web Services.
Proceedings of the 2nd International Conference on Software Engineering and Formal Methods (SEFM 2004), 2004

Brief announcement: concurrent maintenance of rings.
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

Derivation of a parallel string matching algorithm.
Inf. Process. Lett., 2003

Computing with Distributed Resources.
Proceedings of the Modular Programming Languages, Joint Modular Languages Conference, 2003

Topic Introduction.
Proceedings of the Euro-Par 2003. Parallel Processing, 2003

A Simple, Object-Based View of Multiprogramming.
Formal Methods Syst. Des., 2002

In memoriam: Edsger W. Dijkstra 1930-2002.
Commun. ACM, 2002

A Theory of Hints in Model Checking.
Proceedings of the Formal Methods at the Crossroads. From Panacea to Foundational Support, 2002

The Case against a Grand Unification Theory.
Proceedings of the Software Reuse: Methods, 2002

Orchestrating Computations on the World-Wide Web.
Proceedings of the Euro-Par 2002, 2002

A Discipline of Multiprogramming - Programming Theory for Distributed Applications
Monographs in Computer Science, Springer, ISBN: 978-1-4419-8528-6, 2001

Designing a Calculational Proof of Cantor's Theorem.
Am. Math. Mon., 2001

A walk over the shortest path: Dijkstra's Algorithm viewed as fixed-point computation.
Inf. Process. Lett., 2001

A Programming Model for Wide-Area Computing.
Proceedings of the FME 2001: Formal Methods for Increasing Software Productivity, 2001

Orchestrating Computations on the World-Wide Web.
Proceedings of the 8th Asia-Pacific Software Engineering Conference (APSEC 2001), 2001

Maximally Concurrent Programs.
Formal Asp. Comput., 2000

Toward a theory of maximally concurrent programs (shortened version).
Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000

Object-Oriented Programming for Wide-Area Computing.
Proceedings of the Formal Methods for Open Object-Based Distributed Systems IV, 2000

An Object Model for Multiprogramming.
Proceedings of the Parallel and Distributed Processing, 10 IPPS/SPDP'98 Workshops Held in Conjunction with the 12th International Parallel Processing Symposium and 9th Symposium on Parallel and Distributed Processing, Orlando, Florida, USA, March 30, 1998

Seuss: What the Doctor Ordered.
Proceedings of the International Symposium on Software Engineering for Parallel and Distributed Systems, 1997

Proof of a Real-Time Mutual-Exclusion Algorithm.
Parallel Process. Lett., 1996

A Discipline of Multiprogramming.
ACM Comput. Surv., 1996

Powerlist: A Structure for Parallel Recursion.
ACM Trans. Program. Lang. Syst., 1994

A Constructive Proof of Vizing's Theorem.
Inf. Process. Lett., 1992

Corrigenda: Phase Synchronization.
Inf. Process. Lett., 1992

Loosely-coupled processes.
Future Gener. Comput. Syst., 1992

Phase Synchronization.
Inf. Process. Lett., 1991

A Perspective on Parallel Program Design.
Proceedings of the Research Directions in High-Level Parallel Programming Languages, 1991

Specifying Concurrent Objects as Communicating Processes.
Sci. Comput. Program., 1990

Equational Reasoning About Nondeterministic Processes.
Formal Asp. Comput., 1990

A Simple Proof of a Simple Consensus Algorithm.
Inf. Process. Lett., 1989

Specifications of Concurrently Accessed Data.
Proceedings of the Mathematics of Program Construction, 1989

Parallel program design - a foundation.
Addison-Wesley, ISBN: 978-0-201-05866-6, 1989

A Message-Based Approach to Discrete-Event Simulation.
IEEE Trans. Software Eng., 1987

Parallelism and Programming: A Perspective.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1987

Axioms for Memory Access in Asynchronous Hardware Systems.
ACM Trans. Program. Lang. Syst., 1986

An Example of Stepwise Refinement of Distributed Programs: Quiescence Detection.
ACM Trans. Program. Lang. Syst., 1986

Systolic Algorithms as Programs.
Distributed Comput., 1986

How Processes Learn.
Distributed Comput., 1986

Distributed Discrete-Event Simulation.
ACM Comput. Surv., 1986

The Drinking Philosopher's Problem.
ACM Trans. Program. Lang. Syst., 1984

A Paradigm for Detecting Quiescent Properties in Distributed Computations.
Proceedings of the Logics and Models of Concurrent Systems, 1984

Distributed Deadlock Detection
ACM Trans. Comput. Syst., 1983

Detecting Termination of Distributed Computations Using Markers.
Proceedings of the Second Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 1983

A Distributed Graph Algorithm: Knot Detection.
ACM Trans. Program. Lang. Syst., 1982

Termination Detection of Diffusing Computations in Communicating Sequential Processes.
ACM Trans. Program. Lang. Syst., 1982

Finding Repeated Elements.
Sci. Comput. Program., 1982

Distributed Computation on Graphs: Shortest Path Algorithms.
Commun. ACM, 1982

Proving Safety and Liveness of Communicating Processes with Examples.
Proceedings of the ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 1982

A Distributed Algorithm for Detecting Resource Deadlocks in Distributed Systems.
Proceedings of the ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 1982

The use of performance models in systematic design.
Proceedings of the American Federation of Information Processing Societies: 1982 National Computer Conference, 1982

Proofs of Networks of Processes.
IEEE Trans. Software Eng., 1981

An Exercise in Program Explanation.
ACM Trans. Program. Lang. Syst., 1981

Asynchronous Distributed Simulation via a Sequence of Parallel Computations.
Commun. ACM, 1981

A Computer Modeling System Based on a User-Extensible Modeling Library.
Proceedings of the Seventh International Computer Measurement Group Conference, 1981

Distributed Simulation: A Case Study in Design and Verification of Distributed Programs.
IEEE Trans. Software Eng., 1979

Space-Time Trade Off in Implementing Certain Set Operations.
Inf. Process. Lett., 1979

Deadlock Absence Proofs for Networks of Communicating Processes.
Inf. Process. Lett., 1979

Distributed Simulation of Networks.
Comput. Networks, 1979

Some Aspects of the Verification of Loop Computations.
IEEE Trans. Software Eng., 1978

An Approach to Formal Definitions and Proofs of Programming Principles.
IEEE Trans. Software Eng., 1978

A Technique of Algorithm Construction on Sequences.
IEEE Trans. Software Eng., 1978

A Linear Sieve Algorithm for Finding Prime Numbers.
Commun. ACM, 1978

A nontrivial example of concurrent processing: Distributed simulation.
Proceedings of the IEEE Computer Society's Second International Computer Software and Applications Conference, 1978

Prospects and Limitations of Automatic Assertion Generation for Loop Programs.
SIAM J. Comput., 1977

A Linear Tree Partitioning Algorithm.
SIAM J. Comput., 1977

Some Classes of Naturally Provable Programs.
Proceedings of the 2nd International Conference on Software Engineering, 1976

A principle of algorithm design on limited problem domain.
Proceedings of the 13th Design Automation Conference, 1976

Proving Loop Programs.
IEEE Trans. Software Eng., 1975

Remark on "Algorithm 246: Graycode [Z]".
ACM Trans. Math. Softw., 1975

Optimal Chain Partitions of Trees.
Inf. Process. Lett., 1975