Sciweavers

785 search results - page 69 / 157
» Static Analysis of Android Programs
Sort
View
SAS
2007
Springer
128views Formal Methods» more  SAS 2007»
15 years 8 months ago
Magic-Sets Transformation for the Analysis of Java Bytecode
Denotational static analysis of Java bytecode has a nice and clean compositional definition and an efficient implementation with binary decision diagrams. But it models only the f...
Étienne Payet, Fausto Spoto
ESORICS
2012
Springer
13 years 4 months ago
Boosting the Permissiveness of Dynamic Information-Flow Tracking by Testing
Tracking information flow in dynamic languages remains an open challenge. It might seem natural to address the challenge by runtime monitoring. However, there are well-known funda...
Arnar Birgisson, Daniel Hedin, Andrei Sabelfeld
145
Voted
OSDI
2006
ACM
16 years 2 months ago
Securing Software by Enforcing Data-flow Integrity
Software attacks often subvert the intended data-flow in a vulnerable program. For example, attackers exploit buffer overflows and format string vulnerabilities to write data to u...
Manuel Costa, Miguel Castro, Timothy L. Harris
ICFP
1997
ACM
15 years 6 months ago
Implementing Bit-addressing with Specialization
General media-processing programs are easily expressed with bitaddressing and variable-sized bit-fields. But the natural implementation of bit-addressing relies on dynamic shift ...
Scott Draves
103
Voted
DOCENG
2009
ACM
15 years 9 months ago
On the analysis of queries with counting constraints
We study the analysis problem of XPath expressions with counting constraints. Such expressions are commonly used in document transformations or programs in which they select porti...
Everardo Bárcenas, Pierre Genevès, N...