Sciweavers

265 search results - page 45 / 53
» entcs 2007
Sort
View
96
Voted
ENTCS
2007
158views more  ENTCS 2007»
14 years 10 months ago
Abstraction and Completeness for Real-Time Maude
ion and Completeness for Real-Time Maude Peter Csaba ¨Olveczky a,b and Jos´e Meseguer b a Department of Informatics, University of Oslo b Department of Computer Science, Universi...
Peter Csaba Ölveczky, José Meseguer
ENTCS
2007
89views more  ENTCS 2007»
14 years 10 months ago
Weak Probabilistic Anonymity
Abstract. Anonymity means that the identity of the user performing a certain action is maintained secret. The protocols for ensuring anonymity often use random mechanisms which can...
Yuxin Deng, Catuscia Palamidessi, Jun Pang
ENTCS
2007
114views more  ENTCS 2007»
14 years 10 months ago
Parametric Performance Contracts for Software Components with Concurrent Behaviour
Performance prediction methods for component-based software systems aim at supporting design decisions of software architects during early development stages. With the increased a...
Jens Happe, Heiko Koziolek, Ralf Reussner
ENTCS
2007
143views more  ENTCS 2007»
14 years 10 months ago
Formal Fault Tree Analysis - Practical Experiences
Safety is an important requirement for many modern systems. To ensure safety of complex critical systems, well-known safety analysis methods have been formalized. This holds in pa...
Frank Ortmeier, Gerhard Schellhorn
ENTCS
2007
121views more  ENTCS 2007»
14 years 10 months ago
Incremental Parametric Development of Greedy Algorithms
The event B method provides a general framework for modelling both data structures and algorithms. B models are validated by discharging proof obligations ensuring safety properti...
Dominique Cansell, Dominique Méry