Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Inside Java 2 platform security architecture, API design, and implementation
Inside Java 2 platform security architecture, API design, and implementation
Enforcing trace properties by program transformation
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A type system for expressive security policies
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
SASI enforcement of security policies: a retrospective
Proceedings of the 1999 workshop on New security paradigms
ACM Transactions on Information and System Security (TISSEC)
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Principles of Program Analysis
Principles of Program Analysis
Stack inspection: Theory and variants
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Trace effects and object orientation
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Types and Effects for Secure Service Orchestration
CSFW '06 Proceedings of the 19th IEEE workshop on Computer Security Foundations
Checking risky events is enough for local policies
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
History-based access control with local policies
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Barbed Model--Driven Software Development: A Case Study
Electronic Notes in Theoretical Computer Science (ENTCS)
Trustworthy Global Computing
Local policies for resource usage analysis
ACM Transactions on Programming Languages and Systems (TOPLAS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Calculi for Service-Oriented Computing
Formal Methods for Web Services
ν -Types for Effects and Freshness Analysis
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Jalapa: Securing Java with Local Policies
Electronic Notes in Theoretical Computer Science (ENTCS)
Foundations of security analysis and design IV
Modular plans for secure service composition
ARSPA-WITS'10 Proceedings of the 2010 joint conference on Automated reasoning for security protocol analysis and issues in the theory of security
A type system for access control views in object-oriented languages
ARSPA-WITS'10 Proceedings of the 2010 joint conference on Automated reasoning for security protocol analysis and issues in the theory of security
Secure service orchestration in open networks
Journal of Systems Architecture: the EUROMICRO Journal
Call-by-contract for service discovery, orchestration and recovery
Rigorous software engineering for service-oriented systems
Rigorous software engineering for service-oriented systems
Bring your own device, securely
Proceedings of the 28th Annual ACM Symposium on Applied Computing
| Hi-index | 0.00 |
An extension of the λ-calculus is proposed, to study resource usage analysis and verification. Resources can be dynamically created, and passed / returned by functions; their usages have side effects, represented by events. Usage policies are properties over histories of events, and have a possibly nested, local scope. A type and effect system over-approximates the set of histories a program can generate at run-time. A crucial point solved here concerns correctly associating fresh resources with their usages within approximations. A second issue is that these approximations may contain an unbounded number of fresh resources. Despite of that, we have devised a technique to model-check validity of approximations. A program with a valid approximation is resource-safe: no run-time monitor is needed to safely drive its executions.