scientific article; zbMATH DE number 3557197

MaRDI QIDQ4133096zbMATH OpenFDO

Authors Ken Kennedy

Publication date 1975

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cited in

(6)

• Slicing communicating automata specifications: Polynomial algorithms for model reduction
• A strong-connectivity algorithm and its applications in data flow analysis
• Pathlistings applied to data flow analysis
• Lower bounds on the lengths of node sequences in directed graphs
• Syntactic and semantic soundness of structural dataflow analysis
• Node listings for reducible flow graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4133096)