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

Marty Ossefort

dblp:35/3354 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 1983
—ORCID · none

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

Software engineering, systems software and programming languages · 2 · 2 first-authorComputer networks · 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
2 papers
Program verification · 62% Concurrent programming · 38%
Computer networks
1 paper
Internet architecture and protocols · 100%

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

TopicWeightPapersLastEvidence papers
Concurrent programming › concurrency theory › process calculi
communicating sequential processes		 0.011983
Correctness Proofs of Communicating Processes: Three Illustrative Examples from the Literature · ACM Trans. Program. Lang. Syst. 1983
Concurrent programming › concurrency theory
process calculi		 0.011983
Correctness Proofs of Communicating Processes: Three Illustrative Examples from the Literature · ACM Trans. Program. Lang. Syst. 1983
Program verification
program logic		 0.011983
Correctness Proofs of Communicating Processes: Three Illustrative Examples from the Literature · ACM Trans. Program. Lang. Syst. 1983
Program verification
protocol verification		 0.011983
Proving safety properties for a general communication protocol · SIGCOMM 1983
Program verification
safety verification		 0.011983
Proving safety properties for a general communication protocol · SIGCOMM 1983
Internet architecture and protocols
protocol design		 0.011983
Proving safety properties for a general communication protocol · SIGCOMM 1983
Program verification
correctness proof		 0.011983
Correctness Proofs of Communicating Processes: Three Illustrative Examples from the Literature · ACM Trans. Program. Lang. Syst. 1983

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

message-passing network verification · 0.0misra-chandy proof method · 0.0
YearPublicationVenuePosition
1983 Proving safety properties for a general communication protocol
abstract
As the practice of networking has become more widespread, the study of communications protocols has grown accordingly. At the same time, techniques for verification of message-passing networks have been developed to the point where they can now be used to prove safety properties about such protocols.
Marty Ossefort
 SIGCOMM1
1983 Correctness Proofs of Communicating Processes: Three Illustrative Examples from the Literature
abstract
The proof method for networks of processes proposed by Misra and Chandy is demonstrated on three examples from the literature.It is shown that this method is easy to use, preserves process autonomy in the network proof, and conforms naturally to the hierarchical structure of the network.Two very large-scale integration algorithms and a sorting network are presented in Hoare's communicating sequential processes model, specified completely, and formally proved.
Marty Ossefort
 ACM Trans. Program. Lang. Syst.1
1982 Corrigendum to "Proofs of Networks of Processes''
Marty Ossefort
 IEEE Trans. Software Eng.1