article

Free access

Using graphs to analyze APL functions

Author:

Robert MetzgerAuthors Info & Claims

ACM SIGAPL APL Quote Quad, Volume 13, Issue 3

Pages 153 - 161

https://doi.org/10.1145/390005.801211

Published: 01 March 1983 Publication History

PDF eReader

Abstract

The purpose of this paper is to show how graphs can be used to analyze APL functions. Several kinds of graphs are introduced. In each case, APL functions which generate matrix representations of these graphs derived from APL programs are presented. Then, APL functions which compute measures of the quality of a program based upon these graphs are suggested.

References

[1]

BERNECKY, R. and IVERSON, K. E. "Operators and Enclosed Arrays," Proceedings of the 1980 APL Users Meeting, I.P. Sharp Associates, Ltd., Toronto, 1980.

Google Scholar

[2]

BLAAUW, G.A. and DUIJVESTIN, A.J.W. "The Use of the Inner Product Operator of APL in Graph Applications," APL 80, North Holland Publishing Co., Amsterdam, 1980.

Google Scholar

[3]

BERZTISS, A. T. Data Structures—Theory and Practice, Academic Press, New York, 1975.

Digital Library

Google Scholar

[4]

CHRISTOFIDES, N. Graph Theory—An Algorithmic Approach, Academic Press, New York, 1975.

Digital Library

Google Scholar

[5]

IVERSON, K. E. "Notation as a Tool of Thought," Communications of the ACM 23, (1980), 444-465.

Digital Library

Google Scholar

[6]

MCCABE, T.J. "A Complexity Measure," IEEE Transactions on Software Engineering, Vol SE-2, Dec. 1976, pp. 308-320.

Digital Library

Google Scholar

[7]

MYERS, G. J. Composite/Structured Design, Van Nostrand Reinhold Co., New York, 1978.

Digital Library

Google Scholar

[8]

YOURDON, E. and CONSTANTINE, L. Structured Design, Prentice-Hall, Englewood Cliffs, NJ, 1979.

Google Scholar

Cited By

View all

Fordyce KMorreale MJantzen JSullivan G(1991)Using boolean of integer arrays to analyze networksACM SIGAPL APL Quote Quad10.1145/114055.11407421:4(174-185)Online publication date: 1-Jul-1991
https://dl.acm.org/doi/10.1145/114055.114074
Fordyce KMorreale MJantzen JSullivan GSchulz C(1991)Using boolean of integer arrays to analyze networksProceedings of the international conference on APL '9110.1145/114054.114074(174-185)Online publication date: 1-Jul-1991
https://dl.acm.org/doi/10.1145/114054.114074
Fordyce KMorreale MJantzen JSullivan G(1991)Using boolean of integer arrays to analyze networksACM SIGAPL APL Quote Quad10.1145/114055.11407421:4(174-185)Online publication date: 1-Jul-1991
https://dl.acm.org/doi/10.1145/114055.114074
Show More Cited By

Index Terms

Using graphs to analyze APL functions
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
2. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language features
        Procedures, functions and subroutines
      2. Language types

Recommendations

Using graphs to analyze APL functions
APL '83: Proceedings of the international conference on APL

The purpose of this paper is to show how graphs can be used to analyze APL functions. Several kinds of graphs are introduced. In each case, APL functions which generate matrix representations of these graphs derived from APL programs are presented. Then,...
Variations of Y-dominating functions on graphs

Let Y be a subset of real numbers. A Y-dominating function of a graph G=(V,E) is a function f:V->Y such that @?"u"@?"N"""G"["v"]f(u)>=1 for all vertices v@?V, where N"G[v]={v}@?{u|(u,v)@?E}. Let f(S)=@?"u"@?"Sf(u) for any subset S of V and let f(V) be ...
Signed and minus clique-transversal functions on graphs

A minus (respectively, signed) clique-transversal function of a graph G=(V,E) is a function f:V->{-1,0,1} (respectively, {-1,1}) such that @?"u"@?"Cf(u)>=1 for every maximal clique C of G. The weight of a minus (respectively, signed) clique-transversal ...

Comments

Information & Contributors

Information

Published In

ACM SIGAPL APL Quote Quad Volume 13, Issue 3

March 1983

276 pages

ISSN:0163-6006

DOI:10.1145/390005

Issue’s Table of Contents

APL '83: Proceedings of the international conference on APL
April 1983
298 pages
ISBN:0897910958
DOI:10.1145/800062
Chairman:
Tom Puckett,
Editors:
Laurie A. Russell,
David M. Weintraub

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 March 1983

Published in SIGAPL Volume 13, Issue 3

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
273
Total Downloads

Downloads (Last 12 months)44
Downloads (Last 6 weeks)11

Reflects downloads up to 10 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Fordyce KMorreale MJantzen JSullivan G(1991)Using boolean of integer arrays to analyze networksACM SIGAPL APL Quote Quad10.1145/114055.11407421:4(174-185)Online publication date: 1-Jul-1991
https://dl.acm.org/doi/10.1145/114055.114074
Fordyce KMorreale MJantzen JSullivan GSchulz C(1991)Using boolean of integer arrays to analyze networksProceedings of the international conference on APL '9110.1145/114054.114074(174-185)Online publication date: 1-Jul-1991
https://dl.acm.org/doi/10.1145/114054.114074
Fordyce KMorreale MJantzen JSullivan G(1991)Using boolean of integer arrays to analyze networksACM SIGAPL APL Quote Quad10.1145/114055.11407421:4(174-185)Online publication date: 1-Jul-1991
https://dl.acm.org/doi/10.1145/114055.114074
Fordyce KMorreale MJantzen JSullivan GSchulz C(1991)Using boolean of integer arrays to analyze networksProceedings of the international conference on APL '9110.1145/114054.114074(174-185)Online publication date: 1-Jul-1991
https://dl.acm.org/doi/10.1145/114054.114074
Willink R(1987)Sherlock Holmes: the mystery of the vanishing variableACM SIGAPL APL Quote Quad10.1145/384282.2837817:4(487-493)Online publication date: May-1987
https://doi.org/10.1145/384282.28378
Willink R(1987)Sherlock Holmes: the mystery of the vanishing variableProceedings of the international conference on APL: APL in transition10.1145/28315.28378(487-493)Online publication date: 1-Jan-1987
https://dl.acm.org/doi/10.1145/28315.28378

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations