2009 IEEE 31st International Conference on Software Engineering 2009
DOI: 10.1109/icse.2009.5070519
|View full text |Cite
|
Sign up to set email alerts
|

Modular string-sensitive permission analysis with demand-driven precision

Abstract: In modern software systems, programs are obtained by dynamically assembling components. This has made it necessary to subject component providers to access-control restrictions. What permissions should be granted to each component? Too few permissions may cause run-time authorization failures, too many constitute a security hole. We have designed and implemented a composite algorithm for precise static permission analysis for Java and the CLR. Unlike previous work, the analysis is modular and fully integrated … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
20
0
1

Year Published

2011
2011
2015
2015

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 17 publications
(21 citation statements)
references
References 27 publications
0
20
0
1
Order By: Relevance
“…Furthermore, it has been shown that static analysis of the application's source code is a capable tool to identify XSS issues (see for instance [17,39,14,37,7]). Moreover, frameworks which discard the insecure practice of using the string type for syntax assembly are immune against injection attacks through providing suitable means for data/code separation [30,11].…”
Section: Related Workmentioning
confidence: 99%
“…Furthermore, it has been shown that static analysis of the application's source code is a capable tool to identify XSS issues (see for instance [17,39,14,37,7]). Moreover, frameworks which discard the insecure practice of using the string type for syntax assembly are immune against injection attacks through providing suitable means for data/code separation [30,11].…”
Section: Related Workmentioning
confidence: 99%
“…The novelty of our technique is as follows. While certain previous approaches [9,10,11] have used the transitive closure of the immediate-producer relation (which is known as a thin slice) to perform certain inexpensive, approximate analyses, ours is the first to our knowledge to use immediate producers within the overall context of a precise, path-sensitive analysis to skip localized regions of code conservatively.…”
Section: Our First Extensionmentioning
confidence: 99%
“…Sridharan et al originally proposed thin slicing to support program understanding and debugging tasks; they argued that thin slices were much smaller than full slices, while managing to include statements that are pertinent to program understanding and debugging tasks. Then, subsequently proposed approaches [11,10,9] have used the thin slice as a program abstraction (as opposed to using the full program) to carry out different kinds of analyses (not null-deference analysis, though). We did originally consider an approach similar to the ones referred to above.…”
Section: Comparison With a Simple Alternative Approachmentioning
confidence: 99%
See 1 more Smart Citation
“…String analysis is a form of static program analysis which is to infer the possible values of string expressions [26,13,16,17,18,23,28]. Christensen et al [13] generate contextfree grammars with non-terminals representing string expressions in Java programs to approximate the possible values.…”
Section: Related Workmentioning
confidence: 99%