Book section Open Access

Gamifying Program Analysis

Fava, Daniel; Signoles, Julien; Lemerre, Matthieu; Schäf, Martin; Tiwari, Ashish


JSON Export

{
  "files": [
    {
      "links": {
        "self": "https://zenodo.org/api/files/c74d95b4-02bc-406c-a2c6-4696d6b6f63a/article.pdf"
      }, 
      "checksum": "md5:64214352d1cf71b7272eb75c1c382fea", 
      "bucket": "c74d95b4-02bc-406c-a2c6-4696d6b6f63a", 
      "key": "article.pdf", 
      "type": "pdf", 
      "size": 1500018
    }
  ], 
  "owners": [
    13380
  ], 
  "doi": "10.1007/978-3-662-48899-7_41", 
  "stats": {
    "version_unique_downloads": 6.0, 
    "unique_views": 9.0, 
    "views": 10.0, 
    "version_views": 10.0, 
    "unique_downloads": 6.0, 
    "version_unique_views": 9.0, 
    "volume": 9000108.0, 
    "version_downloads": 6.0, 
    "downloads": 6.0, 
    "version_volume": 9000108.0
  }, 
  "links": {
    "doi": "https://doi.org/10.1007/978-3-662-48899-7_41", 
    "latest_html": "https://zenodo.org/record/4429098", 
    "bucket": "https://zenodo.org/api/files/c74d95b4-02bc-406c-a2c6-4696d6b6f63a", 
    "badge": "https://zenodo.org/badge/doi/10.1007/978-3-662-48899-7_41.svg", 
    "html": "https://zenodo.org/record/4429098", 
    "latest": "https://zenodo.org/api/records/4429098"
  }, 
  "created": "2021-01-08T18:33:23.727324+00:00", 
  "updated": "2021-01-11T12:27:20.070592+00:00", 
  "conceptrecid": "4429097", 
  "revision": 2, 
  "id": 4429098, 
  "metadata": {
    "access_right_category": "success", 
    "doi": "10.1007/978-3-662-48899-7_41", 
    "description": "Abstract interpretation is a powerful tool in program verification. Several commercial or industrial scale implementations of abstract interpretation have demonstrated that this approach can verify safety properties of real-world code. However, using abstract interpretation tools is not always simple. If no user-provided hints are available, the abstract interpretation engine may lose precision during widening and produce an overwhelming number of false alarms. However, manually providing these hints is time consuming and often frustrating when re-running the analysis takes a lot of time.We present an algorithm for program verification that combines abstract interpretation, symbolic execution and crowdsourcing. If verification fails, our procedure suggests likely invariants, or program patches, that provide helpful information to the verification engineer and makes it easier to find the correct specification. By complementing machine learning with well-designed games, we enable program analysis to incorporate human insights that help improve their scalability and usability.", 
    "license": {
      "id": "zenodo-freetoread-1.0"
    }, 
    "title": "Gamifying Program Analysis", 
    "relations": {
      "version": [
        {
          "count": 1, 
          "index": 0, 
          "parent": {
            "pid_type": "recid", 
            "pid_value": "4429097"
          }, 
          "is_last": true, 
          "last_child": {
            "pid_type": "recid", 
            "pid_value": "4429098"
          }
        }
      ]
    }, 
    "publication_date": "2015-01-01", 
    "creators": [
      {
        "name": "Fava, Daniel"
      }, 
      {
        "name": "Signoles, Julien"
      }, 
      {
        "name": "Lemerre, Matthieu"
      }, 
      {
        "name": "Sch\u00e4f, Martin"
      }, 
      {
        "name": "Tiwari, Ashish"
      }
    ], 
    "access_right": "open", 
    "resource_type": {
      "subtype": "section", 
      "type": "publication", 
      "title": "Book section"
    }
  }
}
10
6
views
downloads
Views 10
Downloads 6
Data volume 9.0 MB
Unique views 9
Unique downloads 6

Share

Cite as