GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Sign in
  • ActionsCI/CD and automation
  • CodespacesCloud development environments
  • All Features
  • Documentation
  • Training
  • Certifications
  • Build with Copilot
  • Customize Copilot
  • Integrations
  • Trending repos
  • GitHub Sponsors
  • Developer articles
  • Enterprises

This view

  • Original page
  • New address

GeezerVison is showing github.com — GitHub - FormalLanguageConstrainedPathQuerying/CFPQ_JavaGraphMiner: Java graph miner and dataset for CFL-reachability-based analyses

BranchesTags
Open more actions menu

Latest commit

 

History

9 Commits
9 Commits

Folders and files

NameName
Last commit message
Last commit date
.github/workflows
.github/workflows
 
 
gradle/wrapper
gradle/wrapper
 
 
src
src
 
 
.gitignore
.gitignore
 
 
LICENSE
LICENSE
 
 
README.md
README.md
 
 
build.gradle.kts
build.gradle.kts
 
 
gradle.properties
gradle.properties
 
 
gradlew
gradlew
 
 
gradlew.bat
gradlew.bat
 
 
settings.gradle.kts
settings.gradle.kts
 
 

Repository files navigation

CFPQ_JavaGraphMiner

JacoDB-based utility for extracting graphs from Java programs for CFPQ-based analyses.

Usage

To extract graphs used to evaluate CFPQ_PyAlgo, execute the following command in the project root.

./gradlew run

After the gradle task completes, open the CFPQ_JavaMiner/graph folder, where you will find:

  • extracted graphs in the format recognizable by optimized CFPQ_PyAlgo;
  • mapping files needed to convert vertex, label, and type IDs back to the Java code elements they originated from (fields, expressions, types, etc.);
  • type and supertype data for every vertex that can be used for type-aware analyses (experimental, subject to change).

Supported Analyses

As of now, CFPQ_JavaGraphMiner only supports extracting graphs for field-sensitive, context-insensitive points-to analysis with dynamic dispatch, but without reflection. These graphs are intended to be used with this grammar.

Implementation Overview

The high-level pipeline is as follows:

  • JacoDB converts JVM bytecode to three-address instructions (JcInst).
  • PtResolver converts three-address instructions (JcInst) to a points-to graph model (PtModel).
  • Optional step: PtSimplifier simplifies the points-to graph model (PtModel) by eliminating some assign edges.
  • IdGenerator is used to assign identifiers to points-to graph model (PtModel) entities (i.e., create mappings).
  • GraphMiner encodes the points-to graph model (PtModel) using these mappings and saves the encoded model and mappings.

Tests

The graph miner is covered with integration tests that:

  • collect graphs for sample programs;
  • simplify these graphs to remove implementation-dependent vertices;
  • assert the equality of simplified graphs and manually verified ground-truth graphs;

To run tests, execute the following command in the project root.

./gradlew test

Technologies

  • Kotlin
  • JacoDB
  • JUnit 5
  • Gradle

About

Java graph miner and dataset for CFL-reachability-based analyses

Resources

Readme
Apache-2.0 license
Activity
Custom properties

Stars

1 star

Watchers

3 watching

Forks

0 forks
Report repository

Releases

Packages

Contributors

Languages

You are visitor 01402503 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.