Akshay K. Deshpande

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

? Tutorial for this page

Demo Data from EDBT 2026 / reviewers in the wild / expert

dblp:33/3358 · DBLP profile ↗

← Back

2ranked-venue papers

1as first author

0since 2021 · last 1991

—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 1Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages 1 paper		Program verification · 50% Concurrent programming · 50%
Computer architecture, parallel and distributed computing, and storage systems 1 paper		Parallel and multicore computing · 100%

Topics — the 1 heaviest of 3, each with the papers that count most for it

Topic	Weight	Papers	Last	Evidence papers
Program verification concurrent program verification	0.0	1	1989	A review of specification and verification methods for parallel programs including the dataflow approach · Proc. IEEE 1989

Methods — techniques the papers use, named apart from their topics

formal proof systems · 0.0data flow graph · 0.0

Year	Publication	Venue	Position
1991	Specification of concurrent processes using a dataflow model of computation and partially ordered events Krishna M. Kavi, Akshay K. Deshpande	J. Syst. Softw.	2
1989	A review of specification and verification methods for parallel programs including the dataflow approach abstract Parallel programs are usually described informally, and these descriptions are implemented on parallel computer systems. When a program does not run correctly, it is often very difficult to determine whether the program description or the implementation is incorrect. This has led to a search for more formal descriptions of parallel programs and to proof systems for the verification of the implementations. Formal methods for the specification and verification of parallel programs are reviewed, and a new method that is based on dataflow graphs is described.> Akshay K. Deshpande, Krishna M. Kavi	Proc. IEEE	1