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

Christine Paulin-Mohring

dblp:85/4254 · DBLP profile ↗
← Back
7ranked-venue papers
2as first author
0since 2021 · last 2012
—ORCID · none

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

Software engineering, systems software and programming languages · 4 · 1 first-authorTheory of computation · 4 · 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 · 90% Program synthesis and code generation · 10%
Network and information security
1 paper
Hardware security and side channels · 100%
Theoretical computer science
1 paper
Logic in computer science · 100%

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

TopicWeightPapersLastEvidence papers
Hardware security and side channels › cryptographic hardware
smart card security		 0.012005
Formal Verification of Security Properties of Smart Card Embedded Source Code · FM 2005
Program synthesis and code generation › formal synthesis
program extraction		 0.011989
Extracting F(omega)'s Programs from Proofs in the Calculus of Constructions · POPL 1989
Logic in computer science › type theory
calculus of constructions		 0.011989
Extracting F(omega)'s Programs from Proofs in the Calculus of Constructions · POPL 1989

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

realizability · 0.0
YearPublicationVenuePosition
2012 Towards Provably Robust Watermarking
David Baelde, Pierre Courtieu, David Gross-Amblard, Christine Paulin-Mohring
 ITP4
2011 Preface
Philippe Audebaud, Christine Paulin-Mohring
 Sci. Comput. Program.2
2009 Proofs of randomized algorithms in Coq
Philippe Audebaud, Christine Paulin-Mohring
 Sci. Comput. Program.2
2006 Proofs of Randomized Algorithms in Coq
Philippe Audebaud, Christine Paulin-Mohring
 MPC2
2005 Formal Verification of Security Properties of Smart Card Embedded Source Code
June Andronick, Boutheina Chetali, Christine Paulin-Mohring
 FM3
1993 Synthesis of ML Programs in the System Coq
Christine Paulin-Mohring, Benjamin Werner
 J. Symb. Comput.1
1989 Extracting F(omega)'s Programs from Proofs in the Calculus of Constructions
abstract
We define in this paper a notion of realizability for the Calculus of Constructions. The extracted programs are terms of the Calculus that do not contain dependent types. We introduce a distinction between informative and non-informative propositions. This distinction allows the removal of the “logical” part in the development of a program. We show also how to use our notion of realizability in order to interpret various axioms like the axiom of choice or the induction on integers. A practical example of development of program is given in the appendix.
Christine Paulin-Mohring
 POPL1