1304 search results - page 212 / 261 » Model Checking C Programs Using F-SOFT |
130
click to vote
EDBT
2009
ACM
15 years 9 months ago
2009
ACM
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
147
click to vote
TACAS
2010
Springer
15 years 12 days ago
2010
Springer
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
127
click to vote
ASPLOS
2008
ACM
15 years 4 months ago
2008
ACM
The constant race for faster and more powerful CPUs is drawing to a close. No longer is it feasible to significantly increase the speed of the CPU without paying a crushing penalt...
135
Voted
ANCS
2007
ACM
15 years 6 months ago
2007
ACM
Programming specialized network processors (NPU) is inherently difficult. Unlike mainstream processors where architectural features such as out-of-order execution and caches hide ...
152
Voted
SIGMOD
2004
ACM
16 years 2 months ago
2004
ACM
Schema matching identifies elements of two given schemas that correspond to each other. Although there are many algorithms for schema matching, little has been written about build...