798 search results - page 133 / 160 » Proving More Properties with Bounded Model Checking |
PODS
2008
ACM
14 years 7 months ago
2008
ACM
We revisit the classical chase procedure, studying its properties as well as its applicability to standard database problems. We settle (in the negative) the open problem of decid...
ESORICS
2005
Springer
14 years 1 months ago
2005
Springer
The abstraction of cryptographic operations by term algebras, called Dolev-Yao models, is essential in almost all tool-supported methods for proving security protocols. Recently si...
BIRTHDAY
2010
Springer
13 years 8 months ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
SOSP
2001
ACM
14 years 4 months ago
2001
ACM
As raw system and network performance continues to improve at exponential rates, the utility of many services is increasingly limited by availability rather than performance. A ke...
ESA
2008
Springer
13 years 8 months ago
2008
Springer
Fair-queuing schedulers provide clients with bandwidth or latency guarantees provided they are well-behaved i.e. the requested service is always within strict predefined limits. V...