skip to main content
article
Free Access

Program analysis for software engineering: new applications, new requirements, new tools

Published:01 December 1996Publication History

Abstract

No abstract available.

Skip Supplemental Material Section

Supplemental Material

References

  1. 1 F. Bourdoncle, Abstract debugging of higher-order imperative languages, in Proceeding of the ACM SIGPLAN'93 Conf. on Programming Language Design and Implementation, 1993. Google ScholarGoogle Scholar
  2. 2 P. Cousot and R. Cousot, Abstract interpretation: a uni~ed lattice model for static analysis of programs by construction or approximation of ~xpoints, in Proceedings 4 th ACM POPL, 1977, pp. 238-252. Google ScholarGoogle Scholar
  3. 3 E. Duesterwald, R. Gupta and M.-L. So~a, A demand-driven analyser for data ow testing at the integration level, in Proceedings 18 th Int. Conf. on Software Engineering, IEEE, 1996, pp. 575-584. Google ScholarGoogle Scholar
  4. 4 P. Fradet and D. Le M~etayer, Shape types, in Proceedings 24 th ACM POPL, 1997, to appear. Google ScholarGoogle Scholar
  5. 5 S. Horwitz and T. Reps, The use of program dependence graphs in software engineering, Proc. int. Conference on Software Engineering, ACM, pp. 392-411, 1992. Google ScholarGoogle Scholar
  6. 6 D. Jackson, Aspect: an economical bug-detector, in Proceedings of 13 th International Conference on Software Engineering, May 1994, pp. 13-22. Google ScholarGoogle Scholar
  7. 7 D. Le M~etayer, Software architecture styles as graph grammars, proc. ACM SIGSOFT'96 Symposium on the Foundations of Software Engineering, 1996, pp. 15-23. Google ScholarGoogle Scholar
  8. 8 M. Mizuno and D. Schmidt, A security ow control algorithm and its denotational semantics correctness proof, Formal Aspects of Computing, Vol. 5-3, 1992.Google ScholarGoogle Scholar
  9. 9 L. Osterweil, Using data- ow tools in software engineering, inProgram ow analysis: Theory and applications,S. Muchnick and N. Jones (Eds), Prentice-Hall software series, 1981, pp. 237-263.Google ScholarGoogle Scholar
  10. 10 B. Ste~en, Generating data ow analysis algorithms from modal speci~cations, Science of Computer Programming, Vol. 21, 1991, pp. 115-139. Google ScholarGoogle Scholar

Recommendations

Comments

Login options

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

Sign in

Full Access

  • Published in

    cover image ACM Computing Surveys
    ACM Computing Surveys  Volume 28, Issue 4es
    Special issue: position statements on strategic directions in computing research
    Dec. 1996
    8 pages
    ISSN:0360-0300
    EISSN:1557-7341
    DOI:10.1145/242224
    Issue’s Table of Contents

    Copyright © 1996 ACM

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 1 December 1996
    Published in csur Volume 28, Issue 4es

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • article