Sciweavers

70 search results - page 9 / 14
» Algebraic Intruder Deductions
Sort
View
JAR
2006
97views more  JAR 2006»
13 years 7 months ago
Decidability Issues for Extended Ping-Pong Protocols
We use some recent techniques from process algebra to draw several conclusions about the well studied class of ping-pong protocols introduced by Dolev and Yao. In particular we sho...
Hans Hüttel, Jirí Srba
BIRTHDAY
2009
Springer
14 years 2 months ago
An Action Semantics Based on Two Combinators
We propose a naive version of action semantics that begins with a selection of “transient” and “persistent” facets, each characterized as a partial monoid. Yielders are de...
Kyung-Goo Doh, David A. Schmidt
AC
1992
Springer
13 years 12 months ago
Logic and Databases
Logic and databases have gone a long way together since the advent of relational databases. Already the rst basic query languages for relational databases beside relational algebra...
Johann Eder
CSFW
2010
IEEE
13 years 11 months ago
Automating Open Bisimulation Checking for the Spi Calculus
We consider the problem of automating open bisimulation checking for the spi-calculus, an extension of the pi-calculus with cryptographic primitives. The notion of open bisimulatio...
Alwen Tiu, Jeremy E. Dawson
CASC
2009
Springer
180views Mathematics» more  CASC 2009»
13 years 9 months ago
Effective Quantifier Elimination for Presburger Arithmetic with Infinity
We consider Presburger arithmetic extended by infinity. For this we give an effective quantifier elimination and decision procedure which implies also the completeness of our exten...
Aless Lasaruk, Thomas Sturm