Sciweavers

923 search results - page 75 / 185
» Proving the value of formal methods
Sort
View
TYPES
1994
Springer
15 years 10 months ago
A Concrete Final Coalgebra Theorem for ZF Set Theory
A special final coalgebra theorem, in the style of Aczel's [2], is proved within standard Zermelo-Fraenkel set theory. Aczel's AntiFoundation Axiom is replaced by a varia...
Lawrence C. Paulson
CSFW
2012
IEEE
13 years 8 months ago
Verifying Privacy-Type Properties in a Modular Way
—Formal methods have proved their usefulness for analysing the security of protocols. In this setting, privacy-type security properties (e.g. vote-privacy, anonymity, unlinkabili...
Myrto Arapinis, Vincent Cheval, Stéphanie D...
TKDE
2012
212views Formal Methods» more  TKDE 2012»
13 years 8 months ago
Segmentation and Sampling of Moving Object Trajectories Based on Representativeness
—Moving Object Databases (MOD), although ubiquitous, still call for methods that will be able to understand, search, analyze, and browse their spatiotemporal content. In this pap...
Costas Panagiotakis, Nikos Pelekis, Ioannis Kopana...
DAGM
2009
Springer
16 years 21 days ago
A Closed-Form Solution for Image Sequence Segmentation with Dynamical Shape Priors
In this paper, we address the problem of image sequence segmentation with dynamical shape priors. While existing formulations are typically based on hard decisions, we propose a fo...
Frank R. Schmidt, Daniel Cremers
CSFW
2006
IEEE
16 years 6 days ago
Computationally Sound Compositional Logic for Key Exchange Protocols
We develop a compositional method for proving cryptographically sound security properties of key exchange protocols, based on a symbolic logic that is interpreted over conventiona...
Anupam Datta, Ante Derek, John C. Mitchell, Bogdan...