Sciweavers

265 search results - page 34 / 53
» How to Prove Inductive Theorems
Sort
View
CRYPTO
2007
Springer
116views Cryptology» more  CRYPTO 2007»
14 years 1 months ago
Random Oracles and Auxiliary Input
We introduce a variant of the random oracle model where oracle-dependent auxiliary input is allowed. In this setting, the adversary gets an auxiliary input that can contain informa...
Dominique Unruh
ICECCS
2005
IEEE
136views Hardware» more  ICECCS 2005»
14 years 1 months ago
Model-Based Design and Analysis of Permission-Based Security
To guarantee the security of computer systems, it is necessary to define security permissions to restrict the access to the systems’ resources. These permissions rely on certai...
Jan Jürjens, Markus Lehrhuber, Guido Wimmel
CP
2003
Springer
14 years 27 days ago
Propagation Redundancy in Redundant Modelling
Combining mutually redundant models with channelling constraints increases constraint propagation. However, the extra computation efforts of the additional variables and constraint...
Chiu Wo Choi, Jimmy Ho-Man Lee, Peter J. Stuckey
LICS
2000
IEEE
14 years 2 days ago
Complete Axioms for Categorical Fixed-Point Operators
We give an axiomatic treatment of fixed-point operators in categories. A notion of iteration operator is defined, embodying the equational properties of iteration theories. We p...
Alex K. Simpson, Gordon D. Plotkin
CAISE
1999
Springer
13 years 12 months ago
Modeling Dynamic Domains with ConGolog
In this paper, we describe the process specification language ConGolog and show how it can be used to model business processes for requirements analysis. In ConGolog, the effects...
Yves Lespérance, Todd G. Kelley, John Mylop...