Work

A Simple Semantics and Static Analysis for Stack Inspection

Year: 2013

Type: article

Abstract: The Java virtual machine and the .NET common language runtime feature an access control mechanism specified operationally in terms of run-time stack inspection. We give a denotational semantics in "eager" form, and show that it is equivalent to the "lazy" semantics using stack inspection. We give a static analysis of safety, i.e., the absence of security errors, that is simpler than previous proposals. We identify several program transformations that can be used to remove run-time checks. We give complete, detailed proofs for safety of the analysis and for the transformations, exploiting compositionality of the eager semantics.

Source: Electronic Proceedings in Theoretical Computer Science

DOI: 10.4204/eptcs.129.17

Authors: Anindya Banerjee, David A. Naumann

Institutions: IMDEA Software Institute, Stevens Institute of Technology

Language: English

Topic: Logic, programming, and type systems

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

Funders: National Science Foundation, European Commission

Awards: TWC: Medium: Collaborative: Flexible and Practical Information Flow Assurance for Mobile Apps, U.S.-Brazil Cooperative Research: Towards a Practical Calculus of Object-Oriented Programming, Network of Excellence on Engineering Secure Future Internet Software Services and Systems