Jayadev Misra

From MaRDI portal
Person:239151

Available identifiers

zbMath Open misra.jayadevMaRDI QIDQ239151

List of research outcomes





PublicationDate of PublicationType
An homage to the beautiful mathematical EWDs2024-10-28Paper
https://portal.mardi4nfdi.de/entity/Q58699262023-01-13Paper
Finding Effective Abstractions2022-02-14Paper
The Verified Software Initiative: A Manifesto2022-02-14Paper
CV2022-02-14Paper
The verified software initiative2019-08-09Paper
A Denotational Semantic Theory of Concurrent Systems2015-09-14Paper
Mapping among the nodes of infinite trees: a variation of Kőnig's infinity lemma2015-04-02Paper
Toward a theory of maximally concurrent programs (shortened version)2015-03-03Paper
Concurrent maintenance of rings2013-06-20Paper
A secure voting scheme based on rational self-interest2013-03-22Paper
Maintaining the Ranch topology2012-03-07Paper
Quicksort: Combining Concurrency, Recursion, and Mutable Data Structures2010-10-26Paper
A theory of hints in model checking.2010-03-30Paper
The Orc Programming Language2009-06-26Paper
Derivation of a parallel string matching algorithm2009-03-23Paper
Simulation Using Orchestration2009-01-27Paper
A timed semantics of Orc2008-08-06Paper
A Language for Task Orchestration and Its Semantic Properties2007-09-04Paper
Active and Concurrent Topology Maintenance2005-08-17Paper
https://portal.mardi4nfdi.de/entity/Q48129952004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q47384392004-08-11Paper
A walk over the shortest path: Dijkstra's algorithm viewed as fixed-point computation.2002-07-25Paper
A simple, object-based view of multiprogramming2002-04-11Paper
https://portal.mardi4nfdi.de/entity/Q27641432002-01-22Paper
Designing a Calculational Proof of Cantor's Theorem2002-01-13Paper
https://portal.mardi4nfdi.de/entity/Q27382892001-08-30Paper
Maximally concurrent programs2001-05-07Paper
https://portal.mardi4nfdi.de/entity/Q47626552001-02-22Paper
https://portal.mardi4nfdi.de/entity/Q49346212000-08-29Paper
https://portal.mardi4nfdi.de/entity/Q46925021993-06-05Paper
A constructive proof of Vizing's theorem1992-06-28Paper
Phase synchronization1992-06-26Paper
Equational reasoning about nondeterministic processes1990-01-01Paper
Specifying concurrent objects as communicating processes1990-01-01Paper
A simple proof of a simple consensus algorithm1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37835001987-01-01Paper
Systolic algorithms as programs1986-01-01Paper
How processes learn1986-01-01Paper
An example of stepwise refinement of distributed programs: quiescence detection1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37008211985-01-01Paper
Finding repeated elements1982-01-01Paper
Distributed computation on graphs1982-01-01Paper
Termination Detection of Diffusing Computations in Communicating Sequential Processes1982-01-01Paper
A Distributed Graph Algorithm: Knot Detection1982-01-01Paper
Proofs of Networks of Processes1981-01-01Paper
An Exercise in Program Explanation1981-01-01Paper
Deadlock absence proofs for networks of communicating processes1979-01-01Paper
Distributed Simulation: A Case Study in Design and Verification of Distributed Programs1979-01-01Paper
Distributed simulation of networks1979-01-01Paper
Space-time trade off in implementing certain set operations1979-01-01Paper
A linear sieve algorithm for finding prime numbers1978-01-01Paper
Some Aspects of the Verification of Loop Computations1978-01-01Paper
An Approach to Formal Definitions and Proofs of Programming Principles1978-01-01Paper
A Technique of Algorithm Construction on Sequences1978-01-01Paper
A Linear Tree Partitioning Algorithm1977-01-01Paper
Prospects and Limitations of Automatic Assertion Generation for Loop Programs1977-01-01Paper
Optimal chain partitions of trees1975-01-01Paper

Research outcomes over time

This page was built for person: Jayadev Misra