Pict
From MaRDI portal
Cited in
(98)- Minimality and separation results on asynchronous mobile processes -- representability theorems by concurrent combinators
- scientific article; zbMATH DE number 1500564 (Why is no real title available?)
- A component coordination model based on mobile channels
- scientific article; zbMATH DE number 1696803 (Why is no real title available?)
- A formal environment model for multi-agent systems
- Mixed sessions
- Coupled similarity: the first 32 years
- Mixed sessions
- scientific article; zbMATH DE number 2242605 (Why is no real title available?)
- scientific article; zbMATH DE number 1691456 (Why is no real title available?)
- scientific article; zbMATH DE number 1231683 (Why is no real title available?)
- Compilation of interaction nets
- CONCUR 2005 – Concurrency Theory
- Pict Correctness Revisited
- Algebraic Pattern Matching in Join Calculus
- scientific article; zbMATH DE number 2000452 (Why is no real title available?)
- On the preciseness of subtyping in session types
- scientific article; zbMATH DE number 1512621 (Why is no real title available?)
- Bisimulation verification using the up to techniques
- Pict correctness revisited
- Creol: A type-safe object-oriented model for distributed concurrent systems
- Comparing communication primitives via their relative expressive power
- Behavioral equivalence in the polymorphic pi-calculus
- A Hybrid Type System for Lock-Freedom of Mobile Processes
- Region analysis and a π-calculus with groups
- Asynchronous process calculi: The first- and higher-order paradigms
- scientific article; zbMATH DE number 1512624 (Why is no real title available?)
- scientific article; zbMATH DE number 1223724 (Why is no real title available?)
- Synchrony vs asynchrony in communication primitives
- A concurrent lambda calculus with futures
- Language-based performance prediction for distributed and mobile systems
- A calculus of global interaction based on session types
- scientific article; zbMATH DE number 1304380 (Why is no real title available?)
- scientific article; zbMATH DE number 1231693 (Why is no real title available?)
- Counting the cost in the picalculus (extended abstract)
- Application of a stochastic name-passing calculus to representation and simulation of molecular processes
- scientific article; zbMATH DE number 1231690 (Why is no real title available?)
- A calculus for modeling software components.
- Lolli
- Tutorial on separation results in process calculi via leader election problems
- Modelling dynamic web data
- scientific article; zbMATH DE number 1296290 (Why is no real title available?)
- A calculus for reasoning about software composition
- On the relative expressive power of calculi for mobility
- Process algebras as support for sustainable systems of services
- PiStache: implementing \(\pi \)-calculus in Scala
- scientific article; zbMATH DE number 1569120 (Why is no real title available?)
- scientific article; zbMATH DE number 2090726 (Why is no real title available?)
- Formal Modeling of Mobile Computing Systems Based on Ambient Abstract State Machines
- A formal semantics for the Taverna 2 workflow model
- A type system for lock-free processes
- PiDuce
- CoreASM
- SafeDpi
- JoCaml
- VESTA
- POOL
- MWB
- Petruchio
- PICCOLA
- Oz
- Erlang
- occam-pi
- Pistache
- Facile
- Lilac
- Creol
- ULM
- XPi
- PIPER
- NRL
- PolyTOIL
- The name discipline of uniform receptiveness
- Overture Tool
- VDMTools
- MPINE
- Scribble
- ABCL
- scientific article; zbMATH DE number 1809622 (Why is no real title available?)
- Encodability_Process_Calculi
- Fundamentals of session types
- A Coq library for verification of concurrent programs
- The Orc Programming Language
- Decoding choice encodings
- A taxonomy of process calculi for distribution and mobility
- A closer look at constraints as processes
- Primitives for authentication in process algebras.
- Acute: High-level programming language design for distributed computation
- Relating state-based and process-based concurrency through linear logic
- Subtyping for session types in the pi calculus
- An empirical comparison of formalisms for modelling and analysis of dynamic reconfiguration of dependable systems
- On bisimulations for the asynchronous \(\pi\)-calculus
- An ``abstract process approach to algebraic dynamic architecture description
- Genericity and the \(\pi\)-calculus
- Relating state-based and process-based concurrency through linear logic (full-version)
- Process calculus based upon evaluation to committed form
- On distributability
- Typed behavioural equivalences for processes in the presence of subtyping
This page was built for software: Pict
