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

Mark Sherman 0001

dblp:298/4838 · also Mark Steven Sherman · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 1991
—ORCID · none

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

Computer networks · 2 · 1 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 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.

Computer networks
1 paper
Network management and operations · 91% Routing and switching · 9%
Software engineering, system software, and programming languages
1 paper
Programming languages and type systems · 100%

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

TopicWeightPapersLastEvidence papers
Programming languages and type systems
abstract data types		 0.011984
Paragon: Novel Uses of Type Hierarchies for Data Abstraction · POPL 1984
Network management and operations › fault management
fault diagnosis		 0.011982
Using Automated Validation Techniques to Detect Lockups in Packet-Switched Networks · IEEE Trans. Commun. 1982
Network management and operations
network verification		 0.011982
Using Automated Validation Techniques to Detect Lockups in Packet-Switched Networks · IEEE Trans. Commun. 1982
Network management and operations › protocol verification
protocol validation		 0.011982
Using Automated Validation Techniques to Detect Lockups in Packet-Switched Networks · IEEE Trans. Commun. 1982
Routing and switching › packet switching
packet-switched networks		 0.011982
Using Automated Validation Techniques to Detect Lockups in Packet-Switched Networks · IEEE Trans. Commun. 1982

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

type hierarchy · 0.0syntax analysis · 0.0automated validation · 0.0
YearPublicationVenuePosition
1991 Some Comments on Using ODA
Jonathan Rosenberg, Mark Sherman 0001, Ann Marks, Jaap Akkerhuis
 Comput. Networks ISDN Syst.2
1989 On Using ODA for Multimedia Database Applications
Mark Sherman 0001, Ann Marks, Jonathan Rosenberg, Michael Zheng, Jaap Akkerhuis
 DASFAA1
1984 Paragon: Novel Uses of Type Hierarchies for Data Abstraction
abstract
Article Free Access Share on Paragon: Novel uses of type hierarchies for data abstraction Author: Mark Sherman Department of Math. and Computer Science, Dartmouth College, Hanover, NH Department of Math. and Computer Science, Dartmouth College, Hanover, NHView Profile Authors Info & Claims POPL '84: Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languagesJanuary 1984 Pages 208–217https://doi.org/10.1145/800017.800532Published:15 January 1984Publication History 2citation195DownloadsMetricsTotal Citations2Total Downloads195Last 12 Months12Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Mark Sherman 0001
 POPL1
1982 Using Automated Validation Techniques to Detect Lockups in Packet-Switched Networks
abstract
The existence of a program for automatically examining the syntax of a protocol for the absence of various undesired properties-such as deadlock-raises the question whether the classical `lockups' described in the early packet-switched data network literature could be detected by such a program. The authors answer this question in the affirmative.
Mark Sherman 0001, Harry Rudin
 IEEE Trans. Commun.1