Formalization of storage properties

Bekic, Hans; Walk, Kurt

doi:10.1007/bfb0059692

Cited by 16 publications

(3 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…43 In fact [Luc72] (there was also an internal paper by Lucas and Walk in 1969) employs the same idea of presenting operations by their relationships and this even uses stacks as an example! Lucas's papers were less developed than the citations above, but it is also interesting to note that what might be considered to be a huge model -the VDL definition of the PL/I programming language-characterized its storage component by axioms (the most accessible source for this material, with references to the 1969 version of the PL/I definition, is [BW71]). [Jon72] also uses a correctness notion which rests on preserving relevant properties.…”

Section: Abstract Data Structuresmentioning

confidence: 99%

The early search for tractable ways of reasoning about programs

Jones

2003

IEEE Annals Hist. Comput.

View full text Add to dashboard Cite

This paper traces the important steps in the history-up to around 1990-of research on reasoning about programs. The main focus is on sequential imperative programs but some comments are made on concurrency. Initially, researchers focussed on ways of verifying that a program satisfies its specification (or that two programs were equivalent). Over time it became clear that post facto verification is only practical for small programs and attention turned to verification methods which support the development of programs; for larger programs it is necessary to exploit a notation of compositionality. Coping with concurrent algorithms is much more challenging-this and other extensions are considered briefly. The main thesis of this paper is that the idea of reasoning about programs has been around since they were first written; the search has been to find tractable methods.

show abstract

Section: Abstract Data Structuresmentioning

confidence: 99%

The early search for tractable ways of reasoning about programs

Jones

2003

IEEE Annals Hist. Comput.

View full text Add to dashboard Cite

show abstract

“…The Vienna group used an implicit or axiomatic characterization of their storage model to capture this. The initial work was done in the mid-60s but is most easily read about in [10] which tackles a more general storage model.…”

Section: Introductionmentioning

confidence: 99%

Scientific Decisions which Characterize VDM

Jones

1999

Lecture Notes in Computer Science

View full text Add to dashboard Cite

The formal description and development method known as VDM has been used extensively, its specification language is now an ISO standard, and it has influenced other specification languages. The origins of VDM are normally placed in language description or semantics but it is probably best known in the wider arena of formal methods for (general) program specification and design. This paper sets out a personal view of some of the key technical decisions which characterize the Vienna Development Method.1 The papers identified here as important not only represent a personal choice but their selection hass also been influenced by accessibility.

show abstract

“…6) If 'a name cannot be assigned a final value under(4) or(5), there are rules for transforming a string into. its intermediate value.…”

mentioning

confidence: 99%