13383 search results - page 150 / 2677 » Abstractions from proofs |
264
click to vote
PPSWR
2005
Springer
15 years 11 months ago
2005
Springer
We present typing rules for the Web query language Xcerpt. The rules provide a descriptive type system: the typing of a program is an ation of its semantics. The rules can also be ...
145
click to vote
IFIP
2004
Springer
15 years 11 months ago
2004
Springer
Abstract The computational proof model of Bellare and Rogaway for cryptographic protocol analysis is complemented by providing a formal specification of the actions of the adversa...
174
click to vote
RTA
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. In this paper it is described how a combination of polynomial interpretations, recursive path order, RFC match-bounds, the dependency pair method and semantic labelling c...
181
click to vote
RTA
2010
Springer
15 years 10 months ago
2010
Springer
This paper shows the equivalence of applicative similarity and contextual approximation, and hence also of bisimilarity and contextual equivalence, in the deterministic call-by-nee...
178
click to vote
TABLEAUX
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. In this paper we present a labelled proof method for computing nonmonotonic consequence relations in a conditional logic setting. The method is based on the usual possibl...