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

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 32, Issue 1, 1997, Pages 86-88

  Le Métayer, Daniel ^a  

^a CAMPUS DE BEAULIEU   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346045025     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/251595.251605     Document Type: Article

References (10)

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.
2. th CM POPL, 1977, pp. 238-252.
3. th Int. Conf. on Software Engineering, IEEE, 1996, pp. 575-584.
4. th ACM POPL, 1997, to appear.
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.
6. th International Conference on Software Engineering, May 1994, pp. 13-22.
7. D. Le Métayer, Software architecture styles as graph grammars, proc. ACM SIGSOFT'96 Symposium on the Foundations of Software Engineering, 1996, pp. 15-23.
8. M. Mizuno and D. Schmidt, A security flow control algorithm and its denotational semantics correctness proof, Formal Aspects of Computing, Vol. 5-3, 1992.
9. L. Osterweil, Using data-flow tools in software engineering, in Program flow analysis: Theory and applications,S. Muchnick and N. Jones (Eds), Prentice-Hall software series, 1981, pp. 237-263.
10. B. Steffen, Generating data flow analysis algorithms from modal specifications, Science of Computer Programming, Vol. 21, 1991, pp. 115-139.