Type inference with recursive types: syntax and semantics
Information and Computation
Regular types for active objects
OOPSLA '93 Proceedings of the eighth annual conference on Object-oriented programming systems, languages, and applications
Higher-order concurrent programs with finite communication topology (extended abstract)
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The type and effect discipline
Information and Computation
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Controlling interference in ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Information Processing Letters
Validating firewalls using flow logics
Theoretical Computer Science
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
A Fully Abstract Model for Higher-Order Mobile Ambients
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Typing and Subtyping Mobility in Boxed Ambients
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Graph Types for Monadic Mobile Processes
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
Behavioural Types for a Calculus of Concurrent Objects
Euro-Par '97 Proceedings of the Third International Euro-Par Conference on Parallel Processing
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Shape analysis for mobile ambients
Nordic Journal of Computing
On abstract interpretation of mobile ambients
Information and Computation
BioAmbients: an abstraction for biological compartments
Theoretical Computer Science - Special issue: Computational systems biology
Instant polymorphic type systems for mobile process calculi: just add reduction rules and close
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
| Hi-index | 0.00 |
The Ambient Calculus was developed by Cardelli and Gordon as a formal framework to study issues of mobility and migrant code. Numerous analyses have been developed for numerous variants of that calculus. We take up the challenge of developing, in a type-based setting, a relatively precise "topology" analysis for the original version of the calculus. To compensate for the lack of "co-capabilities" (an otherwise increasingly popular extension), the analysis is flow-sensitive, with the actions of processes being summarized by "behaviors".A subject reduction property guarantees that for a well-typed process, the location of any ambient is included in what is predicted by its type; additionally it ensures that communicating subprocesses agree on their "topic of conversation". Based on techniques borrowed from finite automata theory, type checking of type-annotated processes is decidable (though potentially exponential).