Sciweavers

IWFM
2003
172views Formal Methods» more  IWFM 2003»
14 years 27 days ago
On Continuous Models of Computation: Towards Computing the Distance Between (Logic) Programs
We present a report on work in progress on certain aspects of a programme of research concerned with building formal, mathematical models both for aspects of the computational pro...
Anthony Karel Seda, Máire Lane
IWFM
2003
123views Formal Methods» more  IWFM 2003»
14 years 27 days ago
Logic for Computational Effects: Work in Progress
We outline a possible logic that will allow us to give a unified approach to reasoning about computational effects. The logic is given by extending Moggi’s computational λ-cal...
Gordon D. Plotkin, John Power
IWFM
2003
14 years 27 days ago
Using Admissible Interference to Detect Denial of Service Vulnerabilities
Meadows recently proposed a formal cost-based framework for analysis of denial of service. It was showed how some principles that have already been used to make cryptographic prot...
Stéphane Lafrance, John Mullins
IWFM
2003
123views Formal Methods» more  IWFM 2003»
14 years 27 days ago
Derivation of Distributed Programs in the Theory of Owicki and Gries: An Example
This paper describes the derivation of a program for the propagation of information over a network, with acknowledgement (feedback) when the computation is complete. The derivatio...
Doug Goldson
IWFM
2003
104views Formal Methods» more  IWFM 2003»
14 years 27 days ago
Stepwise Development of Peer-to-Peer Systems
Peer-to-peer systems like Napster, Gnutella and Kazaa have recently become popular for sharing information. In this paper, we show how to design peer-to-peer systems within the ac...
Lu Yan, Kaisa Sere