Security verification of programs with stack inspection

Authors:
Naoya Nitta;Hiroyuki Seki;Yashiaki Takata
Affiliations:
Nara Institute of Science and Technology, Nara, Japan;Nara Institute of Science and Technology, Nara, Japan;-
Venue:
SACMAT '01 Proceedings of the sixth ACM symposium on Access control models and technologies
Year:
2001

Citing 14
Cited 4

A calculus for access control in distributed systems

ACM Transactions on Programming Languages and Systems (TOPLAS)
Object-oriented type systems

Object-oriented type systems
Secure information flow in a multi-threaded imperative language

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The SLam calculus: programming with secrecy and integrity

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Security properties of typed applets

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Indexed Grammars—An Extension of Context-Free Grammars

Journal of the ACM (JACM)
Alternation

Journal of the ACM (JACM)
Model checking

Model checking
Certification of programs for secure information flow

Communications of the ACM
A lattice model of secure information flow

Communications of the ACM
Can you Trust your Data?

TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
A Type-Based Approach to Program Security

TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Compile-Time Detection of Information Flow in Sequential Programs

ESORICS '94 Proceedings of the Third European Symposium on Research in Computer Security
Going beyond the sandbox: an overview of the new security architecture in the javaTM development Kit 1.2

USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems

An efficient security verification method for programs with stack inspection

CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
A conservative algorithm for computing the flow of permissions in Java programs

ISSTA '02 Proceedings of the 2002 ACM SIGSOFT international symposium on Software testing and analysis
An Efficient Information Flow Analysis of Recursive Programs Based on a Lattice Model of Security Classes

ICICS '01 Proceedings of the Third International Conference on Information and Communications Security
Formal language constrained reachability and model checking propositional dynamic logics

RP'11 Proceedings of the 5th international conference on Reachability problems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Java development kit 1.2 provides a runtime access control mechanism which inspects a control stack to examine whether the program has appropriate access permissions. Guaranteeing that each execution of a program with stack inspection satisfies required security properties is desirable. Jensen et al. introduced a verification problem of deciding for a given program P and a given security property written in a temporal logic formula, whether every reachable state of P satisfies . They showed that the problem is decidable for the class of programs which do not contain mutual recursion. In this paper, we show that the set of state sequences of a program is always an indexed language and consequently the verification problem is decidable. Our result is stronger than Jensen's in that a security property can be specified by a regular language, whose expressive power is stronger than temporal logic, and in that a program can contain mutual recursion.