Hans Hüttel

According to our database1, Hans Hüttel authored at least 40 papers between 1989 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Context-Free Session Types for Applied Pi-Calculus.
Proceedings of the Proceedings Combined 25th International Workshop on Expressiveness in Concurrency and 15th Workshop on Structural Operational Semantics and 15th Workshop on Structural Operational Semantics, 2018

A New Platform for Question-Based Sharing of Supervision Competencies in Problem-Based Learning.
Proceedings of the Collaboration and Technology - 24th International Conference, 2018

2017
Using Session Types for Reasoning About Boundedness in the Pi-Calculus.
Proceedings of the Proceedings Combined 24th International Workshop on Expressiveness in Concurrency and 14th Workshop on Structural Operational Semantics and 14th Workshop on Structural Operational Semantics, 2017

Inferring Types for Parallel Programs.
Proceedings of the Proceedings Tenth Workshop on Programming Language Approaches to Concurrency- and Communication-cEntric Software, 2017

A Platform for Developing and Maintaining Competences in PBL Supervision.
Proceedings of the Emerging Technologies for Education - Second International Symposium, 2017

2016
Foundations of Session Types and Behavioural Contracts.
ACM Comput. Surv., 2016

Binary Session Types for Psi-Calculi.
Proceedings of the Programming Languages and Systems - 14th Asian Symposium, 2016

2015
Broadcast and aggregation in BBC.
Proceedings of the Proceedings Eighth International Workshop on Programming Language Approaches to Concurrency- and Communication-cEntric Software, 2015

Type Inference for Session Types in the π-calculus.
Proceedings of the Web Services, Formal Methods, and Behavioral Types, 2015

2014
How a Flipped Learning Environment Affects Learning in a Course on Theoretical Computer Science.
Proceedings of the Advances in Web-Based Learning - ICWL 2014, 2014

2013
Types for Resources in ψ-calculi.
Proceedings of the Trustworthy Global Computing - 8th International Symposium, 2013

2012
Experiences with Web-based Peer Assessment of Coursework.
Proceedings of the CSEDU 2012, 2012

2011
Typed ψ-calculi.
Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011

Type-Based Automated Verification of Authenticity in Asymmetric Cryptographic Protocols.
Proceedings of the Automated Technology for Verification and Analysis, 2011

2010
Linear Uniform Receptiveness in a Pi-Calculus with Location Failures.
Proceedings of the Theory of Computing 2010, 2010

Transitions and Trees - An Introduction to Structural Operational Semantics.
Cambridge University Press, ISBN: 978-0-521-14709-5, 2010

2009
Undecidable equivalences for basic parallel processes.
Inf. Comput., 2009

Type Inference for Correspondence Types.
Electr. Notes Theor. Comput. Sci., 2009

Verification of Correspondence Assertions in a Calculus for Mobile Ad Hoc Networks.
Electr. Notes Theor. Comput. Sci., 2009

Decidable Fragments of a Higher Order Calculus with Locations.
Electr. Notes Theor. Comput. Sci., 2009

Parametrised Constants and Replication for Spatial Mobility.
Proceedings of the Coordination Models and Languages, 11th International Conference, 2009

2007
A Logical Characterisation of Static Equivalence.
Electr. Notes Theor. Comput. Sci., 2007

Types for Access Control in a Calculus of Mobile Resources.
Electr. Notes Theor. Comput. Sci., 2007

2006
Decidability Issues for Extended Ping-Pong Protocols.
J. Autom. Reasoning, 2006

2005
Recursion Versus Replication in Simple Cryptographic Protocols.
Proceedings of the SOFSEM 2005: Theory and Practice of Computer Science, 2005

2002
Aliasing Models for Mobile Objects.
Inf. Comput., 2002

Deciding Framed Bisimilarity.
Electr. Notes Theor. Comput. Sci., 2002

Modal Logics for Cryptographic Processes.
Electr. Notes Theor. Comput. Sci., 2002

1999
Aliasing Models for Object Migration.
Proceedings of the Euro-Par '99 Parallel Processing, 5th International Euro-Par Conference, Toulouse, France, August 31, 1999

1998
Actions Speak Louder Than Words: Proving Bisimilarity for Context-Free Processes.
J. Log. Comput., 1998

1997
Relating semantic models for the object calculus.
Electr. Notes Theor. Comput. Sci., 1997

1995
Bisimulation Equivalence is Decidable for All Context-Free Processes
Inf. Comput., September, 1995

1994
Undecidable Equivalences for Basic Process Algebra
Inf. Comput., December, 1994

Undecidable Equivalences for Basic Parallel Processes.
Proceedings of the Theoretical Aspects of Computer Software, 1994

1993
Decidability issues for infinite-state processes- a survey.
Bulletin of the EATCS, 1993

1992
Bisimulation Equivalence is Decidable for all Context-Free Processes.
Proceedings of the CONCUR '92, 1992

1991
Actions Speak Louder than Words: Proving Bisimilarity for Context-Free Processes
Proceedings of the Sixth Annual Symposium on Logic in Computer Science (LICS '91), 1991

Silence is Golden: Branching Bisimilarity is Decidable for Context-Free Processes.
Proceedings of the Computer Aided Verification, 3rd International Workshop, 1991

1990
SnS Can be Modally Characterized.
Theor. Comput. Sci., 1990

1989
The Use of Static Constructs in A Modal Process Logic.
Proceedings of the Logic at Botik '89, 1989


  Loading...