44 search results - page 7 / 9 » On the Verification Problem for Weak Memory Models |
IWMM
2010
Springer
13 years 10 months ago
2010
Springer
The accurate prediction of program's memory requirements is a critical component in software development. Existing heap space analyses either do not take deallocation into ac...
FC
2010
Springer
14 years 2 days ago
2010
Springer
Abstract. Starting from algebraic properties that enable guessing lowentropy secrets, we formalize guessing rules for symbolic verification. The rules are suited for both off-line ...
SAS
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. The field of program analysis has focused primarily on sequential programming languages. But multithreading is becoming increasingly important, both as a program structu...
ASIAMS
2009
IEEE
14 years 1 months ago
2009
IEEE
—Reduced ordered binary decision diagram (ROBDD) is a memory-efficient data structure which is used in many applications such as synthesis, digital system, verification, testing ...
SIGMOD
2007
ACM
14 years 9 months ago
2007
ACM
Graphs are prevalently used to model the relationships between objects in various domains. With the increasing usage of graph databases, it has become more and more demanding to e...