1054 search results - page 141 / 211 » Guarded Expressions in Practice |
184
click to vote
TCC
2005
Springer
16 years 9 days ago
2005
Springer
Abstract. We prove a computational soundness theorem for the symbolic analysis of cryptographic protocols which extends an analogous theorem of Abadi and Rogaway (J. of Cryptology ...
186
click to vote
VLDB
2005
ACM
16 years 8 days ago
2005
ACM
As a simple XML query language but with enough expressive power, XPath has become very popular. To expedite evaluation of XPath queries, we consider the problem of rewriting XPath...
173
click to vote
WEBDB
2005
Springer
16 years 8 days ago
2005
Springer
As a simple XML query language but with enough expressive power, XPath has become very popular. To expedite evaluation of XPath queries, we consider the problem of caching results...
169
click to vote
ISSTA
2004
ACM
16 years 7 days ago
2004
ACM
Constraints in predicate or relational logic can be translated into boolean logic and solved with a SAT solver. For faster solving, it is common to exploit the typing of predicate...
181
click to vote
CAISE
2004
Springer
16 years 6 days ago
2004
Springer
UML class diagrams can be used as a language for expressing a conceptual model of a domain. In a series of papers [1,2,3] we have been using the General Ontological Language (GOL) ...