Sciweavers

253 search results - page 29 / 51
» How to Transform an Analyzer into a Verifier
Sort
View
QEST
2006
IEEE
15 years 6 months ago
Compositional Performability Evaluation for STATEMATE
Abstract— This paper reports on our efforts to link an industrial state-of-the-art modelling tool to academic state-of-the-art analysis algorithms. In a nutshell, we enable timed...
Eckard Böde, Marc Herbstritt, Holger Hermanns...
81
Voted
INFOCOM
2005
IEEE
15 years 6 months ago
On static reachability analysis of IP networks
The primary purpose of a network is to provide reachability between applications running on end hosts. In this paper, we describe how to compute the reachability a network provide...
Geoffrey G. Xie, Jibin Zhan, David A. Maltz, Hui Z...
IFM
2004
Springer
104views Formal Methods» more  IFM 2004»
15 years 5 months ago
Linking CSP-OZ with UML and Java: A Case Study
Abstract. We describe how CSP-OZ, an integrated formal method combining the process algebra CSP with the specification language Object-Z, can be linked to standard software engine...
Michael Möller, Ernst-Rüdiger Olderog, H...
UML
1998
Springer
15 years 4 months ago
The UML as a Formal Modeling Notation
The Uni ed Modeling Language UML is rapidly emerging as a de-facto standard for modelling OO systems. Given this role, it is imperative that the UML needs a well-de ned, fully expl...
Andy Evans, Robert B. France, Kevin Lano, Bernhard...
ASIACRYPT
2009
Springer
15 years 4 months ago
Proofs of Storage from Homomorphic Identification Protocols
Proofs of storage (PoS) are interactive protocols allowing a client to verify that a server faithfully stores a file. Previous work has shown that proofs of storage can be constru...
Giuseppe Ateniese, Seny Kamara, Jonathan Katz