Sciweavers

2514 search results - page 214 / 503
» The use of industrial-strength formal methods
Sort
View
IJNSEC
2007
121views more  IJNSEC 2007»
15 years 6 months ago
Injecting Heterogeneity Through Protocol Randomization
In this paper, we argue that heterogeneity should be an important principle in design and use of cryptographic protocols. We use automated formal analysis tools to randomly genera...
Li Zhuang, J. D. Tygar, Rachna Dhamija
FMSD
2000
86views more  FMSD 2000»
15 years 6 months ago
Verifying Temporal Properties of Reactive Systems: A STeP Tutorial
We review a number of formal verification techniques supported by STeP, the Stanford Temporal Prover, describing how the tool can be used to verify properties of several versions o...
Nikolaj Bjørner, Anca Browne, Michael Col&o...
SDM
2010
SIAM
213views Data Mining» more  SDM 2010»
15 years 8 months ago
Spectral Analysis of Signed Graphs for Clustering, Prediction and Visualization
We study the application of spectral clustering, prediction and visualization methods to graphs with negatively weighted edges. We show that several characteristic matrices of gra...
Jérôme Kunegis, Stephan Schmidt, Andr...
FMSD
2006
103views more  FMSD 2006»
15 years 6 months ago
Cones and foci: A mechanical framework for protocol verification
We define a cones and foci proof method, which rephrases the question whether two system specifications are branching bisimilar in terms of proof obligations on relations between ...
Wan Fokkink, Jun Pang, Jaco van de Pol
LOGCOM
2002
105views more  LOGCOM 2002»
15 years 6 months ago
Labelled Tableaux for Nonmonotonic Reasoning: Cumulative Consequence Relations
In this paper we present a labelled proof method for computing nonmonotonic consequence relations in a conditional logic setting. The method exploits the strong connection between...
Alberto Artosi, Guido Governatori, Antonino Rotolo