3775 search results - page 576 / 755 » The Expression Problem Revisited |
147
click to vote
TCC
2005
Springer
15 years 10 months 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 ...
157
click to vote
UML
2005
Springer
15 years 10 months ago
2005
Springer
Analysis and design by contract allows the definition of a formal agreement between a class and its clients, expressing each party’s rights and obligations. Contracts written in ...
129
click to vote
VMCAI
2005
Springer
15 years 10 months ago
2005
Springer
A Herbrand equality between expressions in a program is an equality which holds relative to the Herbrand interpretation of operators. We show that the problem of checking validity ...
128
click to vote
WEBDB
2005
Springer
15 years 10 months 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...
139
click to vote
ISSTA
2004
ACM
15 years 10 months 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...