Results 1 
5 of
5
Requirements for a Program Refinement Engine
 PATTER RECOGNITION LETTERS
, 1995
"... Refinement is a mathematicallybased technique for developing a program from an abstract specification so that the program satisfies the specification. The aim of the Program Refinement Tool project is to develop a generic refinement tool suitable for supporting a methodology for the interactive ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Refinement is a mathematicallybased technique for developing a program from an abstract specification so that the program satisfies the specification. The aim of the Program Refinement Tool project is to develop a generic refinement tool suitable for supporting a methodology for the interactive development of programs based on the refinement calculus. This report summarizes our investigation into an appropriate engine to use for the refinement calculator and theorem prover in this tool.
Added entries
, 1202
"... Flash filestores have a variety of unique features that lead to interesting design constraints. One challenge is that of ensuring that each block of the drive is used and erased evenly, known as "wearlevelling". This paper presents a novel approach to the analysis of wearlevelling algori ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Flash filestores have a variety of unique features that lead to interesting design constraints. One challenge is that of ensuring that each block of the drive is used and erased evenly, known as "wearlevelling". This paper presents a novel approach to the analysis of wearlevelling algorithms using probabilistic specification and analysis techniques. A simplified version of the wearlevelling algorithm used in the JFFS flash filestore is used as an illustration. The expected lifetime of a flash filestore implementing such an algorithm is derived using probabilistic proof techniques. © 2010 University of Newcastle upon Tyne. Printed and published by the University of Newcastle upon Tyne,
Deriving Predicate Transformer Semantics for pGCL from its Direct Semantics
"... In [McM] McIver and Morgan have introduced pGCL, an imperative programming language with guarded command incorporating both erratic and probabilistic nondeterminism. For verifying pGCL programs they associate with every pGCL program P a predicate transformer wp(P) : E(S) → E(S) where S is a countab ..."
Abstract
 Add to MetaCart
(Show Context)
In [McM] McIver and Morgan have introduced pGCL, an imperative programming language with guarded command incorporating both erratic and probabilistic nondeterminism. For verifying pGCL programs they associate with every pGCL program P a predicate transformer wp(P) : E(S) → E(S) where S is a countable set of states and E(S) = [0, 1] S ordered pointwise. We show how to derive McIver and Morgan’s predicate transformer semantics from a more intuitive direct semantics associating with every progrem P a function [[P]] : S → PU (V(S)) where PU is the upper (or Smyth) powerdomain and V(S) the probabilistic powerdomain of S ⊥ which for convenience can be identified with the set of function µ: S → [0, 1] with ∑ s∈S µ(s) ≤ 1 (of course, for A ⊆ S we define µ(A) as ∑ s∈A µ(s)). Following a suggestion in [TKP] we define for f: S → PU (V(S) its associated
Title of Deliverable: Prinsys—on a Quest for Probabilistic Loop Invariants Contractual Date of Delivery to the CEC: 30Sep2013 Actual Date of Delivery to the CEC: 30Sep2013
, 2013
"... Prinsys (pronounced “princess”) is a new softwaretool for probabilistic invariant synthesis. In this paper we discuss its implementation and improvements of the methodology which was set out in previous work. In particular we have substantially simplified the method and generalised it to nonlinea ..."
Abstract
 Add to MetaCart
(Show Context)
Prinsys (pronounced “princess”) is a new softwaretool for probabilistic invariant synthesis. In this paper we discuss its implementation and improvements of the methodology which was set out in previous work. In particular we have substantially simplified the method and generalised it to nonlinear programs and invariants. Prinsys follows a constraintbased approach. A given parameterised loop annotation is speculatively placed in the program. The tool returns a formula that captures precisely the invariant instances of the given candidate. Our approach is sound and complete. Prinsys’s applicability is evaluated on several examples. We believe the tool contributes to the successful analysis of sequential probabilistic programs with infinitedomain variables and parameters. Note: This deliverable is based on material that has been published in QEST’13 Springer LNCS 8054: pp.193–208.
CENTRO DE INFORM ÁTICA
, 2002
"... This work was presented to the Msc programme in ..."
(Show Context)