Sciweavers

1452 search results - page 44 / 291
» Algorithmic Analysis of Array-Accessing Programs
Sort
View
NFM
2011
223views Formal Methods» more  NFM 2011»
13 years 4 months ago
Generating Data Race Witnesses by an SMT-Based Analysis
Abstract. Data race is one of the most dangerous errors in multithreaded programming, and despite intensive studies, it remains a notorious cause of failures in concurrent systems....
Mahmoud Said, Chao Wang, Zijiang Yang, Karem Sakal...
ISSTA
2009
ACM
14 years 4 months ago
SideTrack: generalizing dynamic atomicity analysis
Atomicity is a key correctness specification for multithreaded programs. Prior dynamic atomicity analyses include precise tools, which report an error if and only if the observed...
Jaeheon Yi, Caitlin Sadowski, Cormac Flanagan
SIGSOFT
2004
ACM
14 years 10 months ago
Efficient incremental algorithms for dynamic detection of likely invariants
Dynamic detection of likely invariants is a program analysis that generalizes over observed values to hypothesize program properties. The reported program properties are a set of ...
Jeff H. Perkins, Michael D. Ernst
PEPM
1995
ACM
14 years 1 months ago
Shape Analysis as a Generalized Path Problem
This paper concerns a method for approximating the possible “shapes” that heap-allocated structures in a program can take on. We present a new approach to finding solutions t...
Thomas W. Reps
RAID
2005
Springer
14 years 3 months ago
Environment-Sensitive Intrusion Detection
We perform host-based intrusion detection by constructing a model from a program’s binary code and then restricting the program’s execution by the model. We improve the effecti...
Jonathon T. Giffin, David Dagon, Somesh Jha, Wenke...