Sciweavers

5255 search results - page 488 / 1051
» Formal Methods for Privacy
Sort
View
COMBINATORICS
2004
112views more  COMBINATORICS 2004»
15 years 6 months ago
Airy Phenomena and Analytic Combinatorics of Connected Graphs
Until now, the enumeration of connected graphs has been dealt with by probabilistic methods, by special combinatorial decompositions or by somewhat indirect formal series manipula...
Philippe Flajolet, Bruno Salvy, Gilles Schaeffer
COMCOM
2000
97views more  COMCOM 2000»
15 years 6 months ago
Verification of security protocols using LOTOS-method and application
We explain how the formal language LOTOS can be used to specify security protocols and cryptographic operations. We describe how security properties can be modelled as safety prop...
Guy Leduc, François Germeau
FMSD
2002
128views more  FMSD 2002»
15 years 6 months ago
Combining Software and Hardware Verification Techniques
Combining verification methods developed separately for software and hardware is motivated by the industry's need for a technology that would make formal verification of reali...
Robert P. Kurshan, Vladimir Levin, Marius Minea, D...
CORR
2010
Springer
178views Education» more  CORR 2010»
15 years 5 months ago
Towards A Shape Analysis for Graph Transformation Systems
Graphs and graph transformation systems are a frequently used modelling technique for a wide range of different domains, covering areas as diverse as refactorings, network topolog...
Dominik Steenken, Heike Wehrheim, Daniel Wonisch
IFM
2010
Springer
152views Formal Methods» more  IFM 2010»
15 years 5 months ago
Satisfaction Meets Expectations - Computing Expected Values of Probabilistic Hybrid Systems with SMT
Stochastic satisfiability modulo theories (SSMT), which is an extension of satisfiability modulo theories with randomized quantification, has successfully been used as a symboli...
Martin Fränzle, Tino Teige, Andreas Eggers