Conference paper Open Access

Learning Graph-based Heuristics for Pointer Analysis without Handcrafting Application-Specific Features

Minseok Jeon; Myungho Lee; Hakjoo Oh


Dublin Core Export

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:creator>Minseok Jeon</dc:creator>
  <dc:creator>Myungho Lee</dc:creator>
  <dc:creator>Hakjoo Oh</dc:creator>
  <dc:date>2020-09-22</dc:date>
  <dc:description>Graphick

Graphick is a new technique for automatically learning graph-based heuristics for pointer analys. We implemetned Graphick on top of Doop and used it to learn graph-based heuristics for object sensitivity and heap abstraction. This is the artifact (VirtualBox image) of our technique Graphick in the paper "Learning Graph-based Heuristics for Pointer Analysis without Handcrafting Application-Specific Features". For more details, please read our paper.</dc:description>
  <dc:identifier>https://zenodo.org/record/4040341</dc:identifier>
  <dc:identifier>10.5281/zenodo.4040341</dc:identifier>
  <dc:identifier>oai:zenodo.org:4040341</dc:identifier>
  <dc:language>eng</dc:language>
  <dc:relation>doi:10.5281/zenodo.4040340</dc:relation>
  <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
  <dc:rights>https://opensource.org/licenses/MIT</dc:rights>
  <dc:title>Learning Graph-based Heuristics for Pointer Analysis without Handcrafting Application-Specific Features</dc:title>
  <dc:type>info:eu-repo/semantics/conferencePaper</dc:type>
  <dc:type>publication-conferencepaper</dc:type>
</oai_dc:dc>
166
52
views
downloads
All versions This version
Views 166166
Downloads 5252
Data volume 136.1 GB136.1 GB
Unique views 147147
Unique downloads 3838

Share

Cite as