Hans Hüttel

Hans Hüttel

Auto-generated profile, based on publicly available information

Hans Hüttel


Research Focus & Metrics

Academic Career Length

38Years (1989-Present)

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

Representative Publications

View All Publications
5 April 2016 in ACM Computing Surveys
Verified
Journal Article
Open access
HHHans Hüttel
Hans Hüttel
ILIvan Lanese
Ivan Lanese
VVVasco T. Vasconcelos
Vasco T. Vasconcelos
LCLuís Caires
Luís Caires
MCMarco Carbone
Marco Carbone
GZGianluigi Zavattaro
Gianluigi Zavattaro
Behavioural type systems, usually associated to concurrent or distributed computations, encompass concepts such as interfaces, communication protocols, and contracts, in addition to the traditional input/output operations. The behavioural type of a software component specifies its expected patterns of interaction using expressive type languages, so types can be used to determine automatically whether the component interacts correctly with other components. Two related important notions of behavioural types are those of session types and behavioural contracts. This article surveys the main accomplishments of the last 20 years within these two approaches.

1 December 1994 in Information and Computation
Verified
Journal Article
Closed access
PDF file
JGJ.F. Groote
J.F. Groote
HHH. Huttel
H. Huttel

1 January 1989 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
HHHans Hüttel
Hans Hüttel
KLKim G. Larsen
Kim G. Larsen

1 January 1994 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
HHHans Hüttel
Hans Hüttel

1 February 2003 in Electronic Notes in Theoretical Computer Science
Verified
Journal Article
Open access
HHHans Hüttel
Hans Hüttel
The spi-calculus, proposed by Abadi and Gordon, is a process calculus based on the π-calculus and is intended for reasoning about the behaviour of cryptographic protocols. We consider the finite-control fragment of the spi-calculus, showing it to be Turing-powerful (a result which is joint work with Josva Kleist, Uwe Nestmann, and Björn Victor.) Next, we restrict our attention to finite (non-recursive) spi-calculus. Here, we show that framed bisimilarity, an equivalence relation proposed by Abadi and Gordon, showing that it is decidable for this fragment

1 August 1998 in Journal of Logic and Computation
Verified
Journal Article
Closed access
PDF file
HHHans Hüttel
Hans Hüttel
Baeten, Bergstra, and Klop (and later Caucal) have proved the remarkable result that bisimulation equivalence is decidable for irredundant context-free grammars. In this paper we provide a much simpler and much more direct proof of this result using a tableau decision method involving goal-directed rules. The decision procedure also provides the essential part of the bisimulation relation between two processes which underlies their equivalence. We also show how to obtain a sound and complete sequent-based equational theory for such processes from the tableau system and how one can extract what Caucal calls a fundamental relation from a successful tableau.