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

Gilles Kahn

dblp:k/GillesKahn · DBLP profile ↗
← Back
6ranked-venue papers
5as first author
0since 2021 · last 1994
—ORCID · none

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

Theory of computation · 4 · 3 first-authorSoftware engineering, systems software and programming languages · 2 · 2 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
Programming languages and type systems · 84% Program verification · 16%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

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

TopicWeightPapersLastEvidence papers
Programming languages and type systems › control structures › recursion
recursive equations
0.011974
Algorithmes d'equivalence et de reduction a des expressions minimales dans une classe d'equations recursives simples · ICALP 1974

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

recursive equations · 0.0
YearPublicationVenuePosition
1994 Preface
Gilles Kahn
Inf. Comput.1
1993 Concrete Domains
Gilles Kahn, Gordon D. Plotkin
Theor. Comput. Sci.1
1987 Natural Semantics
Gilles Kahn
STACS1
1983 Metal: A Formalism to Specify Formalisms
Gilles Kahn, Bernard Lang, Bertrand Melese, Elham Morcos
Sci. Comput. Program.1
1974 Algorithmes d'equivalence et de reduction a des expressions minimales dans une classe d'equations recursives simples
Bruno Courcelle, Gilles Kahn, Jean Vuillemin
ICALP2
1971 An Approach to System Correctness
abstract
First, the problem of proving the correctness of an operating system is defined. Then a simple model is presented. Several examples are given to show how this model allows derivation of proofs about small systems.
Gilles Kahn
SOSP1