1700 search results - page 298 / 340 » Specifying and implementing refactorings |
194
click to vote
POPL
2009
ACM
16 years 13 days ago
2009
ACM
We present a proof calculus and method for the static verification of assertions and procedure specifications in shared-memory concurrent programs. The key idea in our approach is...
211
click to vote
POPL
2009
ACM
16 years 13 days ago
2009
ACM
ibe an abstract interpretation based framework for proving relationships between sizes of memory partitions. Instances of this framework can prove traditional properties such as m...
189
click to vote
POPL
2009
ACM
16 years 13 days ago
2009
ACM
This paper describes a compositional shape analysis, where each procedure is analyzed independently of its callers. The analysis uses an abstract domain based on a restricted frag...
PPOPP
2009
ACM
16 years 10 days ago
2009
ACM
Fairness is an essential requirement of any operating system scheduler. Unfortunately, existing fair scheduling algorithms are either inaccurate or inefficient and non-scalable fo...
102
click to vote
KDD
2003
ACM
16 years 6 days ago
2003
ACM
Because of practical limits in characterizing the safety profiles of therapeutic products prior to marketing, manufacturers and regulatory agencies perform post-marketing surveill...