Sciweavers

1199 search results - page 161 / 240
» Parameterized Proof Complexity
Sort
View
CCS
2003
ACM
14 years 2 months ago
Secure protocol composition
This paper continues the program initiated in [5], towards a derivation system for security protocols. The general idea is that complex protocols can be formally derived, starting...
Anupam Datta, Ante Derek, John C. Mitchell, Dusko ...
FM
2003
Springer
160views Formal Methods» more  FM 2003»
14 years 2 months ago
Translation-Based Compositional Reasoning for Software Systems
Software systems are often model checked by translating them into a directly model-checkable formalism. Any serious software system requires application of compositional reasoning ...
Fei Xie, James C. Browne, Robert P. Kurshan
SP
1998
IEEE
106views Security Privacy» more  SP 1998»
14 years 1 months ago
Understanding Java Stack Inspection
Current implementations of Java make security decisions by searching the runtime call stack. These systems have attractive security properties, but they have been criticized as be...
Dan S. Wallach, Edward W. Felten
ESOP
2006
Springer
14 years 16 days ago
Step-Indexed Syntactic Logical Relations for Recursive and Quantified Types
We present a sound and complete proof technique, based on syntactic logical relations, for showing contextual equivalence of expressions in a -calculus with recursive types and imp...
Amal J. Ahmed
GECCO
2010
Springer
173views Optimization» more  GECCO 2010»
14 years 16 days ago
The baldwin effect in developing neural networks
The Baldwin Effect is a very plausible, but unproven, biological theory concerning the power of learning to accelerate evolution. Simple computational models in the 1980’s gave...
Keith L. Downing