Applications of Boolean matrices to the analysis of flow diagrams

Authors:
Reese T. Prosser
Affiliations:
Massachusetts Institute of Technology Lincoln Laboratory, Lexington, Mass.
Venue:
IRE-AIEE-ACM '59 (Eastern) Papers presented at the December 1-3, 1959, eastern joint IRE-AIEE-ACM computer conference
Year:
1959

Citing 2
Cited 9

A New Method of Checking the Consistency of Precedence Matrices

Journal of the ACM (JACM)
A Mathematical Theory of Communication

A Mathematical Theory of Communication

A Dynamic Memory Allocation Algorithm

IEEE Transactions on Computers
On Static Memory Allocation in Computer Systems

IEEE Transactions on Computers
An approach for extracting a small unsatisfiable core

Formal Methods in System Design
Automatic structuring of programs

IBM Journal of Research and Development
Exploiting shared structure in software verification conditions

HVC'07 Proceedings of the 3rd international Haifa verification conference on Hardware and software: verification and testing
Doomed program points

Formal Methods in System Design
From exponential to polynomial-time security typing via principal types

ESOP'11/ETAPS'11 Proceedings of the 20th European conference on Programming languages and systems: part of the joint European conferences on theory and practice of software
Deriving small unsatisfiable cores with dominators

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Calculating graph algorithms for dominance and shortest path

MPC'12 Proceedings of the 11th international conference on Mathematics of Program Construction

Quantified Score

Hi-index	0.01

Visualization

Abstract

Any serious attempt at automatic programming of large-scale digital computing machines must provide for some sort of analysis of program structure. Questions concerning order of operations, location and disposition of transfers, identification of subroutines, internal consistency, redundancy and equivalence, all involve a knowledge of the structure of the program under study, and must be handled effectively by any automatic programming system.