| 
|
QuoteRef: naikM6_2006
Topic:
race conditions
Topic:
code optimization by flow analysis
Topic:
flavor analysis and typestates for supplementary type checking
Reference
Naik, M., Aiken, A., Whaley, J., "Effective static race detection for Java", Proceedings of the 2006 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'06), ACM SIGPLAN Notices, 41, 6, June 2006, Ottawa, Ontario, Canada, pp. 308-319. Google
308 ;;Quote: Chord for race detection using lock-based, fork/join, and wait/notify synchronization; identified 18 bugs in jdbf
308 ;;Quote: Chord computes reachable pairs, aliasing pairs, escaping pairs, and unlocked pairs; using call-graph, alias, thread-escape, and lock analysis
309 ;;Quote: Chord uses k-object sensitivity with k=3; the abstract context of an instance method is an abstract object bound to 'this'; precise alias analysis
309 ;;Quote: Chord uses annotations to specify which threads can not execute in parallel; 42 annotations per 1.5 million lines of code
310 ;;Quote: Chord analyzes open programs and reports counterexamples; essential; detect races before deployment
310 ;;Quote: report counterexamples for each race, categorized by field and by object; which threads, which objects, and which locks
Topic: race conditions (33 items)
Topic: code optimization by flow analysis (47 items)
Topic: flavor analysis and typestates for supplementary type checking (68 items)