The following pages link to Hans Hüttel (Q861693):
Displayed 28 items.
- Decidability issues for extended ping-pong protocols (Q861694) (← links)
- SnS can be modally characterized (Q914397) (← links)
- Undecidable equivalences for basic process algebra (Q1342523) (← links)
- Aliasing models for mobile objects (Q1854530) (← links)
- Behavioural types for memory and method safety in a core object-oriented language (Q2038074) (← links)
- Using session types for reasoning about boundedness in the \(\pi\)-calculus (Q2216475) (← links)
- Undecidable equivalences for basic parallel processes (Q2389334) (← links)
- Types for Resources in $$\psi $$-calculi (Q2830028) (← links)
- Modal Logics for Cryptographic Processes (Q2842609) (← links)
- (Q2842870) (← links)
- Types for Access Control in a Calculus of Mobile Resources (Q2864387) (← links)
- Typed ψ-calculi (Q3090835) (← links)
- Type-Based Automated Verification of Authenticity in Asymmetric Cryptographic Protocols (Q3172905) (← links)
- Binary Session Types for Psi-Calculi (Q3179282) (← links)
- (Q3384912) (← links)
- Transitions and Trees (Q3561031) (← links)
- Actions speak louder than words: proving bisimilarity for context-free processes (Q4209294) (← links)
- (Q4222907) (← links)
- (Q4490743) (← links)
- (Q4503956) (← links)
- (Q4732449) (← links)
- (Q5014801) (← links)
- Type Inference for Correspondence Types (Q5170185) (← links)
- Decidable Fragments of a Higher Order Calculus with Locations (Q5170669) (← links)
- Verification of Correspondence Assertions in a Calculus for Mobile Ad Hoc Networks (Q5179206) (← links)
- A Logical Characterisation of Static Equivalence (Q5262936) (← links)
- SOFSEM 2005: Theory and Practice of Computer Science (Q5711531) (← links)
- (Q6150431) (← links)