Sciweavers

146 search results - page 8 / 30
» Putting Pointer Analysis to Work
Sort
View
KER
2008
134views more  KER 2008»
13 years 7 months ago
A review of current defeasible reasoning implementations
This article surveys existing practical implementations of both defeasible and argumentationbased reasoning engines and associated literature. We aim to summarise the current stat...
Daniel Bryant, Paul J. Krause
CAV
2012
Springer
334views Hardware» more  CAV 2012»
11 years 10 months ago
Joogie: Infeasible Code Detection for Java
We present Joogie, a tool that detects infeasible code in Java programs. Infeasible code is code that does not occur on feasible controlflow paths and thus has no feasible executi...
Stephan Arlt, Martin Schäf
SCAM
2008
IEEE
14 years 1 months ago
Automatic Determination of May/Must Set Usage in Data-Flow Analysis
Data-flow analysis is a common technique to gather program information for use in transformations such as register allocation, dead-code elimination, common subexpression elimina...
Andrew Stone, Michelle Strout, Shweta Behere
CAV
2008
Springer
160views Hardware» more  CAV 2008»
13 years 9 months ago
Scalable Shape Analysis for Systems Code
Pointer safety faults in device drivers are one of the leading causes of crashes in operating systems code. In principle, shape analysis tools can be used to prove the absence of t...
Hongseok Yang, Oukseh Lee, Josh Berdine, Cristiano...
CAV
2006
Springer
116views Hardware» more  CAV 2006»
13 years 11 months ago
Lazy Shape Analysis
Abstract. Many software model checkers are based on predicate abstraction. If the verification goal depends on pointer structures, the approach does not work well, because it is di...
Dirk Beyer, Thomas A. Henzinger, Grégory Th...