233 search results - page 43 / 47 » Applications of Polytypism in Theorem Proving |
CCS
2006
ACM
15 years 1 months ago
2006
ACM
We address the problem of replaying an application dialog between two hosts. The ability to accurately replay application dialogs is useful in many security-oriented applications,...
STOC
2006
ACM
15 years 9 months ago
2006
ACM
Gowers [Gow98, Gow01] introduced, for d 1, the notion of dimension-d uniformity Ud (f) of a function f : G C, where G is a finite abelian group. Roughly speaking, if a function ...
113
click to vote
MCMASTER
1993
15 years 1 months ago
1993
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...
MICAI
2000
Springer
15 years 1 months ago
2000
Springer
Unique Fixpoint Induction, UFI, is a chief inference rule to prove the equivalence of recursive processes in CCS [7]. It plays a major role in the equational approach to verificati...
JFP
2000
14 years 9 months ago
2000
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...