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

Christian Haack

dblp:h/ChristianHaack · DBLP profile ↗
← Back
9ranked-venue papers
8as first author
0since 2021 · last 2009
0000-0003-3932-2448ORCID · corroborated

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

Software engineering, systems software and programming languages · 6 · 5 first-authorTheory of computation · 3 · 3 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.

Theoretical computer science
2 papers
Logic in computer science · 100%
Network and information security
1 paper
Cryptographic protocols and secure computation · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation › security protocol analysis
spi calculus
0.112006
Pattern-matching spi-calculus · Inf. Comput. 2006
Logic in computer science
process algebra
0.112006
Pattern-matching spi-calculus · Inf. Comput. 2006
Cryptographic protocols and secure computation
protocol verification
0.012006
Pattern-matching spi-calculus · Inf. Comput. 2006
Logic in computer science
decomposition theorem
0.011996
A Decomposition Theorem for Domains · Inf. Comput. 1996
Logic in computer science
domain theory
0.011996
A Decomposition Theorem for Domains · Inf. Comput. 1996

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

process algebra · 0.1formal methods · 0.1order theory · 0.0denotational semantics · 0.0
YearPublicationVenuePosition
2009 Type-Based Object Immutability with Flexible Initialization
Christian Haack, Erik Poll
ECOOP1
2008 Reasoning about Java's Reentrant Locks
Christian Haack, Marieke Huisman, Clément Hurlin
APLAS1
2007 Immutable Objects for a Java-Like Language
Christian Haack, Erik Poll, Aleksy Schubert
ESOP1
2006 Pattern-matching spi-calculus
Christian Haack, Alan Jeffrey
Inf. Comput.1
2005 Timed Spi-Calculus with Types for Secrecy and Authenticity
Christian Haack, Alan Jeffrey
CONCUR1
2004 Type error slicing in implicitly typed higher-order languages
Christian Haack, Joe B. Wells
Sci. Comput. Program.1
2003 Type Error Slicing in Implicitly Typed Higher-Order Languages
Christian Haack, Joe B. Wells
ESOP1
2002 Branching Types
Joe B. Wells, Christian Haack
ESOP2
1996 A Decomposition Theorem for Domains
Christian Haack
Inf. Comput.1