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.

Mikael Buchholtz

dblp:38/408 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 2005
—ORCID · none

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

Security and privacy · 2Software engineering, systems software and programming languages · 2 · 1 first-authorTheory of computation · 1 · 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.

Network and information security
1 paper
Systems and software security · 100%
Software engineering, system software, and programming languages
1 paper
Program analysis · 100%

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

TopicWeightPapersLastEvidence papers
Program analysis
security analysis
0.012005
End-to-End Integrated Security and Performance Analysis on the DEGAS Choreographer Platform · FM 2005

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

performance analysis · 0.1choreography · 0.1
YearPublicationVenuePosition
2005 End-to-End Integrated Security and Performance Analysis on the DEGAS Choreographer Platform
Mikael Buchholtz, Stephen Gilmore, Valentin Haenel, Carlo Montangero
FM1
2005 Static validation of security protocols
abstract
We methodically expand protocol narrations into terms of a process algebra in order to specify some of the checks that need to be made in a protocol. We then apply static analysis technology to develop an automatic validation procedure for protocols.
Chiara Bodei, Mikael Buchholtz, Pierpaolo Degano, Flemming Nielson, Hanne Riis Nielson
J. Comput. Secur.2
2004 The Succinct Solver Suite
Flemming Nielson, Hanne Riis Nielson, Hongyan Sun, Mikael Buchholtz, René Rydhof Hansen, Henrik Pilegaard, Helmut Seidl
TACAS4
2003 Automatic Validation of Protocol Narration
abstract
We perform a systematic expansion of protocol narrations into terms of process algebra in order to make precise some of the detailed checks that need to be made in a protocol. We then apply static analysis technology to develop an automatic validation procedure for protocols. Finally, we demonstrate that these techniques suffice for identifying a number of authentication flaws in symmetric key protocols such as Needham-Schroeder, Otway-Rees, Yahalom and Andrew Secure RPC.
Chiara Bodei, Mikael Buchholtz, Pierpaolo Degano, Flemming Nielson, Hanne Riis Nielson
CSFW2