maxtac-sast-control-flow-graph

Construct static analysis graphs for reachability, guard dominance, and path feasibility.

12|Updated Jun 1, 2026
One-click install
npx skills add https://github.com/philo-groves/MaxTAC --skill maxtac-sast-control-flow-graph
Or copy as Structured Prompt for Agent
Please help me install this Agent Skill.
Skill: maxtac-sast-control-flow-graph
Source: https://github.com/philo-groves/MaxTAC/tree/main/plugins/maxtac-source/skills/maxtac-sast-control-flow-graph
Command: npx skills add https://github.com/philo-groves/MaxTAC --skill maxtac-sast-control-flow-graph

SYSTEM DOCUMENTATION & REQUIREMENTS

💡 This Skill includes scripts (resource) components.

What problem does it solve?

This Skill solves the challenge of statically analyzing source code or decompiler output to construct and evaluate reachability, guard coverage, and path feasibility for security research.

Core Features & Use Cases

  • Static Analysis Graphs: Constructs static analysis graphs for call, control flow, and state transitions in code.
  • Use Cases: Used in identifying unauthorized access paths, analyzing guard coverage for security invariants, and verifying cleanup and ownership paths.
  • Quick Start: Utilize the skill by defining the analysis scope and using maxtac-sast-control-flow-graph to build and assess graphs relevant to a specific security hypothesis.

Quick Start

Build a control-flow graph for the function handleData and identify paths from potential entry points to sensitive data within the codebase.

Frequently Asked Questions about maxtac-sast-control-flow-graph

High-intent search queries and answers about installing and using this skill.

FAQPage Schema
How do I build a control flow graph for static reachability analysis?

Static reachability analysis requires constructing control flow graphs from source code or decompiler output to trace paths from entry points to sensitive data. This skill builds those graphs to evaluate guard dominance and path feasibility for security research.

What is guard dominance in static code analysis?

Guard dominance in static code analysis evaluates whether conditional checks sufficiently protect sensitive code paths from unauthorized access. This skill constructs graphs to analyze guard coverage for security invariants within software artifacts.

Can I use static analysis graphs to identify unauthorized access paths in decompiler output?

Yes, static analysis graphs can identify unauthorized access paths in decompiler output by mapping call, control flow, and state transitions. This skill constructs these graphs to evaluate reachability and verify security invariants.

How do I verify cleanup and ownership paths using control flow graphs?

Verifying cleanup and ownership paths using control flow graphs involves mapping state transitions and call flows to ensure resources are properly managed. This skill constructs static analysis graphs to evaluate path feasibility for these security compliance checks.

What's the best way to assess path feasibility for vulnerability research?

Assessing path feasibility for vulnerability research requires static analysis of source code to determine if potential execution paths are reachable under specific conditions. This skill constructs graphs to generate reachability evidence and evaluate guard coverage.

Do I need static analysis tools to evaluate path feasibility for security compliance?

Yes, evaluating path feasibility for security compliance requires static analysis tools and graph reduction logic to process source code or decompiler output. This skill utilizes these tools to construct graphs and assess reachability evidence.