Hanne Riis Nielson

Hanne Riis Nielson

Auto-generated profile, based on publicly available information

Hanne Riis Nielson

Technical University of Denmark

Research Focus & Metrics

Academic Career Length

44Years (1983-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 1999
Verified
Book
Closed access
FNFlemming Nielson
Flemming Nielson
HNHanne Riis Nielson
Hanne Riis Nielson
CHChris Hankin
Chris Hankin

16 July 1992
Verified
Book
Closed access
FNFlemming Nielson
Flemming Nielson
HNHanne Riis Nielson
Hanne Riis Nielson
The authors describe here a framework in which the type notation of functional languages is extended to include a notation for binding times (that is run-time and compile-time) that distinguishes between them. Consequently the ability to specify code and verify program correctness can be improved. Two developments are needed, the first of which introduces the binding time distinction into the lambda calculus, in a manner analogous with the introduction of types into the untyped lambda calculus. Methods are also presented for introducing combinators for run-time. The second concerns the interpretation of the resulting language, which is known as the mixed lambda-calculus and combinatory logic. The notion of 'parametrized semantics' is used to describe code generation and abstract interpretation. The code generation is for a simple abstract machine designed for the purpose; it is close to the categorical abstract machine. The abstract interpretation focuses on a strictness analysis that generalises Wadler's analysis for lists.

1 January 2007
Verified
Book
Closed access
HNHanne Riis Nielson
Hanne Riis Nielson
FNFlemming Nielson
Flemming Nielson


24 August 2005 in Journal of Computer Security
Verified
Journal Article
Closed access
PDF file
CBChiara Bodei
Chiara Bodei
MBMikael Buchholtz
Mikael Buchholtz
PDPierpaolo Degano
Pierpaolo Degano
FNFlemming Nielson
Flemming Nielson
HNHanne Riis Nielson
Hanne Riis Nielson
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.

1 July 2001 in Information and Computation
Verified
Journal Article
Closed access
CBChiara Bodei
Chiara Bodei
PDPierpaolo Degano
Pierpaolo Degano
FNFlemming Nielson
Flemming Nielson
HNHanne Riis Nielson
Hanne Riis Nielson