Sciweavers

452 search results - page 33 / 91
» Finding bugs is easy
Sort
View
ICSE
2010
IEEE-ACM
14 years 23 days ago
Developers ask reachability questions
A reachability question is a search across feasible paths through a program for target statements matching search criteria. In three separate studies, we found that reachability q...
Thomas D. LaToza, Brad A. Myers
FM
2009
Springer
169views Formal Methods» more  FM 2009»
13 years 12 months ago
Model Checking Linearizability via Refinement
Abstract. Linearizability is an important correctness criterion for implementations of concurrent objects. Automatic checking of linearizability is challenging because it requires ...
Yang Liu 0003, Wei Chen, Yanhong A. Liu, Jun Sun 0...
FMCAD
2000
Springer
13 years 11 months ago
Monitor-Based Formal Specification of PCI
Bus protocols are hard to specify correctly, and yet it is often critical and highly beneficial that their specifications are correct, complete, and unambiguous. The informal speci...
Kanna Shimizu, David L. Dill, Alan J. Hu
CAV
2008
Springer
108views Hardware» more  CAV 2008»
13 years 10 months ago
Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis
This paper addresses the analysis of concurrent programs with shared memory. Such an analysis is undecidable in the presence of multiple procedures. One approach used in recent wor...
Akash Lal, Thomas W. Reps
ECOOP
2008
Springer
13 years 9 months ago
Assessing the Impact of Aspects on Exception Flows: An Exploratory Study
Exception handling mechanisms are intended to support the development of robust software. However, the implementation of such mechanisms with aspectoriented (AO) programming might ...
Roberta Coelho, Awais Rashid, Alessandro Garcia, F...