The algebraic eigenvalue problem
The algebraic eigenvalue problem
The computer from Pascal to von Neumann
The computer from Pascal to von Neumann
An axiomatic basis for computer programming
Communications of the ACM
Böhm and Jacopini's reduction of flow charts
Communications of the ACM
Flow diagrams, turing machines and languages with only two formation rules
Communications of the ACM
Systematic Programming: An Introduction
Systematic Programming: An Introduction
A review of "Structured Programming".
A review of "Structured Programming".
Computation: finite and infinite machines
Computation: finite and infinite machines
Human Problem Solving
Structured programming
Generalizing specifications for uniformly implemented loops
ACM Transactions on Programming Languages and Systems (TOPLAS)
Formal models of stepwise refinements of programs
ACM Computing Surveys (CSUR)
Evaluation of safety-critical software
Communications of the ACM
Evaluation criteria for functional specifications
ICSE '90 Proceedings of the 12th international conference on Software engineering
Estimating the Probability of Failure When Testing Reveals No Failures
IEEE Transactions on Software Engineering
A Markov Chain Model for Statistical Software Testing
IEEE Transactions on Software Engineering
Interactive control restructuring
SETA2 Proceedings of the second international symposium on Environments and tools for Ada
Precise Documentation of Well-Structured Programs
IEEE Transactions on Software Engineering
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communications of the ACM
A Comparative Analysis of Functional Correctness
ACM Computing Surveys (CSUR)
A generalized control structure and its formal definition
Communications of the ACM
Communications of the ACM
Communications of the ACM
Teaching good programming techniques
ACM SIGCSE Bulletin
ACM-SE 20 Proceedings of the 20th annual Southeast regional conference
Desert Island Column: The Long Story of a Short Theorem
Automated Software Engineering
Splitting the Difference: The Historical Necessity of Synthesis in Software Engineering
IEEE Annals of the History of Computing
Verifying Definite Iteration Over Data Structures
IEEE Transactions on Software Engineering
AMAST '00 Proceedings of the 8th International Conference on Algebraic Methodology and Software Technology
ICSE '84 Proceedings of the 7th international conference on Software engineering
System development techniques for small and medium size installations
SIGCPR '77 Proceedings of the fifteenth annual SIGCPR conference
Teaching programming to beginners
SIGCSE '77 Proceedings of the seventh SIGCSE technical symposium on Computer science education
A place for assembler in structured programming
SIGCSE '77 Proceedings of the seventh SIGCSE technical symposium on Computer science education
How to write correct programs and know it
Proceedings of the international conference on Reliable software
A view of program verification
Proceedings of the international conference on Reliable software
Educator's view of structured concepts
ACM '80 Proceedings of the ACM 1980 annual conference
On the failure to implement structured programming and other techniques
ACM '75 Proceedings of the 1975 annual conference
A view from the Sonnenbichl: on the historical sociology of software and system dependability
ICHC Proceedings of the international conference on History of computing: software issues
An approach to loop programs debugging
ACM SIGPLAN Notices
ACM SIGACT News
A Method for Computing the Number of Iterations in Data Dependent Loops
Real-Time Systems
Acta Cybernetica
To use or not to use the goto statement: programming styles viewed from Hoare logic
Science of Computer Programming
Polynomial approximations of the relational semantics of imperative programs
Science of Computer Programming
Algebraic specification schemes for data base systems
VLDB '78 Proceedings of the fourth international conference on Very Large Data Bases - Volume 4
Goto elimination in program algebra
Science of Computer Programming
Document based rational software development
Knowledge-Based Systems
The impact of requirements changes on specifications and state machines
Software—Practice & Experience
Harnessing a Refinement Theory to Compute Loop Functions
Electronic Notes in Theoretical Computer Science (ENTCS)
Mathematics for reasoning about loop functions
Science of Computer Programming
An axiom system for sequence-based specification
Theoretical Computer Science
Grammar characterization of flowgraphs
IBM Journal of Research and Development
Mathematical construct for program reorganization
IBM Journal of Research and Development
Relational Methods in the Analysis of While Loops: Observations of Versatility
RelMiCS '09/AKA '09 Proceedings of the 11th International Conference on Relational Methods in Computer Science and 6th International Conference on Applications of Kleene Algebra: Relations and Kleene Algebra in Computer Science
Using invariant functions and invariant relations to compute loop functions
Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 2
Reflexive transitive invariant relations: A basis for computing loop functions
Journal of Symbolic Computation
From operational to denotational demonic semantics of nondeterministic while loops
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
A hoare calculus for the verification of synchronous languages
PLPV '12 Proceedings of the sixth workshop on Programming languages meets program verification
Software engineering: multi-person development of multi-version programs
Dependable and Historic Computing
Structured flowcharts for multiprocessing
Computer Languages
Invariant functions and invariant relations: An alternative to invariant assertions
Journal of Symbolic Computation
Invariant relations, invariant functions, and loop functions
Innovations in Systems and Software Engineering
FASE'13 Proceedings of the 16th international conference on Fundamental Approaches to Software Engineering
Applying string-rewriting to sequence-based specification
Formal Methods in System Design
| Hi-index | 48.30 |
Structured programming has proved to be an important methodology for systematic program design and development. Structured programs are identified as compound function expressions in the algebra of functions. The algebraic properties of these function expressions permit the reformulation (expansion as well as reduction) of a nested subexpression independently of its environment, thus modeling what is known as stepwise program refinement as well as program execution. Finally, structured programming is characterized in terms of the selection and solution of certain elementary equations defined in the algebra of functions. These solutions can be given in general formulas, each involving a single parameter, which display the entire freedom available in creating correct structured programs.