Control flow graphs and code coverage

DOI10.2478/V10006-010-0056-9MaRDI QIDQ3083920zbMATH OpenOpenAlexFDO

Authors Robert Gold

Publication date 24 March 2011

Published in International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/208022, http://matwbn.icm.edu.pl/tresc.php?wyd=11&tom=20&jez=en

zbMATH Keywords

branch coveragecontrol flow graphdirected graphgraph reductionsoftware testingstatement coverage

Mathematics Subject Classification ID

Flows in graphs (05C21)

Recommendations

• A uniform approach to control flow graphs of programs
• A generalized mathematical theory of structured programming
• scientific article; zbMATH DE number 3924114
• A unifying theory of control dependence and its application to arbitrary program structures
• scientific article; zbMATH DE number 3883595

Cites work

• A Complexity Measure
• scientific article; zbMATH DE number 50852 (Why is no real title available?)
• scientific article; zbMATH DE number 3478370 (Why is no real title available?)
• scientific article; zbMATH DE number 5254148 (Why is no real title available?)
• On Partitioning Program Graphs

Cited in

(5)

• The application of hypergroups in symbolic executions and finite automata
• scientific article; zbMATH DE number 3883595 (Why is no real title available?)
• A uniform approach to control flow graphs of programs
• A theory for control-flow graph exploration
• Overlaying control flow graphs on P4 syntax trees with Gremlin

This page was built for publication: Control flow graphs and code coverage

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