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

Orit Kislev

dblp:06/3357 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1993
—ORCID · none

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

Systems, architecture and hardware · 1

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.

Theoretical computer science
1 paper
Distributed computing theory · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Distributed systems › distributed database
commit protocol
0.011993
Knowledge-Oriented Programming (Extended Abstract) · PODC 1993
Distributed computing theory › knowledge in distributed systems
knowledge-based protocols
0.011993
Knowledge-Oriented Programming (Extended Abstract) · PODC 1993

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

notify actions · 0.0knowledge-based programming · 0.0
YearPublicationVenuePosition
1993 Knowledge-Oriented Programming (Extended Abstract)
abstract
This paper presents knowledge-oriented programming, a framework for giving high-level knowledgebased descriptions of distributed protocols.We extend the notion of knowledge-based programs of [FHMV93] by allowing high-level actions that are defined in terms of changing the state of knowledge of processes in the system.As a result, both the choice of which actions to perform and the actions themselves are defined explicitly in terms of the processes' knowledge.We concentrate on a class of high-level notify actions that can be used to abstract away details of communication.Examples are considered, including solutions to the atomic commitment problem and to the sequence transmission problem.
Yoram Moses, Orit Kislev
PODC2