Sciweavers

1716 search results - page 189 / 344
» Proving Conditional Termination
Sort
View
DSOM
2005
Springer
16 years 15 days ago
Design and Implementation of Performance Policies for SMS Systems
We present a design for policy-based performance management of SMS Systems. The design takes as input the operator’s performance goals, which are expressed as policies that can b...
Alberto Gonzalez Prieto, Rolf Stadler
166
Voted
IMA
2005
Springer
85views Cryptology» more  IMA 2005»
16 years 14 days ago
The Physically Observable Security of Signature Schemes
In recent years much research has been devoted to producing formal models of security for cryptographic primitives and to designing schemes that can be proved secure in such models...
Alexander W. Dent, John Malone-Lee
PODC
2004
ACM
16 years 11 days ago
Computation in networks of passively mobile finite-state sensors
We explore the computational power of networks of small resource-limited mobile agents. We define two new models of computation based on pairwise interactions of finite-state ag...
Dana Angluin, James Aspnes, Zoë Diamadi, Mich...
181
Voted
ECAI
2004
Springer
16 years 10 days ago
New Insights on the Intuitionistic Interpretation of Default Logic
In this work we further investigate the relation, first found by Truszczy´nski, between modal logic S4F and Default Logic (DL), analyzing some interesting properties and showing ...
Pedro Cabalar, David Lorenzo
208
Voted
FM
2003
Springer
115views Formal Methods» more  FM 2003»
16 years 5 days ago
Model Checking FTA
Safety is increasingly important for software based, critical systems. Fault tree analysis (FTA) is a safety technique from engineering, developed for analyzing and assessing syste...
Andreas Thums, Gerhard Schellhorn