1916 search results - page 151 / 384 » Reasoning with class algebra |
171
click to vote
TPHOL
2005
IEEE
16 years 11 hour ago
2005
IEEE
We describe a formalization of the elementary algebra, topology and analysis of finite-dimensional Euclidean space in the HOL Light theorem prover. (Euclidean space is RN with the...
176
click to vote
CSFW
2009
IEEE
15 years 10 months ago
2009
IEEE
ProVerif is one of the most successful tools for cryptographic protocol analysis. However, dealing with algebraic properties of operators such as the exclusive OR (XOR) and Diffie-...
175
click to vote
CONCUR
2009
Springer
16 years 1 months ago
2009
Springer
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
180
click to vote
CSFW
2010
IEEE
15 years 9 months ago
2010
IEEE
Nowadays it is widely accepted to formulate the security of a protocol carrying out a given task via the "trusted-party paradigm," where the protocol execution is compar...
196
click to vote
LPNMR
1995
Springer
15 years 10 months ago
1995
Springer
In this paper we propose a version of default logic with the following two properties: (1) defaults with mutually inconsistent justications are never used together in constructing ...