Banshee: A Scalable Constraint-Based Analysis Toolkit

Kodumal, John; Aiken, Alex

doi:10.1007/11547662_16

Cited by 52 publications

(44 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Kodumal and Aiken [13] considered for a limited form of incremental analysis via backtracking in their Banshee toolkit, which allows constraint systems to be rolled back to any previous state for a code change and reanalyses the program from that point forward. Their coarse-grained analysis is fast but imprecise due to its lack of support for context sensitivity.…”

Section: Related Workmentioning

confidence: 99%

“…Incremental analysis is especially important for large projects in a software development environment where it is necessary to maintain a global analysis in the presence of small and frequent edits. Several solutions have been proposed by using incremental elimination [3,5], restarting iteration [20], a combination of these two techniques [18], timestamp-based backtracing [13], and logic program evaluation [24]. In this paper, we introduce an incremental approach for points-to analyses based on CFL-reachability.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An Incremental Points-to Analysis with CFL-Reachability

Lü

Shang

Xie

et al. 2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract.Developing scalable and precise points-to analyses is increasingly important for analysing and optimising object-oriented programs where pointers are used pervasively. An incremental analysis for a program updates the existing analysis information after program changes to avoid reanalysing it from scratch. This can be efficiently deployed in software development environments where code changes are often small and frequent. This paper presents an incremental approach for demand-driven context-sensitive points-to analyses based on ContextFree Language (CFL) reachability. By tracing the CFL-reachable paths traversed in computing points-to sets, we can precisely identify and recompute on demand only the points-to sets affected by the program changes made. Combined with a flexible policy for controlling the granularity of traces, our analysis achieves significant speedups with little space overhead over reanalysis from scratch when evaluated with a null dereferencing client using 14 Java benchmarks.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

An Incremental Points-to Analysis with CFL-Reachability

Lü

Shang

Xie

et al. 2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Some static analyzers use a single encoding of abstract program properties like BDDs in model-checkers, symbolic constraints in BANE [27] and BANSHEE [48], or the canonical abstraction of TVLA [54]. The advantage of this uniform encoding choice is the ease of design.…”

Section: Multi-abstractionmentioning

confidence: 99%

Varieties of Static Analyzers: A Comparison with ASTREE

Cousot

Feret

et al. 2007

First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (TASE '07)

View full text Add to dashboard Cite

show abstract

“…In the past, while explicit implementations provided the fastest running times, they would typically exhaust main memory for large programs [29,31]. However, today, with the large and increasing size of available main memory, we found that an explicit implementation can now scale to large programs.…”

Section: Object-sensitive Points-to Analysismentioning

confidence: 99%

Information-Flow Analysis of Android Applications in DroidSafe

Gordon

Kim

Perkins

et al. 2015

Proceedings 2015 Network and Distributed System Security Symposium

333

202

View full text Add to dashboard Cite

Abstract-We present DroidSafe, a static information flow analysis tool that reports potential leaks of sensitive information in Android applications. DroidSafe combines a comprehensive, accurate, and precise model of the Android runtime with static analysis design decisions that enable the DroidSafe analyses to scale to analyze this model. This combination is enabled by accurate analysis stubs, a technique that enables the effective analysis of code whose complete semantics lies outside the scope of Java, and by a combination of analyses that together can statically resolve communication targets identified by dynamically constructed values such as strings and class designators.Our experimental results demonstrate that 1) DroidSafe achieves unprecedented precision and accuracy for Android information flow analysis (as measured on a standard previously published set of benchmark applications) and 2) DroidSafe detects all malicious information flow leaks inserted into 24 real-world Android applications by three independent, hostile Red-Team organizations. The previous state-of-the art analysis, in contrast, detects less than 10% of these malicious flows.

show abstract

Banshee: A Scalable Constraint-Based Analysis Toolkit

Cited by 52 publications

References 31 publications

An Incremental Points-to Analysis with CFL-Reachability

An Incremental Points-to Analysis with CFL-Reachability

Varieties of Static Analyzers: A Comparison with ASTREE

Information-Flow Analysis of Android Applications in DroidSafe

Contact Info

Product

Resources

About