|
Search the dblp DataBase
Hans Hüttel:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Hans Hüttel
Silence is Golden: Branching Bisimilarity is Decidable for Context-Free Processes. [Citation Graph (0, 0)][DBLP] CAV, 1991, pp:2-12 [Conf]
- Søren Christensen, Hans Hüttel, Colin Stirling
Bisimulation Equivalence is Decidable for all Context-Free Processes. [Citation Graph (0, 0)][DBLP] CONCUR, 1992, pp:138-147 [Conf]
- Hans Hüttel, Kim Guldstrand Larsen
The Use of Static Constructs in A Modal Process Logic. [Citation Graph (0, 0)][DBLP] Logic at Botik, 1989, pp:163-180 [Conf]
- Uwe Nestmann, Hans Hüttel, Josva Kleist, Massimo Merro
Aliasing Models for Object Migration. [Citation Graph (0, 0)][DBLP] Euro-Par, 1999, pp:1353-1368 [Conf]
- Hans Hüttel, Colin Stirling
Actions Speak Louder than Words: Proving Bisimilarity for Context-Free Processes [Citation Graph (0, 0)][DBLP] LICS, 1991, pp:376-386 [Conf]
- Hans Hüttel, Jirí Srba
Recursion Versus Replication in Simple Cryptographic Protocols. [Citation Graph (0, 0)][DBLP] SOFSEM, 2005, pp:178-187 [Conf]
- Hans Hüttel
Undecidable Equivalences for Basic Parallel Processes. [Citation Graph (0, 0)][DBLP] TACS, 1994, pp:454-464 [Conf]
- Søren Christensen, Hans Hüttel
Decidability issues for infinite-state processes- a survey. [Citation Graph (0, 0)][DBLP] Bulletin of the EATCS, 1993, v:51, n:, pp:155-167 [Journal]
- Luca Aceto, Hans Hüttel, Anna Ingólfsdóttir, Josva Kleist
Relating semantic models for the object calculus. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 1997, v:7, n:, pp:- [Journal]
- Ulrik Frendrup, Hans Hüttel, Jesper Nyholm Jensen
Modal Logics for Cryptographic Processes. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2002, v:68, n:2, pp:- [Journal]
- Hans Hüttel
Modal Logics for Cryptographic Processes. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2002, v:68, n:6, pp:- [Journal]
- Hans Hüttel, Michael D. Pedersen
A Logical Characterisation of Static Equivalence. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2007, v:173, n:, pp:139-157 [Journal]
- Søren Christensen, Hans Hüttel, Colin Stirling
Bisimulation Equivalence is Decidable for All Context-Free Processes [Citation Graph (0, 0)][DBLP] Inf. Comput., 1995, v:121, n:2, pp:143-148 [Journal]
- Jan Friso Groote, Hans Hüttel
Undecidable Equivalences for Basic Process Algebra [Citation Graph (0, 0)][DBLP] Inf. Comput., 1994, v:115, n:2, pp:354-371 [Journal]
- Uwe Nestmann, Hans Hüttel, Josva Kleist, Massimo Merro
Aliasing Models for Mobile Objects. [Citation Graph (0, 0)][DBLP] Inf. Comput., 2002, v:175, n:1, pp:3-33 [Journal]
- Hans Hüttel, Jirí Srba
Decidability Issues for Extended Ping-Pong Protocols. [Citation Graph (0, 0)][DBLP] J. Autom. Reasoning, 2006, v:36, n:1-2, pp:125-147 [Journal]
- Hans Hüttel, Colin Stirling
Actions Speak Louder Than Words: Proving Bisimilarity for Context-Free Processes. [Citation Graph (0, 0)][DBLP] J. Log. Comput., 1998, v:8, n:4, pp:485-509 [Journal]
- Hans Hüttel
SnS Can be Modally Characterized. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1990, v:74, n:2, pp:239-248 [Journal]
- Hans Hüttel, Morten Kühnrich
Types for Access Control in a Calculus of Mobile Resources. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2007, v:180, n:1, pp:3-15 [Journal]
Parametrised Constants and Replication for Spatial Mobility. [Citation Graph (, )][DBLP]
Decidable Fragments of a Higher Order Calculus with Locations. [Citation Graph (, )][DBLP]
Type Inference for Correspondence Types. [Citation Graph (, )][DBLP]
Verification of Correspondence Assertions in a Calculus for Mobile Ad Hoc Networks. [Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.005secs
|