Sciweavers

23 search results - page 4 / 5
» lpar 2007
Sort
View
LPAR
2007
Springer
14 years 1 months ago
Operational and Epistemic Approaches to Protocol Analysis: Bridging the Gap
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...
Francien Dechesne, Mohammad Reza Mousavi, Simona O...
LPAR
2007
Springer
14 years 1 months ago
Decidable Fragments of Many-Sorted Logic
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...
Aharon Abadi, Alexander Moshe Rabinovich, Mooly Sa...
LPAR
2007
Springer
14 years 1 months ago
Extending a Resolution Prover for Inequalities on Elementary Functions
Abstract. Experiments show that many inequalities involving exponentials and logarithms can be proved automatically by combining a resolution theorem prover with a decision procedu...
Behzad Akbarpour, Lawrence C. Paulson
LPAR
2007
Springer
14 years 1 months ago
Deciding Knowledge in Security Protocols for Monoidal Equational Theories
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...
Véronique Cortier, Stéphanie Delaune
LPAR
2007
Springer
14 years 1 months ago
Completeness and Decidability in Sequence Logic
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...
Marc Bezem, Tore Langholm, Michal Walicki