785 search results - page 102 / 157 » Static Analysis of Android Programs |
109
click to vote
CORR
2004
Springer
15 years 1 months ago
2004
Springer
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
123
click to vote
CAV
2011
Springer
14 years 5 months ago
2011
Springer
Abstract. Many automatic testing, analysis, and verification techniques for programs can effectively be reduced to a constraint-generation phase followed by a constraint-solving ...
115
click to vote
LCTRTS
2010
Springer
15 years 6 months ago
2010
Springer
Continuous technology scaling has brought us to a point, where transistors have become extremely susceptible to cosmic radiation strikes, or soft errors. Inside the processor, cac...
116
click to vote
ICFP
2004
ACM
16 years 1 months ago
2004
ACM
Useful type inference must be faster than normalization. Otherwise, you could check safety conditions by running the program. We analyze the relationship between bounds on normali...
211
click to vote
POPL
2006
ACM
16 years 2 months ago
2006
ACM
This article investigates formal properties of a family of semantically sound flow-sensitive type systems for tracking information flow in simple While programs. The family is ind...