81 search results - page 11 / 17 » Approximating module semantics with constraints |
124
click to vote
SIGMOD
2012
ACM
13 years 3 days ago
2012
ACM
We present BloomUnit, a testing framework for distributed programs written in the Bloom language. BloomUnit allows developers to write declarative test specifications that descri...
83
Voted
PPOPP
2009
ACM
15 years 10 months ago
2009
ACM
Researchers in transactional memory (TM) have proposed open nesting as a methodology for increasing the concurrency of transactional programs. The idea is to ignore "low-leve...
IJCAI
1989
14 years 10 months ago
1989
Nilsson's Probabilistic Logic is a set theoretic mechanism for reasoning with uncertainty. We propose a new way of looking at the probability constraints enforced by the fram...
91
Voted
PODS
2010
ACM
14 years 10 months ago
2010
ACM
We study functional and multivalued dependencies over SQL tables with NOT NULL constraints. Under a no-information interpretation of null values we develop tools for reasoning. We...
LOPSTR
2007
Springer
15 years 3 months ago
2007
Springer
Static analyses of object-oriented programs usually rely on intermediate representations that respect the original semantics while having a more uniform and basic syntax. Most of t...