An efficient security verification method for programs with stack inspection

Automated Technology for Verification and Analysis

2010

Self Cite

Abstract. This paper proposes a method for automatically inserting check statements for access control into a given recursive program according to a given security specification. A history-based access control (HBAC) is assumed as the access control model. A security specification is given in terms of information flow. We say that a program π satisfies a specification Γ if π is type-safe when we consider each security class in Γ as a type. We first define the problem as the one to insert check statements into a given program π to obtain a program π that is type-safe for a given specification Γ . This type system is sound in the sense that if a program π is type-safe for a specification Γ , then π has noninterference property for Γ . Next, the problem is shown to be co-NP-hard and we propose an algorithm for solving the problem. The paper also reports experimental results based on our implemented system and shows that the proposed method can work within reasonable time.

Section: Phase (2)mentioning

confidence: 99%

“…for safety verification [15,20], LTL model checking [11], analysis of current permission sets [6,16]. Pottier et al [23] and Besson et al [7] proposed type systems such that type safety implies no violation against runtime access control in an SBAC program.…”

Section: Introductionmentioning

confidence: 99%

Automatic Generation of History-Based Access Control from Information Flow Specification

Takata

Automated Technology for Verification and Analysis

2010

Self Cite

“…Stack inspection has been extended in several ways. For example, stack pattern can be specified by LTL formula in [7] and regular language in [4], [8]. Automatic verification methods for a program with stack inspection are also discussed in [4], [7], [8].…”

Section: Introductionmentioning

confidence: 99%

Comparison of the Expressive Power of Language-Based Access Control Models

Takata

IEICE Trans. Inf. & Syst.

2009

Self Cite

SUMMARYThis paper compares the expressive power of five language-based access control models. We show that the expressive powers are incomparable between any pair of history-based access control, regular stack inspection and shallow history automata. Based on these results, we introduce an extension of HBAC, of which expressive power exceeds that of regular stack inspection. key words: history-based access control, stack inspection, shallow history automaton, expressive power

“…However, their approach has severe restrictions, e.g, a mutual recursion is prohibited. Nitta et al [19,20] improve the result of [14] by using indexed grammar in formal language theory and show that a verication problem is decidable for an arbitrary program with stack inspection.…”

Section: Introductionmentioning

confidence: 99%

“…In [20], a subclass of programs which exactly represents programs with JDK1.2 stack inspection is proposed and it is shown that verication of the safety property can be performed in polynomial time of the program size in the subclass. They also present verication results by using a verication tool.…”

Section: Introductionmentioning

confidence: 99%

An Extension of Pushdown System and Its Model Checking Method

Nitta

CONCUR 2003 - Concurrency Theory

2003

Self Cite

In this paper, we present a class of innite transition systems which is an extension of pushdown systems (PDS), and show that LTL (linear temporal logic) model checking for the class is decidable. Since the class is dened as a subclass of term rewriting systems, pushdown stack of PDS is naturally extended to tree structure. By this extension, we c a n model recursive programs with exception handling.