scientific article; zbMATH DE number 954809
From MaRDI portal
Publication:3837262
zbMATH Open0861.68030MaRDI QIDQ3837262FDOQ3837262
Authors: Benjamin C. Pierce, Davide Sangiorgi 
Publication date: 8 December 1996
Title of this publication is not available (Why is that?)
Recommendations
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Combinatory logic and lambda calculus (03B40) Semantics in the theory of computing (68Q55)
Cited In (91)
- Backwards type analysis of asynchronous method calls
- Type inference for variant object types
- On implementations and semantics of a concurrent programming language
- Session typing and asynchronous subtyping for the higher-order \(\pi\)-calculus
- On modelling mobility
- Type-based information flow analysis for the \(\pi\)-calculus
- Genericity and the \(\pi\)-calculus
- Towards a behavioural theory of access and mobility control in distributed systems
- Imperative objects as mobile processes
- Channel dependent types for higher-order mobile processes
- Typed behavioural equivalences for processes in the presence of subtyping
- A process-calculus analysis of concurrent operations on B-trees
- XPi: a typed process calculus for XML messaging
- An algebra of behavioural types
- Type reconstruction for linear \(\pi\)-calculus with I/O subtyping.
- Subtyping Supports Safe Session Substitution
- A simple library implementation of binary sessions
- A categorical framework for typing CCS-style process communication
- Types for access control in a calculus of mobile resources
- Session types and subtyping for orchestrated interactions
- Counting the cost in the picalculus (extended abstract)
- On hierarchical communication topologies in the \(\pi\)-calculus
- Contracts for Mobile Processes
- A calculus for cryptographic protocols: The spi calculus
- An interpretation of typed objects into typed \(\pi\)-calculus
- Characteristic bisimulation for higher-order session processes
- Secrecy and group creation
- Session-Based Communication Optimisation for Higher-Order Mobile Processes
- Typing correspondence assertions for communication protocols
- Reversible client/server interactions
- Analysing input/output-capabilities of mobile processes with a generic type system
- A general framework for types in graph rewriting
- Full abstraction in a subtyped pi-calculus with linear types
- Assigning types to processes
- What is a ``good encoding of guarded choice?
- A generic type system for the pi-calculus
- Linear forwarders
- A behavioural theory for a \(\pi\)-calculus with preorders
- Types and full abstraction for polyadic \(\pi\)-calculus
- The name discipline of uniform receptiveness
- Partition refinement of component interaction automata
- Mobile objects as mobile processes
- Linear logical relations and observational equivalences for session-based concurrency
- Strong normalisation in the \(\pi\)-calculus
- Name-passing calculi: from fusions to preorders and types
- A gentle introduction to multiparty asynchronous session types
- The security pi-calculus and non-interference
- Towards an algebraic theory of typed mobile processes
- PiDuce- A project for experimenting web services technologies
- Orchestrated session compliance
- Space-aware ambients and processes
- Linearity and bisimulation
- Encoding ℂDuce in the ℂπ-Calculus
- Typed ψ-calculi
- Typed behavioural equivalences for processes in the presence of subtyping
- A behavioural theory for a \(\pi\)-calculus with preorders
- Typing Correspondence Assertions for Communication Protocols
- Processes and games
- Semantic subtyping for the pi-calculus
- On the expressiveness of internal mobility in name-passing calculi
- Static analysis for the \(\pi\)-calculus with applications to security
- Title not available (Why is that?)
- Types for access control
- A taxonomy of process calculi for distribution and mobility
- Symmetries and Dualities in Name-Passing Process Calculi
- On confluence in the \(\pi\)-calculus
- Two Session Typing Systems for Higher-Order Mobile Processes
- A type system for lock-free processes
- Subtyping for session types in the pi calculus
- Processes against tests: on defining contextual equivalences
- Resource access control in systems of mobile agents
- πI: A symmetric calculus based on internal mobility
- A Framework for Type Safe Exchange of Mobile Code
- Algorithmic type checking for a pi-calculus with name matching and session types
- MOMI: a calculus for mobile mixins
- Graph types for monadic mobile processes
- Behavioural analysis of sessions using the calculus of structures
- Eager functions as processes
- Precise subtyping for synchronous multiparty sessions
- Type inference for record concatenation and subtyping
- Title not available (Why is that?)
- Internal mobility and agent-passing calculi
- Sequence types for the \(\pi\)-calculus
- Observing Success in the Pi-Calculus
- A rude contract language for web services
- Processes, systems \& tests: defining contextual equivalences
- Precise Subtyping for Asynchronous Multiparty Sessions
- Title not available (Why is that?)
- The name discipline of uniform receptiveness (extended abstract)
- Title not available (Why is that?)
- Process types as a descriptive tool for interaction. Control and the pi-calculus
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3837262)
