A calculus of refinements for program derivations

Back, Ralph-Johan

doi:10.1007/bf00291051

Cited by 211 publications

(97 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Some well-known approaches to constructing correct programs are: -specify a problem by means of pre-and post-conditions, and then calculate a program from the specification, or provide an implementation and prove that the implementation satisfies the specification [Hoare, 1969, Dijkstra, 1975, -refine a specification by means of refinement rules until an executable program is obtained [Back, 1987, Morgan, 1990, -specify a problem by means of a simple but possibly very inefficient program, and transform it to an efficient program using semantics-preserving transformation rules [Bird, 1987, Meertens, 1986]. …”

Section: Strategies In Functional Programmingmentioning

confidence: 99%

A Programming Tutor for Haskell

Jeuring

Gerdes

Heeren

2012

Central European Functional Programming School

View full text Add to dashboard Cite

Section: Strategies In Functional Programmingmentioning

confidence: 99%

A Programming Tutor for Haskell

Jeuring

Gerdes

Heeren

2012

Central European Functional Programming School

View full text Add to dashboard Cite

“…This proposal is applicable to a product line where all components are defined at the same level of abstraction, and there are no variability constraints. The generative feature-oriented programming approach of [9] is built on a notion of refinement whose meaning is closer to object-oriented extension, or inheritance, rather than the classical refinement of Hoare, He, Back et al [24,7,8].…”

Section: Related Work In Contextmentioning

confidence: 99%

Rigorous engineering of product-line requirements: A case study in failure management

Snook

Poppleton

Johnson³

2008

Information and Software Technology

View full text Add to dashboard Cite

We consider the failure detection and management function for engine control systems as an application domain where product line engineering is indicated. The need to develop a generic requirement set -for subsequent system instantiation -is complicated by the addition of the high levels of verification demanded by this safety-critical domain, subject to avionics industry standards. We present our case study experience in this area as a candidate method for the engineering, validation and verification of generic requirements using domain engineering and Formal Methods techniques and tools. For a defined class of systems, the case study produces a generic requirement set in UML and an example system instance. Domain analysis and engineering produce a validated model which is integrated with the formal specification/ verification method B by the use of our UML-B profile. The formal verification both of the generic requirement set, and of a simple system instance, is demonstrated using our U2B, ProB and prototype Requirements Manager tools. This work is a demonstrator for a tool-supported method which will be an output of EU project RODIN 1 . The use of existing and prototype formal verification and support tools is discussed. The method, developed in application to this novel combination of product line, failure management and safety-critical engineering, is evaluated and considered to be applicable to a wide range of domains.

show abstract

“…Here we use an example --List Merge [14], which contains considerable inefficiencies: out:=Nil; do ""Clv-,C2 ~ ifC2v(""C1A-,C2A-,C3) ~ SID -,C2A(ClvC2vC3) ~ S2ft od where Ci=(inj=Nil), Si=(out:=out++ini.head; inj=inj.tail) for ie [1,2], and C3=(inl.headS; in2·head). Using strongest postcondition calculations.…”

Section: Loop Normajlzationmentioning

confidence: 99%

“…Recently a number of authors [1.3,15] have studied the calculation of the strongest postcondition of a program statement S satisfying a precondition P~ Calculation of postconditions has applications in program verification [15). quality improvement [1,15]. deriving specifications from programs [15] and quality measurement [16].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Using Strongest Postconditions to Improve Software Quality

Pan

Dromey

1995

Software Quality and Productivity

View full text Add to dashboard Cite

The cost of developing and maintaining high quality software remains at a premium. In this paper we introduce a practical approach for enhancement of software quality. based on calculation of strongest postconditions of program components. The method provides a powerful means for detecting and removing by transformation various forms of redundancy and inconsistency in programs. The feasibility of this approach depends upon calculations of strongest postconditions for iterative constructs and assignments.

show abstract

A calculus of refinements for program derivations

Cited by 211 publications

References 20 publications

A Programming Tutor for Haskell

A Programming Tutor for Haskell

Rigorous engineering of product-line requirements: A case study in failure management

Using Strongest Postconditions to Improve Software Quality

Contact Info

Product

Resources

About