Mobile calculi for distributed programming
Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
A type system for lock-free processes
Information and Computation - IFIP TCS2000
Mobile objects as mobile processes
Information and Computation - IFIP TCS2000
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Time regions and effects for resource usage analysis
Proceedings of the 2003 ACM SIGPLAN international workshop on Types in languages design and implementation
Region Analysis and a pi-Calculus wiht Groups
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Notes on Nominal Calculi for Security and Mobility
FOSAD '00 Revised versions of lectures given during the IFIP WG 1.7 International School on Foundations of Security Analysis and Design on Foundations of Security Analysis and Design: Tutorial Lectures
Mobile Processes: A Commented Bibliography
MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
A Calculus of Mobile Resources
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
The Join Calculus: A Language for Distributed Mobile Programming
Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
Types, or: Where's the Difference Between CCS and pi?
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Mobile processes: a commented bibliography
Modeling and verification of parallel processes
A fully abstract model for the π-calculus
Information and Computation
Generativity and dynamic opacity for abstract types
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Ontology support for web service processes
Proceedings of the 9th European software engineering conference held jointly with 11th ACM SIGSOFT international symposium on Foundations of software engineering
On the expressive power of polyadic synchronisation in π-calculus
Nordic Journal of Computing
Comparing the expressive power of the synchronous and asynchronous $pi$-calculi
Mathematical Structures in Computer Science
Equational properties of mobile ambients
Mathematical Structures in Computer Science
Region analysis and a π-calculus with groups
Journal of Functional Programming
ACM SIGSOFT Software Engineering Notes
A model-checking verification environment for mobile processes
ACM Transactions on Software Engineering and Methodology (TOSEM)
Theoretical Computer Science - Logic, semantics and theory of programming
A model of runtime transformation for distributed systems based on directed acyclic graph model
Journal of Systems Architecture: the EUROMICRO Journal - Special issue: Adaptable system/Software architectures
Towards a higher-order synchronous data-flow language
Proceedings of the 4th ACM international conference on Embedded software
Mapping Dooley Graphs and Commitment Causality to the "-Calculus
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
Towards a theory of bisimulation for the higher-order process calculi
Journal of Computer Science and Technology
ACM SIGSOFT Software Engineering Notes
Formally refining software architectures with π-ARL: a case study
ACM SIGSOFT Software Engineering Notes
On asynchrony in name-passing calculi
Mathematical Structures in Computer Science
Lambda and pi calculi, CAM and SECD machines
Journal of Functional Programming
Communicating quantum processes
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the expressive power of movement and restriction in pure mobile ambients
Theoretical Computer Science - Special issue: Foundations of wide area network computing
Evaluation of the capability of interaction
ACM SIGGROUP Bulletin - Special issue on community-based learning: explorations into theoretical groundings, empirical findings and computer support
Information and Computation
ACM Transactions on Programming Languages and Systems (TOPLAS)
On the representation of McCarthy's amb in the π-calculus
Theoretical Computer Science - Expressiveness in concurrency
Checking security policies through an enhanced control flow analysis
Journal of Computer Security - Special issue on WITS'03
Journal of Functional Programming
Theoretical Computer Science
A calculus for concurrent system with higher-order streaming communication
Science of Computer Programming - Special issue on system and software architectures(IWSSA'04)
Types and full abstraction for polyadic π-calculus
Information and Computation
CONCUR 2005 - Concurrency Theory
Multiport interaction nets and concurrency
CONCUR 2005 - Concurrency Theory
Model checking for π-calculus using proof search
CONCUR 2005 - Concurrency Theory
Behavioral theory for mobile ambients
Journal of the ACM (JACM)
Formally modelling software architectures with the UML 2.0 profile for π-ADL
ACM SIGSOFT Software Engineering Notes
Communication and mobility control in boxed ambients
Information and Computation
A bisimulation-based semantic theory of Safe Ambients
ACM Transactions on Programming Languages and Systems (TOPLAS)
Dream types: a domain specific type system for component-based message-oriented middleware
SAVCBS '05 Proceedings of the 2005 conference on Specification and verification of component-based systems
Mathematical Structures in Computer Science
A stackless runtime environment for a Pi-calculus
Proceedings of the 2nd international conference on Virtual execution environments
ASDL: a wide spectrum language for designing web services
Proceedings of the 15th international conference on World Wide Web
Towards an algebraic theory of typed mobile processes
Theoretical Computer Science - Automata, languages and programming: Logic and semantics (ICALP-B 2004)
Similarity between preferential models
Theoretical Computer Science
Alpha-structural recursion and induction
Journal of the ACM (JACM)
Concurrent nets: a study of prefixing in process calculi
Theoretical Computer Science - Expressiveness in concurrency
On the expressive power of KLAIM-based calculi
Theoretical Computer Science - Expressiveness in concurrency
Name-passing in an ambient-like calculus and its proof using spatial logic
Theoretical Computer Science - Expressiveness in concurrency
A formal model of concurrent systems based on bipartite directed acyclic graph
Science of Computer Programming - Special issue on quality system and software architectures
Role-based access control for a distributed calculus
Journal of Computer Security - Special issue on CSFW17
Key research issues in grid workflow verification and validation
ACSW Frontiers '06 Proceedings of the 2006 Australasian workshops on Grid computing and e-research - Volume 54
Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
Ensuring termination by typability
Information and Computation
Elimination of quantifiers and undecidability in spatial logics for concurrency
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Types and typechecking for Communicating Quantum Processes
Mathematical Structures in Computer Science
P-congruences as non-interference for the pi-calculus
Proceedings of the fourth ACM workshop on Formal methods in security
Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts
Mathematical Structures in Computer Science
Secure implementations of typed channel abstractions
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Coalgebraic minimization of HD-automata for the π-calculus using polymorphic types
Theoretical Computer Science - Formal methods for components and objects
Theoretical Computer Science - Applied semantics: Selected topics
Relating State-Based and Process-Based Concurrency through Linear Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Type checking a multithreaded functional language with session types
Theoretical Computer Science
Theoretical Computer Science - Logic, language, information and computation
Axiomatizations for probabilistic finite-state behaviors
Theoretical Computer Science
Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures
Electronic Notes in Theoretical Computer Science (ENTCS)
SOS formats and meta-theory: 20 years after
Theoretical Computer Science
Typing for a minimal aspect language: preliminary report
Proceedings of the 6th workshop on Foundations of aspect-oriented languages
Verification of web service descriptions using graph-based traversal algorithms
Proceedings of the 2007 ACM symposium on Applied computing
New up-to techniques for weak bisimulation
Theoretical Computer Science
Semantic model-driven architecting of service-based software systems
Information and Software Technology
Just fast keying in the pi calculus
ACM Transactions on Information and System Security (TISSEC)
Verification of Peer-to-peer Algorithms: A Case Study
Electronic Notes in Theoretical Computer Science (ENTCS)
Controlling information release in the π-calculus
Information and Computation
Biological Transactions for Quantitative Models
Electronic Notes in Theoretical Computer Science (ENTCS)
An exercise in structural congruence
Information Processing Letters
PML: Toward a High-Level Formal Language for Biological Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Information and Computation
Theoretical Computer Science
Graph rewriting for the π-calculus
Mathematical Structures in Computer Science
A Well-behaved LTS for the Pi-calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
State-oriented Noninterference for CCS
Electronic Notes in Theoretical Computer Science (ENTCS)
Tutorial on separation results in process calculi via leader election problems
Theoretical Computer Science
A static compliance-checking framework for business process models
IBM Systems Journal
Symmetric electoral systems for ambient calculi
Information and Computation
Full abstraction for polymorphic π-calculus
Theoretical Computer Science
Free-algebra models for the π -calculus
Theoretical Computer Science
A Chart Semantics for the Pi-Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Linearity, Persistence and Testing Semantics in the Asynchronous Pi-Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
A conceptual architecture for semantic web services development and deployment
International Journal of Web and Grid Services
Code mobility modeling: a temporal labeled reconfigurable nets
Proceedings of the 1st international conference on MOBILe Wireless MiddleWARE, Operating Systems, and Applications
Types for ambient and process mobility†
Mathematical Structures in Computer Science
Reflections on the Future of Concurrency Theory in General and Process Calculi in Particular
Electronic Notes in Theoretical Computer Science (ENTCS)
Secure information flow for a concurrent language with scheduling
Journal of Computer Security - Formal Methods in Security Engineering Workshop (FMSE 04)
Model-driven refinement of software architectures with π-ARL
AMCOS'05 Proceedings of the 4th WSEAS International Conference on Applied Mathematics and Computer Science
ACM Transactions on Programming Languages and Systems (TOPLAS)
Semantically linear programming languages
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Security types for dynamic web data
Theoretical Computer Science
Parametric synchronizations in mobile nominal calculi
Theoretical Computer Science
Using bisimulation proof techniques for the analysis of distributed abstract machines
Theoretical Computer Science
Comparing communication primitives via their relative expressive power
Information and Computation
Concurrent and Located Synchronizations in π-Calculus
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Agent Environment and Knowledge in Distributed Join Calculus
CEEMAS '07 Proceedings of the 5th international Central and Eastern European conference on Multi-Agent Systems and Applications V
ICSOC '07 Proceedings of the 5th international conference on Service-Oriented Computing
Behavioural Theory at Work: Program Transformations in a Service-Centred Calculus
FMOODS '08 Proceedings of the 10th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
A Practical Approach to Verification of Mobile Systems Using Net Unfoldings
PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
Event-Based Service Coordination
Concurrency, Graphs and Models
On Beta-Binders Communications
Concurrency, Graphs and Models
On the Asynchronous Nature of the Asynchronous Π-Calculus
Concurrency, Graphs and Models
Ugo Montanari and Software Verification
Concurrency, Graphs and Models
History Dependent Automata for Service Compatibility
Concurrency, Graphs and Models
A Hybrid Type System for Lock-Freedom of Mobile Processes
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Towards a Unified Approach to Encodability and Separation Results for Process Calculi
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Responsiveness in process calculi
Theoretical Computer Science
Authentication Revisited: Flaw or Not, the Recursive Authentication Protocol
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
On the Role of Names in Reasoning about λ-tree Syntax Specifications
Electronic Notes in Theoretical Computer Science (ENTCS)
Theoretical Computer Science
A Translation of Beta-binders in a Prioritized Pi-calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
An Observational Theory for Mobile Ad Hoc Networks (full version)
Information and Computation
A congruence rule format for name-passing process calculi
Information and Computation
On the origins of bisimulation and coinduction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Journal of Functional Programming
Model-based reasoning on the achievement of business goals
Proceedings of the 2009 ACM symposium on Applied Computing
Normal Bisimulations in Calculi with Passivation
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
ESOP '09 Proceedings of the 18th European Symposium on Programming Languages and Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
A Process Calculus Analysis of Compensations
Trustworthy Global Computing
Trustworthy Global Computing
Dynamic Recovering of Long Running Transactions
Trustworthy Global Computing
Quantifying information leakage in process calculi
Information and Computation
A perspective on service orchestration
Science of Computer Programming
Compiling the π-calculus into a Multithreaded Typed Assembly Language
Electronic Notes in Theoretical Computer Science (ENTCS)
Distributed Systems and Their Environments
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
Decidable Fragments of a Higher Order Calculus with Locations
Electronic Notes in Theoretical Computer Science (ENTCS)
Calculi for Service-Oriented Computing
Formal Methods for Web Services
Counting the Cost in the Picalculus (Extended Abstract)
Electronic Notes in Theoretical Computer Science (ENTCS)
Verification of Correspondence Assertions in a Calculus for Mobile Ad Hoc Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
A Process-Model for Linear Programs
Types for Proofs and Programs
Parametrised Constants and Replication for Spatial Mobility
COORDINATION '09 Proceedings of the 11th International Conference on Coordination Models and Languages
Partial Orders, Event Structures and Linear Strategies
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Expressing first-order π-calculus in higher-order calculus of communicating systems
Journal of Computer Science and Technology
Relating state-based and process-based concurrency through linear logic (full-version)
Information and Computation
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Howe's Method for Calculi with Passivation
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
On the Relationship between η-Calculus and Finite Place/Transition Petri Nets
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
The computational status of physics
Natural Computing: an international journal
Model-checking Web Services Orchestrations using BP-calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
A metadata calculus for secure information sharing
Proceedings of the 16th ACM conference on Computer and communications security
On the computational power of BlenX
Theoretical Computer Science
Proof search specifications of bisimulation and modal logics for the π-calculus
ACM Transactions on Computational Logic (TOCL)
Electronic Notes in Theoretical Computer Science (ENTCS)
A Practical Approach to Verification of Mobile Systems Using Net Unfoldings
Fundamenta Informaticae - Petri Nets 2008
Global Coordination Policies for Services
Electronic Notes in Theoretical Computer Science (ENTCS)
Foundations of Concurrent Kleene Algebra
RelMiCS '09/AKA '09 Proceedings of the 11th International Conference on Relational Methods in Computer Science and 6th International Conference on Applications of Kleene Algebra: Relations and Kleene Algebra in Computer Science
The Higher-Order, Call-by-Value Applied Pi-Calculus
APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems
Modeling Fresh Names in the π-calculus Using Abstractions
Electronic Notes in Theoretical Computer Science (ENTCS)
Relationally Staged Computations in Calculi of Mobile Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
A Reflective Higher-order Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
The Role of Agent Interaction in Models of Computing: Panelist Reviews
Electronic Notes in Theoretical Computer Science (ENTCS)
Dealing Denotationally With Stream-based Communication
Electronic Notes in Theoretical Computer Science (ENTCS)
Contextual Labelled Semantics for Higher-order Process Calculi
Electronic Notes in Theoretical Computer Science (ENTCS)
A Proof Search Specification of the π-Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Architecture Description for Mobile Distributed Systems Using Typed π-Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
An Approach to Splitting Atoms Safely
Electronic Notes in Theoretical Computer Science (ENTCS)
A Concurrent Model for Linear Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
A Game Semantics for Proof Search: Preliminary Results
Electronic Notes in Theoretical Computer Science (ENTCS)
Towards a Calculus For Wireless Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
A Semantical Framework for the Orchestration and Choreography of Web Services
Electronic Notes in Theoretical Computer Science (ENTCS)
A Hierarchy of SOS Rule Formats
Electronic Notes in Theoretical Computer Science (ENTCS)
A Congruence Format for Name-passing Calculi
Electronic Notes in Theoretical Computer Science (ENTCS)
Communication and mobility control in boxed ambients
Information and Computation
Information and Computation
Types and full abstraction for polyadic π-calculus
Information and Computation
On the expressiveness of interaction
Theoretical Computer Science
On generic context lemmas for higher-order calculi with sharing
Theoretical Computer Science
A hybrid type system for lock-freedom of mobile processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
Default interactions for multi-agent simulations of complex organizations
Proceedings of the International Workshop on Enterprises & Organizational Modeling and Simulation
An operational semantics for a calculus for wireless systems
Theoretical Computer Science
Replication vs. recursive definitions in channel based calculi
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Bisimulation proof methods for mobile ambients
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
A distribution law for CCS and a new congruence result for the π-calculus
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
A typed theory for access control and information flow control in mobile systems
ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
Encoding mobile ambients into the π-calculus
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
An algebraic approach for managing inconsistencies in software processes
ICSP'07 Proceedings of the 2007 international conference on Software process
Understanding programming language concepts via operational semantics
Domain modeling and the duration calculus
Ludics is a model for the finitary linear pi-calculus
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
Logical semantics of types for concurrency
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Deriving bisimulation congruences with borrowed contexts
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
FMOODS'07 Proceedings of the 9th IFIP WG 6.1 international conference on Formal methods for open object-based distributed systems
Security types for dynamic web data
TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
On recursion, replication and scope mechanisms in process calculi
FMCO'06 Proceedings of the 5th international conference on Formal methods for components and objects
Responsiveness in process calculi
ASIAN'06 Proceedings of the 11th Asian computing science conference on Advances in computer science: secure software and related issues
Soundness verification of business processes specified in the Pi-calculus
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part I
Complete lattices and up-to techniques
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
CCS with replication in the Chomsky hierarchy: the expressive power of divergence
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
The conversation calculus: a model of service-oriented computation
ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
Interpreting a finitary pi-calculus in differential interaction nets
Information and Computation
Structural operational semantics for weighted transition systems
Semantics and algebraic specification
Mobile processes and termination
Semantics and algebraic specification
Performance evaluation of DPS coordination strategies modelled in pi-calculus
International Journal of Intelligent Information and Database Systems
Weak bisimilarity coalgebraically
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Relating coalgebraic notions of bisimulation: with applications to name-passing process calculi
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Two notions of sub-behaviour for session-based client/server systems
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Type inference and strong static type checking for Promela
Science of Computer Programming
Towards a unified approach to encodability and separation results for process calculi
Information and Computation
A generic abstract machine for stochastic process calculi
Proceedings of the 8th International Conference on Computational Methods in Systems Biology
Formalising policies of a mLearning system using CCA
Proceedings of the 4th ACM International Workshop on Context-Awareness for Self-Managing Systems
Elements of self-adaptive systems: a decentralized architectural perspective
SOAR'09 Proceedings of the First international conference on Self-organizing architectures
Sessions and session types: an overview
WS-FM'09 Proceedings of the 6th international conference on Web services and formal methods
On bisimilarity and substitution in presence of replication
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Depth boundedness in multiset rewriting systems with name binding
RP'10 Proceedings of the 4th international conference on Reachability problems
Session types as intuitionistic linear propositions
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Termination in impure concurrent languages
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
An ADL-approach to specifying and analyzing centralized-mode architectural connection
ECSA'10 Proceedings of the 4th European conference on Software architecture
Environmental bisimulations for higher-order languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
Theoretical Computer Science
Theoretical Computer Science
Functions as processes: termination and the λµµ-calculus
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
Responsive choice in mobile processes
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
A model of evolvable components
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
A tool for checking probabilistic properties of COWS services
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
CLIMA'10 Proceedings of the 11th international conference on Computational logic in multi-agent systems
On the expressiveness and decidability of higher-order process calculi
Information and Computation
Parallel computing with the Pi-calculus
Proceedings of the sixth workshop on Declarative aspects of multicore programming
A separation logic for refining concurrent objects
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Multiset rewriting: a semantic framework for concurrency with name binding
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
Bisimulation proof methods in a path-based specification language for polynomial coalgebras
APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
The Calculus of Context-aware Ambients
Journal of Computer and System Sciences
Encoding Cryptographic Primitives in a Calculus with Polyadic Synchronisation
Journal of Automated Reasoning
Constraint-centric workflow change analytics
Decision Support Systems
A theory of noninterference for the π-calculus
TGC'05 Proceedings of the 1st international conference on Trustworthy global computing
Namespace logic: a logic for a reflective higher-order calculus
TGC'05 Proceedings of the 1st international conference on Trustworthy global computing
Sound bisimulations for higher-order distributed process calculus
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
A testing theory for a higher-order cryptographic language
ESOP'11/ETAPS'11 Proceedings of the 20th European conference on Programming languages and systems: part of the joint European conferences on theory and practice of software
A contextual semantics for concurrent Haskell with futures
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Dependent session types via intuitionistic linear type theory
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
On the semantics of Markov automata
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Hunting distributed malware with the κ-calculus
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Characterizing contextual equivalence in calculi with passivation
Information and Computation
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Full abstraction in a subtyped pi-calculus with linear types
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Behavioral theory for session-oriented calculi
Rigorous software engineering for service-oriented systems
Advanced mechanisms for service combination and transactions
Rigorous software engineering for service-oriented systems
Quantitative analysis of services
Rigorous software engineering for service-oriented systems
A Resource Analysis of the π-calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
An Epistemic Predicate CTL* for Finite Control π-Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
Modeling service representatives in enterprise systems using generic agents
Service Oriented Computing and Applications
Formal modeling
Computational biology: a programming perspective
Formal modeling
Broadcast psi-calculi with an application to wireless protocols
SEFM'11 Proceedings of the 9th international conference on Software engineering and formal methods
Adaptation patterns in multi-agent architectures: the gathering pattern
OTM'11 Proceedings of the 2011th Confederated international conference on On the move to meaningful internet systems
Representation of the signal transduction with aberrance using ipi calculus
CIS'04 Proceedings of the First international conference on Computational and Information Science
Layered patterns in modelling and transformation of service-based software architectures
EWSA'06 Proceedings of the Third European conference on Software Architecture
Interaction soundness for service orchestrations
ICSOC'06 Proceedings of the 4th international conference on Service-Oriented Computing
Beyond bisimulation: the "up-to" techniques
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
Separation results via leader election problems
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
Secrecy of signals by typing in signal transduction
ICNC'06 Proceedings of the Second international conference on Advances in Natural Computation - Volume Part II
More on bisimulations for higher order π-calculus
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Quantifying information leakage in process calculi
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Modeling and analysis of multi-agent systems based on π-calculus
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I
Object connectivity and full abstraction for a concurrent calculus of classes
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Towards concurrent type theory
TLDI '12 Proceedings of the 8th ACM SIGPLAN workshop on Types in language design and implementation
A fully abstract encoding of the π-calculus with data terms
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Basic observables for a calculus for global computing
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Investigations on soundness regarding lazy activities
BPM'06 Proceedings of the 4th international conference on Business Process Management
Formalizing service interactions
BPM'06 Proceedings of the 4th international conference on Business Process Management
A formal approach to molecular docking
CMSB'06 Proceedings of the 2006 international conference on Computational Methods in Systems Biology
Termination in higher-order concurrent calculi
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Typing asymmetric client-server interaction
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Reflections on trust: trust assurance by dynamic discovery of static properties
FAST'09 Proceedings of the 6th international conference on Formal Aspects in Security and Trust
Architecture description for mobile distributed systems
EWSA'05 Proceedings of the 2nd European conference on Software Architecture
Using π-calculus to formalize domain administration of RBAC
ISPEC'06 Proceedings of the Second international conference on Information Security Practice and Experience
On the bisimulation congruence in χ-calculus
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Typing aberrance in signal transduction
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III
Modeling kohn interaction maps with beta-binders: an example
Transactions on Computational Systems Biology III
Java JR: fully abstract trace semantics for a core java language
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
π-Net ADL: an architecture description language for multi-agent systems
ICIC'05 Proceedings of the 2005 international conference on Advances in Intelligent Computing - Volume Part II
Using the π-calculus for formalizing workflow patterns
BPM'05 Proceedings of the 3rd international conference on Business Process Management
Performance analysis of a UML micro-business case study
GC'04 Proceedings of the 2004 IST/FET international conference on Global Computing
The kell calculus: a family of higher-order distributed process calculi
GC'04 Proceedings of the 2004 IST/FET international conference on Global Computing
An abstract machine for the kell calculus
FMOODS'05 Proceedings of the 7th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Alpha-structural recursion and induction
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
Model checking for nominal calculi
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Free-algebra models for the π-calculus
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
A case study of web services orchestration
COORDINATION'05 Proceedings of the 7th international conference on Coordination Models and Languages
Synchronized hyperedge replacement for heterogeneous systems
COORDINATION'05 Proceedings of the 7th international conference on Coordination Models and Languages
Beta binders for biological interactions
CMSB'04 Proceedings of the 20 international conference on Computational Methods in Systems Biology
ETCH: an enhanced type checking tool for promela
SPIN'05 Proceedings of the 12th international conference on Model Checking Software
Proof methodologies for behavioural equivalence in DPI
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
An ontology for mobile agents in the context of formal verification
OTM'05 Proceedings of the 2005 OTM Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, COA, and ODBASE - Volume Part II
Towards a unifying theory for web services composition
WS-FM'06 Proceedings of the Third international conference on Web Services and Formal Methods
Welcome to the jungle: a subjective guide to mobile process calculi
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Weak bisimulation up to elaboration
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Deadlock verification of a DPS coordination strategy and its alternative model in pi-calculus
International Journal of Intelligent Information and Database Systems
Operational patterns in beta-binders
Transactions on Computational Systems Biology I
Observing reductions in nominal calculi via a graphical encoding of processes
Processes, Terms and Cycles
Ensuring secure and robust grid applications – from a formal method point of view
GPC'06 Proceedings of the First international conference on Advances in Grid and Pervasive Computing
On mobility of software processes
SPW/ProSim'06 Proceedings of the 2006 international conference on Software Process Simulation and Modeling
The bisimulation proof method: enhancements and open problems
FMOODS'06 Proceedings of the 8th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
A graphical representation for biological processes in the stochastic pi-calculus
Transactions on Computational Systems Biology VII
Modelling self-assembly in BlenX
Transactions on Computational Systems Biology XII
Incremental pattern-based coinduction for process algebra and its isabelle formalization
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Observables for mobile and wireless broadcasting systems
COORDINATION'10 Proceedings of the 12th international conference on Coordination Models and Languages
Value-passing CCS with noisy channels
Theoretical Computer Science
Formal specification and verification of vehicular handoff using π-calculus
Proceedings of the 1st International Conference on Wireless Technologies for Humanitarian Relief
A formal adversary capability model for SCADA environments
CRITIS'10 Proceedings of the 5th international conference on Critical Information Infrastructures Security
Analysis of service oriented software systems with the conversation calculus
FACS'10 Proceedings of the 7th international conference on Formal Aspects of Component Software
Program equivalence in a simple language with state
Computer Languages, Systems and Structures
Multiset rewriting for the verification of depth-bounded processes with name binding
Information and Computation
Expressing global priorities by best-matching
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Decidability of behavioral equivalences in process calculi with name scoping
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
Linear logical relations for session-based concurrency
ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
Applicative bisimulations for delimited-control operators
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Is it a "good" encoding of mixed choice?
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Functions as session-typed processes
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
SLMC: a tool for model checking concurrent systems against dynamical spatial logic specifications
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
First-order reasoning for higher-order concurrency
Computer Languages, Systems and Structures
Normal form bisimulations for delimited-control operators
FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
A Higher-Order Distributed Calculus with Name Creation
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Conservative Concurrency in Haskell
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Saving Space in a Time Efficient Simulation Algorithm
Fundamenta Informaticae - Application of Concurrency to System Design, the Eighth Special Issue
A Practical Approach to Verification of Mobile Systems Using Net Unfoldings
Fundamenta Informaticae - Petri Nets 2008
Behavioural equivalences over migrating processes with timers
FMOODS'12/FORTE'12 Proceedings of the 14th joint IFIP WG 6.1 international conference and Proceedings of the 32nd IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
Types for coordinating secure behavioural variations
COORDINATION'12 Proceedings of the 14th international conference on Coordination Models and Languages
Proceedings of the 14th symposium on Principles and practice of declarative programming
From the π-calculus to flat GHC
Proceedings of the 14th symposium on Principles and practice of declarative programming
Electronic Notes in Theoretical Computer Science (ENTCS)
Rule formats for distributivity
Theoretical Computer Science
A type system for counting instances of software components
Theoretical Computer Science
Interpreting a finitary pi-calculus in differential interaction nets
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Nominal automata for resource usage control
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Duality and i/o-types in the π-calculus
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
A polynomial translation of π-calculus (FCP) to safe petri nets
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Formalising security in ubiquitous and cloud scenarios
CISIM'12 Proceedings of the 11th IFIP TC 8 international conference on Computer Information Systems and Industrial Management
Open bisimulation for quantum processes
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
On the semantics of Markov automata
Information and Computation
On action permutation and progress for partially commutative asynchronous binary sessions
IDCS'12 Proceedings of the 5th international conference on Internet and Distributed Computing Systems
Behavioral polymorphism and parametricity in session-based communication
ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems
Concurrent flexible reversibility
ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems
Modeling and verification of security properties for critical infrastructure protection
Proceedings of the Eighth Annual Cyber Security and Information Intelligence Research Workshop
Internet of things: a process calculus approach
Proceedings of the 28th Annual ACM Symposium on Applied Computing
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
On coinductive equivalences for higher-order probabilistic functional programs
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Algebraic program semantics for supercomputing
Theories of Programming and Formal Methods
Algorithms for checking channel passing in web service choreography
Frontiers of Computer Science: Selected Publications from Chinese Universities
Name-Passing Calculi: From Fusions to Preorders and Types
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Strong Normalization in the π-calculus with Intersection and Union Types
Fundamenta Informaticae - Intersection Types and Related Systems ITRS
A Petri Net Interpretation of Open Reconfigurable Systems
Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2011
| Hi-index | 0.03 |
From the Publisher:Mobile systems, whose components communicate and change their structure, now pervade the informational world and the wider world of which it is a part. The science of mobile systems is as yet immature, however. This book presents the pi-calculus, a theory of mobile systems. The pi-calculus provides a conceptual framework for understanding mobility, and mathematical tools for expressing systems and reasoning about their behaviors. The book serves both as a reference for the theory and as an extended demonstration of how to use pi-calculus to describe systems and analyze their properties. It covers the basic theory of pi-calculus, typed pi-calculi, higher-order processes, the relationship between pi-calculus and lambda-calculus, and applications of pi-calculus to object-oriented design and programming. The book is written at the graduate level, assuming no prior acquaintance with the subject, and is intended for computer scientists interested in mobile systems.