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

Claude Kaiser

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

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

Software engineering, systems software and programming languages · 2Applied, interdisciplinary, general and emerging computing · 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.

Software engineering, system software, and programming languages
1 paper
Operating systems · 100%

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

TopicWeightPapersLastEvidence papers
Operating systems › resource management
process management
0.011969
Process management and resource sharing in the multiaccess system "ESOPE" · SOSP 1969
Operating systems › resource management
resource sharing
0.011969
Process management and resource sharing in the multiaccess system "ESOPE" · SOSP 1969
YearPublicationVenuePosition
1997 Petri nets based proofs of Ada 95 solution for preference control
abstract
This paper presents correctness proofs of Ada 95 preference control solution for the dining philosophers paradigm. Preference control is the ability to satisfy a request depending on the parameters passed in by the calling task and often also on the internal state of the server. In Ada 95, this schema is implemented with protected objects, entry families and requeue statements within the protected object. Our aim is to show that the preference control can be described in terms of states and transitions, similar to reactive automaton descriptions. This description, which can be done in terms of colored Petri nets, can lead jointly to validate the chosen implementation and to program it with protected objects and requeue statements of Ada 95. The paper is issued from an examination exercise for our students that have followed a course on Programming and Validation of Concurrent Applications and is presented in form of progressive steps for which the students were expected to give answer. The paper contains three programmed solutions and proofs of absence of deadlock and of starvation.
Kamel Barkaoui, Claude Kaiser, Jean-François Pradat-Peyre
APSEC2
1976 An Extensible Structure for Protected Systems' Design
abstract
The purpose of this research is to develop and analyse addressing and protection structures which will help to run more secure programs and to limit the propagation of errors. The generalised notions of object, type of object and type extension are defined and a mechanism is presented which relies on descriptors and implements those notions into the addressing scheme. This mechanism allows the definition at execution time of new levels of protection and provide a tool for controlling the co-operation of mutually suspicious subsystems.
Jean Ferrié, Claude Kaiser, Didier Lanciaux, Bernard Martin
Comput. J.2
1969 Process management and resource sharing in the multiaccess system "ESOPE"
abstract
This paper describes the main design principles of the multiaccess system ESOPE. Emphasis is placed on basic ideas underlying the design rather than on implementation details. The main features of the system include the ability given to any user to schedule his own parallel processes, using system primitive operations, and the allocation/scheduling policy, which dynamically takes into account recent information about user behaviour.
Claude Bétourné, Jacques Boulenger, Jean Ferrié, Claude Kaiser, Jean Kott, Sacha Krakowiak, Jacques Mossière
SOSP4