A theory of higher order communicating systems
Information and Computation
Bisimulation for higher-order process calculi
Information and Computation
KLAIM: A Kernel Language for Agents Interaction and Mobility
IEEE Transactions on Software Engineering
Controlling interference in ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
A Classification and Comparison Framework for Software Architecture Description Languages
IEEE Transactions on Software Engineering
Foundations of component-based systems
Foundations of component-based systems
Theoretical Computer Science
Theoretical Computer Science
Bisimulation congruences in safe ambients
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Distributed Algorithms
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
The m-calculus: a higher-order distributed process calculus
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Nomadic Pict: Language and Infrastructure Design for Mobile Agents
IEEE Concurrency
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Architectural Reasoning in ArchJava
ECOOP '02 Proceedings of the 16th European Conference on Object-Oriented Programming
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
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
The Seal Calculus Revisited: Contextual Equivalence and Bisimilarity
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Communication Interference in Mobile Boxed Ambients
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
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
Behavioral theory for mobile ambients
Journal of the ACM (JACM)
A bisimulation-based semantic theory of Safe Ambients
ACM Transactions on Programming Languages and Systems (TOPLAS)
Structuring Operational Semantics: Simplification and Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
A Calculus of Components with Dynamic Type-Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
Oz/K: a kernel language for component-based open programming
GPCE '07 Proceedings of the 6th international conference on Generative programming and component engineering
Electronic Notes in Theoretical Computer Science (ENTCS)
Typing communicating component assemblages
GPCE '08 Proceedings of the 7th international conference on Generative programming and component engineering
Mobility control via passports
Information and Computation
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
Encapsulation and Dynamic Modularity in the π-calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
A declarative formal approach to dynamic reconfiguration
Proceedings of the 1st international workshop on Open component ecosystems
Howe's Method for Calculi with Passivation
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
LMNtal as a hierarchical logic programming language
Theoretical Computer Science
Bisimulations for a distributed higher order π-calculus
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Service combinators for farming virtual machines
COORDINATION'08 Proceedings of the 10th international conference on Coordination models and languages
Environmental bisimulations for higher-order languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
A model of evolvable components
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
KES'10 Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part I
On the expressiveness and decidability of higher-order process calculi
Information and Computation
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part II
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
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
Characterizing contextual equivalence in calculi with passivation
Information and Computation
Termination in higher-order concurrent calculi
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Extending howe's method to early bisimulations for typed mobile embedded resources with local names
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
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
Component-oriented programming with sharing: containment is not ownership
GPCE'05 Proceedings of the 4th international conference on Generative Programming and Component Engineering
Proceedings of the eleventh workshop on Foundations of Aspect-Oriented Languages
Towards a general theory of barbs, contexts and labels
APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
Steps on the road to component evolvability
FACS'10 Proceedings of the 7th international conference on Formal Aspects of Component Software
A component model for the ABS language
FMCO'10 Proceedings of the 9th international conference on Formal Methods for Components and Objects
More on bisimulations for higher order π-calculus
Theoretical Computer Science
A Higher-Order Distributed Calculus with Name Creation
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Mobility control via passports
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Towards a formal component model for the cloud
SEFM'12 Proceedings of the 10th international conference on Software Engineering and Formal Methods
An object group-based component model
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I
Towards the verification of adaptable processes
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I
Symbolic bisimulation for a higher-order distributed language with passivation
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
| Hi-index | 0.00 |
This paper presents the Kell calculus, a family of distributed process calculi, parameterized by languages for input patterns, that is intended as a basis for studying component-based distributed programming. The Kell calculus is built around a π-calculus core, and follows five design principles which are essential for a foundational model of distributed and mobile programming: hierarchical localities, local actions, higher-order communication, programmable membranes, and dynamic binding. The paper discusses these principles, and defines the syntax and operational semantics common to all calculi in the Kell calculus family. The paper provides a co-inductive characterization of contextual equivalence for Kell calculi, under sufficient conditions on pattern languages, by means of a form of higher-order bisimulation called strong context bisimulation. The paper also contains several examples that illustrate the expressive power of Kell calculi.