Sciweavers

923 search results - page 68 / 185
» Proving the value of formal methods
Sort
View
FM
2003
Springer
115views Formal Methods» more  FM 2003»
15 years 11 months 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
APAL
2010
141views more  APAL 2010»
15 years 6 months ago
Locatedness and overt sublocales
Locatedness is one of the fundamental notions in constructive mathematics. The existence of a positivity predicate on a locale, i.e. the locale being overt, or open, has proved to ...
Bas Spitters
HICSS
2002
IEEE
130views Biometrics» more  HICSS 2002»
15 years 11 months ago
A Set Theory Based Approach on Applying Domain Semantics to XML Structures
As XML is gathering more and more importance in the field of data interchange in distributed business to business (B2B) applications, it is increasingly important to provide a for...
Wolfgang Schuetzelhofer, Karl M. Göschka
MDM
2009
Springer
102views Communications» more  MDM 2009»
16 years 20 days ago
Privacy-Aware Proximity Based Services
Proximity based services are location based services (LBS) in which the service adaptation depends on the comparison between a given threshold value and the distance between a use...
Sergio Mascetti, Claudio Bettini, Dario Freni, Xia...
ICALP
2005
Springer
15 years 11 months ago
Probabilistic Polynomial-Time Semantics for a Protocol Security Logic
Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...
Anupam Datta, Ante Derek, John C. Mitchell, Vitaly...