without
play

without Ant onio Ravara with Adrian Francalanza and Marco Giunti - PowerPoint PPT Presentation

Aug 18, 2023 •222 likes •388 views

without Ant onio Ravara with Adrian Francalanza and Marco Giunti NOVA-LINCS and Dep of Informatics School of Science and Technology, NOVA University of Lisboa, PT Univ of Malta, Malta June 5, 2020 What are we aiming at Static

  1. π without α Ant´ onio Ravara with Adrian Francalanza and Marco Giunti NOVA-LINCS and Dep of Informatics School of Science and Technology, NOVA University of Lisboa, PT Univ of Malta, Malta June 5, 2020

  2. What are we aiming at Static detection of locked channels ◮ find bugs, not prevent them ◮ automatic analysis to unearth real problems ◮ Identify problematic pieces of code and misuse of resources Notice: when looking for bugs (instead of aiming at avoiding them) ◮ correctness means all issues found are true positives when avoiding, correctness means no false negatives ◮ completeness means all bugs are found when avoiding, unachievable completeness implies some false positives We want to be precise (although not exhaustive) Ant´ onio Ravara with Adrian Francalanza and Marco Giunti (Departamento de Inform´ π without α atica, Faculdade de Ciˆ encias e Tecnologia, Universidade June 5, 2020 2 / 15

  3. Motivation: our favorite framework A Model of Distributed Systems π -calculus featuring: ◮ replication ◮ linear /unrestricted names Linear π -calculus, Kobayashi, Pierce, and Turner, 1999 Example Let u , v be unrestricted in the following processe. P = ∗ u ?( x ) . v ?( y ) . x ! true . y ?( z ) . 0 � Q = ∗ ( κ c : linear )( u ! c � v ! c ) It may “continuously” produce deadlocks on fresh linear names Ant´ onio Ravara with Adrian Francalanza and Marco Giunti (Departamento de Inform´ π without α atica, Faculdade de Ciˆ encias e Tecnologia, Universidade June 5, 2020 3 / 15

  4. Motivation: informative program analysis Let u , v be unrestricted in the following program. P = ∗ u ?( x ) . v ?( y ) . x ! true . y ?( z ) . 0 Q = ∗ ( κ c : linear )( u ! c � v ! c ) R = P � Q → 2 R � ( κ c 1 : linear )( c 1 ! true . c 1 ?( z ) . 0) R − → 2 R � ( κ c 1 : linear )( c 1 ! true . c 1 ?( z ) . 0) − � ( κ c 2 : linear )( c 2 ! true . c 2 ?( z ) . 0) → 2 R · · · − ◮ Program analysis might detect the problem in name c 1 ◮ It should report a problem in c , referring to the static code Ant´ onio Ravara with Adrian Francalanza and Marco Giunti (Departamento de Inform´ π without α atica, Faculdade de Ciˆ encias e Tecnologia, Universidade June 5, 2020 4 / 15

  5. A certified program analysis tool Goals for the implementation ◮ to implement an efficient mechanism of capturing-avoiding substitution ◮ to ensure the absence of clashes on (bound) identifiers Our approach: unique identifiers Goals for the mechanisation ◮ proof correct exactly the implementation’s code (not some idealised version of it) ◮ deal with name generation explicitly Ant´ onio Ravara with Adrian Francalanza and Marco Giunti (Departamento de Inform´ π without α atica, Faculdade de Ciˆ encias e Tecnologia, Universidade June 5, 2020 5 / 15

  6. In this talk A reformulation of the linear pi-calculus does not assume alpha-conversion automatically book-keeps information regarding name scoping The labelled transition system tracks the evolution of linear permissions renaming of scoped names to avoid clashes performed with a total function generating natural numbers not used elsewhere. A main concern: not to introduce non-determinism unnecessarily type-splitting only in the parallel composition rule, showed determinisable Ant´ onio Ravara with Adrian Francalanza and Marco Giunti (Departamento de Inform´ π without α atica, Faculdade de Ciˆ encias e Tecnologia, Universidade June 5, 2020 6 / 15

  7. Language Process and Type Syntax m ∈ Mul ::= ω (unrestricted) | ι (linear) p , q ∈ Pol ::= � (input & output) | ∅ (empty) | ↓ | ↑ (input) (output) | p [ T ] m T , S ∈ Typ ::= bs (base) (channel) P , Q , R ∈ Proc ::= nil | P � Q (inert) (composition) | u ? x . P (input) | ∗ u ? x . P (replication) | u ! v . P | ( κ n ) P (output) (hiding) Ant´ onio Ravara with Adrian Francalanza and Marco Giunti (Departamento de Inform´ π without α atica, Faculdade de Ciˆ encias e Tecnologia, Universidade June 5, 2020 7 / 15

  8. Remarks on the language ◮ “Normal” binders for variables of input prefixes – static scope ◮ No binders for names – dynamic scope We use a Church-style hiding construct, ( κ n ) P , that does not assume alpha-conversion. ◮ all hidden (restricted) names are disjoint from one another (no duplicates in hidden names) and also disjoint from visible (free) names. Well-formed processes A process P is well-formed iff noDup(hid( P )) and hid( P ) � vis( P ) = ∅ . where: hid( P ) is the multi-set of the hidden names of P , vis( P ) is the multi-set of the names of P that are not hidden, and noDup( M ) = � ∃ M ′ , n · M = M ′ ⊎ { n , n } Ant´ onio Ravara with Adrian Francalanza and Marco Giunti (Departamento de Inform´ π without α atica, Faculdade de Ciˆ encias e Tecnologia, Universidade June 5, 2020 8 / 15

  9. Operations on Types Type Operations � ⊔ p � � ∅ ⊔ p � p ↓ ⊔ ↓ � ↓ ↑ ⊔ ↑ � ↑ ↓ ⊔ ↑ � � ∅ ⊎ p � p ↓ ⊎ ↑ � � p [ T ] ι + q [ T ] ι � p ⊎ q [ T ] ι p [ T ] ω + q [ T ] ω � p ⊔ q [ T ] ω bs+bs � bs Type subtraction p [ T ] ι − p [ T ] ι = ∅ [ T ] ι � [ T ] ι − ↓ [ T ] ι = ↑ [ T ] ι bs − bs = bs p [ T ] ω − p [ T ] ω = p [ T ] ω � [ T ] ι − ↑ [ T ] ι = ↓ [ T ] ι � [ T ] ω − ↓ [ T ] ω = � [ T ] ω � [ T ] ω − ↑ [ T ] ω = � [ T ] ω p [ T ] m − ∅ [ T ] m = p [ T ] m Ant´ onio Ravara with Adrian Francalanza and Marco Giunti (Departamento de Inform´ π without α atica, Faculdade de Ciˆ encias e Tecnologia, Universidade June 5, 2020 9 / 15

  10. Type Environments Flags ◮ hidden ( h , under a scope declaration) ◮ illegal ( i , not usable by the process) ◮ visible ( v , neither scoped nor illegal). Flag Combination h + i = h = i + h v + v = v i + i = i Environment Splitting Relation Γ 1 + Γ 2 = Γ 3 (Γ 1 , u :( f , p [ T ] ι )) + (Γ 2 , u :( g , q [ T ] ι )) = Γ 3 , u :( f + g , p ⊎ q [ T ] ι ) Γ 1 + Γ 2 = Γ 3 (Γ 1 , u :( f , p [ T ] ω )) + (Γ 2 , u :( g , p [ T ] ω )) = Γ 3 , u :( f + g , p [ T ] ω ) Ant´ onio Ravara with Adrian Francalanza and Marco Giunti (Departamento de Inform´ π without α atica, Faculdade de Ciˆ encias e Tecnologia, Universidade June 5, 2020 10 / 15

  11. Type System Consumed predicate cons ( ∅ ) cons (Γ) cons (Γ) f � = i cons (Γ) cons (Γ , u : ( f , ∅ [ T ] m )) cons (Γ , u : ( f , bs)) cons (Γ , u : ( f , p [ T ] ω )) Typing Rules cons (Γ) Γ , n :( v , T ) ⊢ P Γ 1 ⊢ P 1 Γ 2 ⊢ P 2 Γ ⊢ nil Γ , n :( h , T ) ⊢ ( κ n ) ( P ) Γ 1 + Γ 2 ⊢ P 1 � P 2 Γ , u :( v , p [ T ] m − ↑ [ T ] m ) , v :( v , T ′ − T ) ⊢ P ↑ ∈ p Γ , u :( v , p [ T ] m ) , v :( v , T ′ ) ⊢ u ! v . P Γ , u :( v , p [ T ] m − ↓ [ T ] m ) , x :( v , T ) ⊢ P ↓ ∈ p Γ , u :( v , p [ T ] m ) ⊢ u ? x . P Γ , u :( v , p [ T ] ω ) , x :( v , T ) ⊢ P ↓ ∈ p cons (Γ) Γ , u :( v , p [ T ] ω ) ⊢ ∗ u ? x . P Ant´ onio Ravara with Adrian Francalanza and Marco Giunti (Departamento de Inform´ π without α atica, Faculdade de Ciˆ encias e Tecnologia, Universidade June 5, 2020 11 / 15

  12. Type Soundness Linearity Violation A configuration Γ ⊲ P violates linearity if there exists an evaluation context and a channel n such that Γ( n ) = ( f , p [ T ] ι ), and either: 1. P = E [ n ? x 1 . Q 1 , n ? x 2 . Q 2 ]; or 2. P = E [ n ! v 1 . Q 1 , n ! v 2 . Q 2 ]; or 3. P = E [ ∗ n ? x . Q ]. Immediate Race-freedom If Γ ⊢ P then Γ ⊲ P does not violate linearity. Ant´ onio Ravara with Adrian Francalanza and Marco Giunti (Departamento de Inform´ π without α atica, Faculdade de Ciˆ encias e Tecnologia, Universidade June 5, 2020 12 / 15

  13. Labelled Transition System – I Relabelling Replication comports that a transition spawns a relabelled copy of the input prefix, to preserve the (representation of the) Barendregt convention. Typed Transitions (Selected rules) T ′′ = T ′ − T a ! n Γ , a :( v , ↑ [ T ] ι ) , n :( v , T ′ ) ⊲ a ! n . P − − → Γ , a :( v , ∅ [ T ] ι ) , n :( v , T ′′ ) ⊲ P T ′′ = T ′ + T f � = h a ? n → Γ , a :( v , ∅ [ T ] ι ) , n :( v , T ′′ ) ⊲ P [ n Γ , a :( v , ↓ [ T ] ι ) , n :( f , T ′ ) ⊲ a ? x . P − − − / x ] T ′′ = T ′ + T ↓ ∈ p f � = h (Γ ′ , P ′ ) = relabelling((Γ , c :( v , p [ T ] ω ) , n :( f , T ′ )) , P ) → Γ , c :( v , p [ T ] ω ) , n :( v , T ′′ ) , Γ ′ ⊲ P [ n c ? n Γ , c :( v , p [ T ] ω ) , n :( f , T ′ ) ⊲ ∗ c ? x . P − − − / x ] � ∗ c ? x . P ′ If relabelling(Γ , P )=(Γ ′ , P ′ ) then dom(Γ) ∩ dom(Γ ′ ) = ∅ Ant´ onio Ravara with Adrian Francalanza and Marco Giunti (Departamento de Inform´ π without α atica, Faculdade de Ciˆ encias e Tecnologia, Universidade June 5, 2020 13 / 15

Recommend

More recommend