Pict

swMATH8929MaRDI QIDQ20925FDOQ20925

Author name not available (Why is that?)

Cited In (70)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Primitives for authentication in process algebras.
• Genericity and the \(\pi\)-calculus
• On the relative expressive power of calculi for mobility
• Title not available (Why is that?)
• Minimality and separation results on asynchronous mobile processes -- representability theorems by concurrent combinators
• Application of a stochastic name-passing calculus to representation and simulation of molecular processes
• A Hybrid Type System for Lock-Freedom of Mobile Processes
• Asynchronous process calculi: The first- and higher-order paradigms
• Title not available (Why is that?)
• Title not available (Why is that?)
• A formal semantics for the Taverna 2 workflow model
• A closer look at constraints as processes
• Mixed Sessions
• PiStache: Implementing π-Calculus in Scala
• Language-based performance prediction for distributed and mobile systems
• On bisimulations for the asynchronous \(\pi\)-calculus
• On distributability
• Title not available (Why is that?)
• Fundamentals of session types
• A Coq library for verification of concurrent programs
• Process calculus based upon evaluation to committed form
• The Orc Programming Language
• Title not available (Why is that?)
• Pict correctness revisited
• A concurrent lambda calculus with futures
• Formal Methods for Components and Objects
• Tutorial on separation results in process calculi via leader election problems
• Title not available (Why is that?)
• Decoding choice encodings
• Relating State-Based and Process-Based Concurrency through Linear Logic
• The name discipline of uniform receptiveness
• An ``abstract process approach to algebraic dynamic architecture description
• Modelling dynamic web data
• Relating state-based and process-based concurrency through linear logic (full-version)
• Coupled similarity: the first 32 years
• Behavioral equivalence in the polymorphic pi-calculus
• A Formal Environment Model for Multi-Agent Systems
• Title not available (Why is that?)
• Mixed sessions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Region analysis and a π-calculus with groups
• Acute: High-level programming language design for distributed computation
• Typed behavioural equivalences for processes in the presence of subtyping
• Creol: A type-safe object-oriented model for distributed concurrent systems
• Synchrony vs asynchrony in communication primitives
• Formal Modeling of Mobile Computing Systems Based on Ambient Abstract State Machines
• A calculus of global interaction based on session types
• A taxonomy of process calculi for distribution and mobility
• A calculus for reasoning about software composition
• An empirical comparison of formalisms for modelling and analysis of dynamic reconfiguration of dependable systems
• Comparing communication primitives via their relative expressive power
• Process algebras as support for sustainable systems of services
• A type system for lock-free processes
• Subtyping for session types in the pi calculus
• Counting the Cost in the Picalculus (Extended Abstract)
• Title not available (Why is that?)
• Pict Correctness Revisited
• Title not available (Why is that?)
• CONCUR 2005 – Concurrency Theory
• Algebraic Pattern Matching in Join Calculus
• Title not available (Why is that?)
• Compilation of Interaction Nets
• Title not available (Why is that?)
• Bisimulation verification using the up to techniques

This page was built for software: Pict