Sciweavers

270 search results - page 47 / 54
» Call Invariants
Sort
View
POPL
2009
ACM
14 years 8 months ago
A calculus of atomic actions
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...
Tayfun Elmas, Shaz Qadeer, Serdar Tasiran
KDD
2006
ACM
381views Data Mining» more  KDD 2006»
14 years 7 months ago
GPLAG: detection of software plagiarism by program dependence graph analysis
Along with the blossom of open source projects comes the convenience for software plagiarism. A company, if less self-disciplined, may be tempted to plagiarize some open source pr...
Chao Liu 0001, Chen Chen, Jiawei Han, Philip S. Yu
HPCA
2002
IEEE
14 years 7 months ago
Using Complete Machine Simulation for Software Power Estimation: The SoftWatt Approach
Power dissipation has become one of the most critical factors for the continued development of both high-end and low-end computer systems. The successful design and evaluation of ...
Sudhanva Gurumurthi, Anand Sivasubramaniam, Mary J...
SIGMOD
2003
ACM
175views Database» more  SIGMOD 2003»
14 years 7 months ago
WinMagic : Subquery Elimination Using Window Aggregation
Database queries often take the form of correlated SQL queries. Correlation refers to the use of values from the outer query block to compute the inner subquery. This is a conveni...
Calisto Zuzarte, Hamid Pirahesh, Wenbin Ma, Qi Che...
ICFP
2004
ACM
14 years 7 months ago
A sound (and complete) model of contracts
Even in statically typed languages it is useful to have certain invariants checked dynamically. Findler and Felleisen gave an algorithm for dynamically checking expressive higher-...
Matthias Blume, David A. McAllester