Modelling Jackson's programming method

DOI10.1016/0167-6423(93)90013-FMaRDI QIDQ1261491zbMATH OpenOpenAlexFDO

Authors F. Vivarès

Publication date 16 September 1993

Published in Science of Computer Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6423(93)90013-f

zbMATH Keywords

diagramsJackson's treessequential programsspecification

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Review text

A modeling scheme for programming methods is presented. The main idea is to represent the structure of sequential programs by structured diagrams which are Jackson's trees based on basic data. Thus program structures are modeled with triangular systems on rational expressions. Their properties are then studied. More precisely, it is shown how to support a formal development, how to automatize the entire thing, and how to build a formal specification within the scope of a concrete model. The model mainly concerns the building of a program satisfying a specification. Muchmore, it is shown how to adopt the development to the given problem, specifically in clash situations where particular transformations are given.

Recommendations

• On the conversion of program specifications into pseudo code using Jackson structured programming
• scientific article; zbMATH DE number 1878568
• scientific article; zbMATH DE number 1206050

Cited in

(4)

• A method and a language for constructing iterative programs
• On the conversion of program specifications into pseudo code using Jackson structured programming
• scientific article; zbMATH DE number 43041 (Why is no real title available?)
• scientific article; zbMATH DE number 41122 (Why is no real title available?)

This page was built for publication: Modelling Jackson's programming method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1261491)