Sciweavers

2673 search results - page 347 / 535
» Guided Static Analysis
Sort
View
POPL
2005
ACM
16 years 5 months ago
Mutatis mutandis: safe and predictable dynamic software updating
Dynamic software updates can be used to fix bugs or add features to a running program without downtime. Essential for some applications and convenient for others, low-level dynami...
Gareth Stoyle, Michael W. Hicks, Gavin M. Bierman,...
ICFP
2004
ACM
16 years 5 months ago
Types, potency, and idempotency: why nonlinearity and amnesia make a type system work
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...
Harry G. Mairson, Peter Møller Neergaard
PLDI
2010
ACM
16 years 2 months ago
Breadcrumbs: Efficient Context Sensitivity for Dynamic Bug Detection Analyses
Calling context--the set of active methods on the stack--is critical for understanding the dynamic behavior of large programs. Dynamic program analysis tools, however, are almost ...
Michael D. Bond, Graham Z. Baker, Samuel Z. Guyer
136
Voted
CCS
2009
ACM
15 years 11 months ago
Finding bugs in exceptional situations of JNI programs
Software flaws in native methods may defeat Java’s guarantees of safety and security. One common kind of flaws in native methods results from the discrepancy on how exceptions...
Siliang Li, Gang Tan
ATVA
2007
Springer
115views Hardware» more  ATVA 2007»
15 years 11 months ago
A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains
Abstract. Dynamic fault trees (DFTs) are a versatile and common formalism to model and analyze the reliability of computer-based systems. This paper presents a formal semantics of ...
Hichem Boudali, Pepijn Crouzen, Mariëlle Stoe...