3931 search results - page 388 / 787 » Separation logic and abstraction |
207
click to vote
CADE
2012
Springer
13 years 9 months ago
2012
Springer
Abstract. Reachability and LTL model-checking problems for flat counter systems are known to be decidable but whereas the reachability problem can be shown in NP, the best known c...
224
click to vote
SIAMCOMP
2012
13 years 9 months ago
2012
Abstract. In the framework of Carter and Wegman, a k-independent hash function maps any k keys independently. It is known that 5independent hashing provides good expected performan...
318
click to vote
POPL
2009
ACM
16 years 7 months 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...
194
click to vote
GI
2005
Springer
16 years 14 days ago
2005
Springer
: Service-Oriented Architectures (SOAs) have been established as an IT strategy to support the on demand goal of business agility. Web services standards and their implementations ...
181
click to vote
DAC
2008
ACM
16 years 8 months ago
2008
ACM
Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...