1. A Klaim specification of the Handover protocol: logic-based and type-based analysis Michele Loreti and Daniele Gorla Dipartimento di Sistemi e Informatica University of Firenze http://music.dsi.unifi.it/

2. KlaimKLA IM Klaim: Kernel Language for Agent Interaction and Mobility Linda based communication model: Asynchronous communication; Via tuple space. Explicit use of localities: Multiple distributed tuple spaces. Possibility of code mobility.

3. Linda Communication Model Tuples (“foo”, 10+5, !x) Formal Fields Actual Fields Pattern Matching: Formal fields match any field of the same type Actual fields match if identical (“foo”, 10+5, true) matches (!s, 15, !b)

4. Klaim Nodes Name (Locality) Tuple Space Processes s1s1 P TS

5. Handover Protocol MSC BS1 rc BS2 rc MS

6. The Klaim Implementation

7. Processes...

8. Interesting Properties Every sent message is delivered; No message is delivered when an Handover is occurring; Messages are sent throw the correct Base Station.

9. Features of the Klaim Logic Is a variant of HML (with recursion) Modal operators   and [ ] are indexed with predicates that: Describe the actual use of resources; Express spatial properties; State formulae for describing resources distribution

10. Formulae: Every sent message is delivered: No message is delivered when an Handover is occurring:

11. Context specification Core part of the system is specified in Klaim; Context is specified with an ad-hoc formalism: n[N]

12. Nets and Contexts A net N approximates a context n, w.r.t N 1, if N does not perform more accesses to N 1 than n. A net N agrees a context n w.r.t. N 1, if N behaves like n w.r.t. N 1. approximation and agreement are formally defined in term of a behavioural equivalence (a preorder) between Klaim net.

13. Contexts and Properties (informal) If  specify properties about nodes that belong to N 1, then: If N approximates n w.r.t. N 1, and (n)[N 1 ] satisfies   then N 1 ||N satisfies   (where  is positive) If N agrees n w.r.t. N 1, then n [N 1 ] satisfies  iff N 1 ||N satisfies 

14. Type system for Klaim

15. Types for Resource Access Control We control via types the possible operation, i.e. i,r,o,e,n (capabilities)  is formed by the non-- empty subsets of capabilities A node is s ::  P, where  is the security policy of the node (i.e. what P can perform once executed in s) Formally, For example : Well--typedness ) no illegal operations at run-time.

16. We want the possibility of a dynamic reconfiguration of policies But capabilities cannot be forged, i.e. processes/nodes cannot autonomously create rights not owned Solution: access rights can be passed through the net via communication We require that who passes the capability must own it (statically or dynamically) Dynamic Acquisition of Rights

17. Example of Dynamic Acquisition

18. If rights are wastable resources, once a capability has been used/passed its owner looses it Dynamic Consumption of Rights

19. If rights are wastable resources, once a capability has been used/passed its owner looses it Dynamic Consumption of Rights

20. In a dynamic setting, the use of capability sets in types is not appropriate (we have to count). Hence we use multisets Formally:

21. Process Rights Up to now, nodes acquire/loose rights We allow single processes to acquire/loose rights we tag processes with the rights owned if a process acquires rights, the tag is increased if a process uses rights, the tag is decreased

22. Example of Process Rights

23. Variations on Dynamic Reconfiguration We can choose various models for acquisition/consumption: Nodes have dynamic policies, while process have no rights Processes have dynamic policies, while nodes just static ones Both nodes and processes have dynamic policies The second solution is a good compromise between efficiency and flexibility.

24. The Handover Revisited During an handover the user should not stop its activity (i.e. the handover must be transparent for a user) In particular, the credit of an user must be mantained and the information on it must be properly passed during the handover This scenario is well realized via our type theory

25. The Handover Revisited (2) Assumptions: the information on the credit of a user is held by the Base Station associate to that user it is slotted in credit units and is represented by the messages the BS can take from the MS and pass to the MSC

26. Revised code...

27. The system...

28. Policies...

29. Case Study: The Active Base Station

30. Final remarks... Two different approaches to mobile and distributed languages; Presented example can be extended to be a real application; Detailed papers are available at: http://music.dsi.unifi.it