23 search results - page 4 / 5 » lpar 2007 |
145
click to vote
LPAR
2007
Springer
15 years 10 months ago
2007
Springer
Operational models of (security) protocols, on one hand, are readable and conveniently match their implementation (at a certain abstraction level). Epistemic models, on the other h...
132
click to vote
LPAR
2007
Springer
15 years 10 months ago
2007
Springer
We investigate the possibility of developing a decidable logic which allows expressing a large variety of real world specifications. The idea is to define a decidable subset of m...
121
click to vote
LPAR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Experiments show that many inequalities involving exponentials and logarithms can be proved automatically by combining a resolution theorem prover with a decision procedu...
130
click to vote
LPAR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. In formal approaches, messages sent over a network are usually modeled by terms together with an equational theory, axiomatizing the properties of the cryptographic funct...
143
click to vote
LPAR
2007
Springer
15 years 10 months ago
2007
Springer
Sequence logic is a parameterized logic where the formulas are sequences of formulas of some arbitrary underlying logic. The sequence formulas are interpreted in certain linearly o...