The following pages link to Davide Sangiorgi (Q342733):
Displaying 50 items.
- Logical Bisimulations and Functional Languages (Q3508541) (← links)
- A Hybrid Type System for Lock-Freedom of Mobile Processes (Q3512484) (← links)
- Separability in the Ambient Logic (Q3535609) (← links)
- On the proof method for bisimulation (Q3569037) (← links)
- Termination in Impure Concurrent Languages (Q3584940) (← links)
- On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi (Q3587459) (← links)
- Beyond Bisimulation: The “up-to” Techniques (Q3591388) (← links)
- (Q3837262) (← links)
- (Q4028142) (← links)
- (Q4206409) (← links)
- (Q4219055) (← links)
- On the bisimulation proof method (Q4236205) (← links)
- (Q4484478) (← links)
- (Q4490739) (← links)
- (Q4535034) (← links)
- The name discipline of uniform receptiveness (extended abstract) (Q4571962) (← links)
- Trees from Functions as Processes (Q4585071) (← links)
- A fully abstract semantics for causality in the π-calculus (Q4596625) (← links)
- (Q4619824) (← links)
- On the discriminating power of passivation and higher-order interaction (Q4635597) (← links)
- Internal mobility and agent-passing calculi (Q4645220) (← links)
- On asynchrony in name-passing calculi (Q4653019) (← links)
- (Q4673437) (← links)
- From λ to π; or, Rediscovering continuations (Q4704762) (← links)
- (Q4963998) (← links)
- From π-calculus to higher-order π-calculus — and back (Q5044732) (← links)
- (Q5089301) (← links)
- πI: A symmetric calculus based on internal mobility (Q5096730) (← links)
- (Q5111623) (← links)
- Eager Functions as Processes (Q5145310) (← links)
- (Q5155688) (← links)
- Controlling interference in ambients (Q5178864) (← links)
- Extensionality and intensionality of the ambient logics (Q5178868) (← links)
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science (Q5191522) (← links)
- Barbed bisimulation (Q5204357) (← links)
- Divergence and unique solution of equations (Q5228882) (← links)
- Bisimulation and Co-induction: Some Problems (Q5262977) (← links)
- Name-Passing Calculi: From Fusions to Preorders and Types (Q5271075) (← links)
- Equations, Contractions, and Unique Solutions (Q5278202) (← links)
- On the Expressiveness of the Ambient Logic (Q5310656) (← links)
- On coinductive equivalences for higher-order probabilistic functional programs (Q5408426) (← links)
- Origins of bisimulation and coinduction (Q5411640) (← links)
- Enhancements of the bisimulation proof method (Q5412011) (← links)
- Automata, Languages and Programming (Q5466483) (← links)
- Termination of processes (Q5466792) (← links)
- Behavioral equivalence in the polymorphic pi-calculus (Q5487879) (← links)
- An investigation into functions as processes (Q5890045) (← links)
- On bisimulations for the asynchronous π-calculus (Q6104371) (← links)
- (Q6124960) (← links)
- CONCUR test-of-time award 2022 (invited paper) (Q6587106) (← links)
