A theory for control-flow graph exploration

DOI10.1007/978-3-319-02444-8_44MaRDI QIDQ5166718zbMATH OpenOpenAlexFDO

Authors Stephan Arlt, Philipp Rümmer, Martin Schäf

Publication date 8 July 2014

Published in Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL http://orbilu.uni.lu/handle/10993/10425

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Analysis of the infeasible path based on key branch
• Infeasible paths elimination by symbolic execution techniques. Proof of correctness and preservation of paths
• Control flow graphs and code coverage
• A uniform approach to control flow graphs of programs
• Structural Statistical Software Testing with Active Learning in a Graph

Cited in

(8)

• On the detection of unstructuredness in flowgraphs
• The flowing nature matters: feature learning from the control flow graph of source code for bug localization
• Analysis of the infeasible path based on key branch
• Widening with Thresholds for Programs with Complex Control Graphs
• Severity levels of inconsistent code
• CFA2: A Context-Free Approach to Control-Flow Analysis
• scientific article; zbMATH DE number 2079640 (Why is no real title available?)
• Structural Statistical Software Testing with Active Learning in a Graph

Describes a project that uses

Uses Software

• Joogie

This page was built for publication: A theory for control-flow graph exploration

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