Pages that link to "Item:Q2734510"

The following pages link to The \(\pi\)-calculus: A theory of mobile processes (Q2734510):

Displaying 50 items.

• On an open problem of Amadio and Curien: The finite antichain condition (Q2573335) (← links)
• Subtyping for session types in the pi calculus (Q2576666) (← links)
• safeDpi: a language for controlling mobile code (Q2581010) (← links)
• Type-based information flow analysis for the \(\pi\)-calculus (Q2581011) (← links)
• Controlling information release in the \(\pi\)-calculus (Q2643083) (← links)
• A theory for observational fault tolerance (Q2643332) (← links)
• Comparing type systems for deadlock freedom (Q2667185) (← links)
• Formalizing CCS and \(\pi\)-calculus in Guarded Cubical Agda (Q2683037) (← links)
• Topology in process calculus. Approximate correctness and infinite evolution of concurrent programs (Q2701735) (← links)
• The \(\pi\)-calculus: An introduction (Q2767985) (← links)
• On the Relative Expressiveness of Higher-Order Session Processes (Q2802492) (← links)
• On the role of names in reasoning about \(\lambda\)-tree syntax specifications (Q2804945) (← links)
• A Theory of Monitors (Q2811337) (← links)
• Corecursion and Non-divergence in Session-Typed Processes (Q2811932) (← links)
• An epistemic predicate \(\mathrm{CTL}^{*}\) for finite control \(\pi\)-processes (Q2825420) (← links)
• On the Power of Attribute-Based Communication (Q2827459) (← links)
• On the expressive power of polyadic synchronisation in \(\pi \)-calculus (Q2842599) (← links)
• Algebraic Program Semantics for Supercomputing (Q2842630) (← links)
• Biological transactions for quantitative models (Q2864196) (← links)
• A chart semantics for the pi-calculus (Q2864369) (← links)
• Linearity, persistence and testing semantics in the asynchronous pi-calculus (Q2864372) (← links)
• Reflections on the future of concurrency theory in general and process calculi in particular (Q2870196) (← links)
• A well-behaved LTS for the pi-calculus (abstract) (Q2871826) (← links)
• Weak Bisimilarity Coalgebraically (Q2888485) (← links)
• Relating Coalgebraic Notions of Bisimulation (Q2888487) (← links)
• Nominal Automata for Resource Usage Control (Q2914700) (← links)
• Symmetries and Dualities in Name-Passing Process Calculi (Q2944898) (← links)
• Linked data privacy (Q2973246) (← links)
• (Q2974797) (← links)
• Companions, Codensity and Causality (Q2988363) (← links)
• The Paths to Choreography Extraction (Q2988384) (← links)
• Observed Communication Semantics for Classical Processes (Q2988633) (← links)
• Linearity, Control Effects, and Behavioral Types (Q2988641) (← links)
• On Mobility and Communication (Q2994477) (← links)
• A Testing Theory for a Higher-Order Cryptographic Language (Q3000588) (← links)
• On the Semantics of Markov Automata (Q3012929) (← links)
• Hunting Distributed Malware with the κ-Calculus (Q3088273) (← links)
• Typed ψ-calculi (Q3090835) (← links)
• Full Abstraction in a Subtyped pi-Calculus with Linear Types (Q3090836) (← links)
• Broadcast Psi-calculi with an Application to Wireless Protocols (Q3095234) (← links)
• Process Algebra and Model Checking (Q3176390) (← links)
• Nominal SOS (Q3178277) (← links)
• SPEC: An Equivalence Checker for Security Protocols (Q3179281) (← links)
• A Logical Interpretation of the λ-Calculus into the π-Calculus, Preserving Spine Reduction and Types (Q3184667) (← links)
• Concurrent Kleene Algebra (Q3184688) (← links)
• Howe’s Method for Calculi with Passivation (Q3184692) (← links)
• On the Relationship between π-Calculus and Finite Place/Transition Petri Nets (Q3184693) (← links)
• Structural Operational Semantics for Weighted Transition Systems (Q3184746) (← links)
• Mobile Processes and Termination (Q3184750) (← links)
• Static VS Dynamic Reversibility in CCS (Q3186583) (← links)