2152 search results - page 162 / 431 » On Automating the Calculus of Relations |
179
click to vote
CCS
1998
ACM
15 years 10 months ago
1998
ACM
We develop a framework for analyzing security protocols in which protocol adversaries may be arbitrary probabilistic polynomial-time processes. In this framework, protocols are wr...
179
click to vote
ENTCS
2007
15 years 6 months ago
2007
In the context of process algebras it is customary to define semantics in the form of a reaction relation supported by a structural congruence relation. Recently process algebras...
161
click to vote
POPL
2010
ACM
16 years 3 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
132
click to vote
BIRTHDAY
2009
Springer
16 years 1 months ago
2009
Springer
In previous work, we proposed a modal fragment of the situation calculus called ES, which fully captures Reiter’s basic action theories. ES also has epistemic features, includin...
172
click to vote
MKM
2009
Springer
16 years 29 days ago
2009
Springer
Abstract. One of the fundamental and seemingly simple aims of mathematical knowledge management (MKM) is to develop and standardize formats that allow to “represent the meaning o...