A calculus of mobile processes, I
Information and Computation
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
A functional theory of local names
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Types as models: model checking message-passing programs
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the Expressivity of the Modal Mu-Calculus
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
On the Decidability of Model Checking for Several µ-calculi and Petri Nets
CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
FreshML: programming with binders made simple
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
A generic type system for the Pi-calculus
Theoretical Computer Science
Theoretical Computer Science
Multiparty asynchronous session types
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Types and trace effects of higher order programs
Journal of Functional Programming
Local policies for resource usage analysis
ACM Transactions on Programming Languages and Systems (TOPLAS)
Types and Effects for resource usage analysis
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
History-based access control with local policies
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
| Hi-index | 0.00 |
We define a type and effect system for a λ -calculus extended with side effects, in the form of primitives for creating and accessing resources. The analysis correctly over-approximates the sequences of resource accesses performed by a program at run-time. To accurately analyse the binding between the creation of a resource and its accesses, our system exploits a new class of types. Our ν -types have the form νN . τ H , where the names in N are bound both in the type τ and in the effect H , that represents the sequences of resource accesses.