2629 search results - page 236 / 526 » complex 2009 |
201
click to vote
CAV
2009
Springer
16 years 6 months ago
2009
Springer
Context-bounded analysis is an attractive approach to verification of concurrent programs. Bounding the number of contexts executed per thread not only reduces the asymptotic compl...
158
click to vote
PKC
2009
Springer
16 years 6 months ago
2009
Springer
Abstract. We propose an asynchronous protocol for general multiparty computation with perfect security and communication complexity O(n2 |C|k) where n is the number of parties, |C|...
261
click to vote
PODS
2009
ACM
16 years 6 months ago
2009
ACM
In this work we investigate the satisfiability problem for the logic XPath( , , =), that includes all downward axes as well as equality and inequality tests. We address this probl...
152
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
The IEEE standardized Property Specification Language, PSL for short, extends the well-known linear-time temporal logic LTL with so-called semi-extended regular expressions. PSL an...
272
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
Whether beloved or despised, XML Schema is momentarily the only industrially accepted schema language for XML and is unlikely to become obsolete any time soon. Nevertheless, many ...