A formalism for real-time concurrent object-oriented computing
OOPSLA '92 conference proceedings on Object-oriented programming systems, languages, and applications
ICS '92 Proceedings of the 6th international conference on Supercomputing
Elements of interaction: Turing award lecture
Communications of the ACM
Combinatory representation of mobile processes
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Semantic-based visualization for parallel object-oriented programming
Proceedings of the 11th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Functional computation as concurrent computation
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The reflexive CHAM and the join-calculus
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
OOPSLA '93 Addendum to the proceedings on Object-oriented programming systems, languages, and applications (Addendum)
Comparing the expressive power of the synchronous and the asynchronous &pgr;-calculus
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Object graph rewriting: an experimental parallel implementation
PASCO '97 Proceedings of the second international symposium on Parallel symbolic computation
Combinatory formulations of concurrent languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
Formal Methods in System Design
An actor algebra for specifying distributed systems: The hurried philosophers case study
Concurrent object-oriented programming and petri nets
Abstractions for mobile computations
Secure Internet programming
A uniform type structure for secure information flow
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Bisimulations in the join-calculus
Theoretical Computer Science
Fine-Grained Multithreading with Process Calculi
IEEE Transactions on Computers - Special issue on the parallel architecture and compilation techniques conference
Trace and testing equivalence on asynchronous processes
Information and Computation
Actors: a model for reasoning about open distributed systems
Formal methods for distributed processing
Formal methods for distributed processing
Formal methods for distributed processing
PICCOLA---a small composition language
Formal methods for distributed processing
Dynamic connectors for concurrency
Theoretical Computer Science
Types for the ambient calculus
Information and Computation - IFIP TCS2000
Mobile objects as mobile processes
Information and Computation - IFIP TCS2000
Theoretical Computer Science
Understanding the mismatch combinator in Chi calculus
Theoretical Computer Science
Nordic Journal of Computing
On decidability of the control reachability problem in the asynchronous π-calculus
Nordic Journal of Computing
Timing UDP: Mechanized Semantics for Sockets, Threads, and Failures
ESOP '02 Proceedings of the 11th European Symposium on Programming Languages and Systems
Location-Independent Communication for Mobile Agents: A Two-Level Architecture
ICCL'98 Workshop on Internet Programming Languages
Resource-Passing Concurrent Programming
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
The UDP Calculus: Rigorous Semantics for Real Networking
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
A Theory of May Testing for Asynchronous Calculi with Locality and No Name Matching
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Bisimulation Lattice of Chi Processes
ASIAN '98 Proceedings of the 4th Asian Computing Science Conference on Advances in Computing Science
A Timed Calculus for Distributed Objects with Clocks
ECOOP '93 Proceedings of the 7th European Conference on Object-Oriented Programming
Time and Asynchrony in Interactions among Distributed Real-Time Objects
ECOOP '95 Proceedings of the 9th European Conference on Object-Oriented Programming
Process Algebraic Specification of the New Asynchronous CORBA Messaging Service
ECOOP '99 Proceedings of the 13th European Conference on Object-Oriented Programming
On Synchronous and Asynchronous Communication Paradigms
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Finite State Verification for the Asynchronous pi-Calculus
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Mobile Processes: A Commented Bibliography
MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
Suptyping and Locality in Distributed Higher Order Processes (extended abstract)
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Typing Non-uniform Concurrent Objects
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
A Theory of "May" Testing for Asynchronous Languages
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Probabilistic Asynchronous pi-Calculus
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Locality and Polyadicity in Asynchronous Name-Passing Calculi
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
On Synchronous and Asynchronous Mobile Processes
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Local pi-Calculus at Work: Mobile Objects as Mobile Processes
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
An Interpretation of Typed Concurrent Objects in the Blue Calculus
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Types and Subtypes for Client-Server Interactions
ESOP '99 Proceedings of the 8th European Symposium on Programming Languages and Systems
Expressiveness and Distributed Implementation of Conciurrent Calculi with Link Mobility
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Mobile processes: a commented bibliography
Modeling and verification of parallel processes
A theory of may testing for actors
FMOODS '02 Proceedings of the IFIP TC6/WG6.1 Fifth International Conference on Formal Methods for Open Object-Based Distributed Systems V
Models for Name-Passing Processes: Interleaving and Causal
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
A Theory of Bisimulation for a Fragment of Concurrent ML with Local Names
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Secure Composition of Insecure Components
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Secure composition of untrusted code: box π, wrappers, and causality types
Journal of Computer Security - CSFW13
Bisimulation congruence of ℵ-calculus
Information and Computation
On the expressive power of polyadic synchronisation in π-calculus
Nordic Journal of Computing
Theoretical Computer Science
Mathematical Structures in Computer Science
Comparing the expressive power of the synchronous and asynchronous $pi$-calculi
Mathematical Structures in Computer Science
Uniform confluence in concurrent computation
Journal of Functional Programming
A foundation for actor computation
Journal of Functional Programming
Models for name-passing processes: interleaving and causal
Information and Computation
From process logic to program logic
Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
Strong normalisation in the π-calculus
Information and Computation
On asynchrony in name-passing calculi
Mathematical Structures in Computer Science
Lambda and pi calculi, CAM and SECD machines
Journal of Functional Programming
Abstractions for fault-tolerant global computing
Theoretical Computer Science - Special issue: Foundations of wide area network computing
A theory of bisimulation for a fragment of concurrent ML with local names
Theoretical Computer Science
Noninterference through flow analysis
Journal of Functional Programming
Journal of Functional Programming
A randomized encoding of the π-calculus with mixed choice
Theoretical Computer Science - Process algebra
Formalising Java RMI with explicit code mobility
OOPSLA '05 Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Types and full abstraction for polyadic π-calculus
Information and Computation
A game semantics of the asynchronous π-calculus
CONCUR 2005 - Concurrency Theory
Behavioral theory for mobile ambients
Journal of the ACM (JACM)
A closer look at constraints as processes
Information Processing Letters
On the expressive power of KLAIM-based calculi
Theoretical Computer Science - Expressiveness in concurrency
A service-oriented language for programming mobile agents
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Transition systems, link graphs and Petri nets
Mathematical Structures in Computer Science
A calculus for reasoning about software composition
Theoretical Computer Science - Formal methods for components and objects
Theoretical Computer Science - Applied semantics: Selected topics
Creol: a type-safe object-oriented model for distributed concurrent systems
Theoretical Computer Science - Components and objects
Abstract Interpretation Against Races
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Abstract Interpretation of an Object Calculus for Synchronization Optimizations
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Multi Labelled Transition Systems: A Semantic Framework for Nominal Calculi
Electronic Notes in Theoretical Computer Science (ENTCS)
Science of Computer Programming
Synchrony vs Asynchrony in Communication Primitives
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
ACM Turing award lectures
A uniform type structure for secure information flow
ACM Transactions on Programming Languages and Systems (TOPLAS)
Separation of synchronous and asynchronous communication via testing
Theoretical Computer Science
Type-based cryptographic operations
Journal of Computer Security - Special issue on CSFW15
Tutorial on separation results in process calculi via leader election problems
Theoretical Computer Science
Formalising Java RMI with explicit code mobility
Theoretical Computer Science
Symmetric electoral systems for ambient calculi
Information and Computation
Multiparty asynchronous session types
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Free-algebra models for the π -calculus
Theoretical Computer Science
Multiple-labelled transition systems for nominal calculi and their logics†
Mathematical Structures in Computer Science
Semantic subtyping for the pi-calculus
Theoretical Computer Science
Comparing communication primitives via their relative expressive power
Information and Computation
SuMo: A Framework for Prototyping Distributed and Mobile Software
ICA3PP '08 Proceedings of the 8th international conference on Algorithms and Architectures for Parallel Processing
Checking Correctness of Transactional Behaviors
FORTE '08 Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
On the Asynchronous Nature of the Asynchronous Π-Calculus
Concurrency, Graphs and Models
Deriving Structural Labelled Transitions for Mobile Ambients
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Abstract Semantics by Observable Contexts
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Theoretical Computer Science
A formal model of provenance in distributed systems
TAPP'09 First workshop on on Theory and practice of provenance
Minimization Algorithm for Symbolic Bisimilarity
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
Refactoring Long Running Transactions
Web Services and Formal Methods
Compiling the π-calculus into a Multithreaded Typed Assembly Language
Electronic Notes in Theoretical Computer Science (ENTCS)
Making the Unobservable, Unobservable
Electronic Notes in Theoretical Computer Science (ENTCS)
On Observing Dynamic Prioritised Actions in SOC
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
On the Relative Expressive Power of Calculi for Mobility
Electronic Notes in Theoretical Computer Science (ENTCS)
A Logical Interpretation of the λ-Calculus into the η-Calculus, Preserving Spine Reduction and Types
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Encoding Asynchronous Interactions Using Open Petri Nets
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Testing equivalence for asymmetric χ-calculus
AsiaMS '07 Proceedings of the IASTED Asian Conference on Modelling and Simulation
Global Coordination Policies for Services
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Observational Theory of the CPS-calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Types and full abstraction for polyadic π-calculus
Information and Computation
A closer look at constraints as processes
Information Processing Letters
An expressiveness study of priority in process calculi
Mathematical Structures in Computer Science
On the expressiveness of interaction
Theoretical Computer Science
Sequentiality and the π-calculus
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Encoding mobile ambients into the π-calculus
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
An exact correspondence between a typed pi-calculus and polarised proof-nets
Theoretical Computer Science
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Performance evaluation of DPS coordination strategies modelled in pi-calculus
International Journal of Intelligent Information and Database Systems
Coalgebraic symbolic semantics
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Science of Computer Programming
Towards a unified approach to encodability and separation results for process calculi
Information and Computation
Deriving structural labelled transitions for mobile ambients
Information and Computation
On the expressiveness of polyadic and synchronous communication in higher-order process calculi
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Type-safe eventful sessions in java
ECOOP'10 Proceedings of the 24th European conference on Object-oriented programming
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Functions as processes: termination and the λµµ-calculus
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
Concurrency can't be observed, asynchronously
APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
History-based access control for distributed processes
TGC'05 Proceedings of the 1st international conference on Trustworthy global computing
On asynchronous session semantics
FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
Verification techniques for distributed algorithms
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Separation results via leader election problems
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
On the relative expressive power of asynchronous communication primitives
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
A mobile agent service-oriented scripting language encoded on a process calculus
JMLC'06 Proceedings of the 7th joint conference on Modular Programming Languages
Analysing the MUTE anonymous file-sharing system using the pi-calculus
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
A generic membrane model (note)
GC'04 Proceedings of the 2004 IST/FET international conference on Global Computing
Theory and implementation of a real-time extension to the π-calculus
FMOODS'10/FORTE'10 Proceedings of the 12th IFIP WG 6.1 international conference and 30th IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
Encoding CDuce in the Cπ-calculus
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
On the expressive power of primitives for compensation handling
ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
A unified theory of program logics: an approach based on the π-calculus
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
Is it a "good" encoding of mixed choice?
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Toward design, modelling and analysis of dynamic workflow reconfigurations
WS-FM'11 Proceedings of the 8th international conference on Web Services and Formal Methods
A lambda calculus for gödel---dummett logic capturing waitfreedom
FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
Modelling and analysis of dynamic reconfiguration in BP-Calculus
KES-AMSTA'12 Proceedings of the 6th KES international conference on Agent and Multi-Agent Systems: technologies and applications
Abstract Interpretation of an Object Calculus for Synchronization Optimizations
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Abstract Interpretation Against Races
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
From the π-calculus to flat GHC
Proceedings of the 14th symposium on Principles and practice of declarative programming
Compositional event structure semantics for the internal π-calculus
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Specifying stateful asynchronous properties for distributed programs
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
An output-based semantics of Λμ with explicit substitution in the π-calculus: extended abstract
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
On distributability in process calculi
ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems
Completeness and Soundness Results for X with Intersection and Union Types
Fundamenta Informaticae - Intersection Types and Related Systems ITRS
Towards a formal analysis of dynamic reconfiguration in WS-BPEL
Intelligent Decision Technologies
| Hi-index | 0.03 |