JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/17", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Psychology and Cognitive Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/1701", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Psychology", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Singapore Management University, Singapore", 
          "id": "http://www.grid.ac/institutes/grid.412634.6", 
          "name": [
            "Singapore Management University, Singapore"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Gao", 
        "givenName": "Debin", 
        "id": "sg:person.013015522271.54", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013015522271.54"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "University of North Carolina at Chapel Hill, USA", 
          "id": "http://www.grid.ac/institutes/grid.10698.36", 
          "name": [
            "University of North Carolina at Chapel Hill, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Reiter", 
        "givenName": "Michael K.", 
        "id": "sg:person.01265200500.82", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01265200500.82"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "University of California, Berkeley, USA", 
          "id": "http://www.grid.ac/institutes/grid.47840.3f", 
          "name": [
            "University of California, Berkeley, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Song", 
        "givenName": "Dawn", 
        "id": "sg:person.01143152610.86", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01143152610.86"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2008", 
    "datePublishedReg": "2008-01-01", 
    "description": "We introduce BinHunt, a novel technique for finding semantic differences in binary programs. Semantic differences between two binary files contrast with syntactic differences in that semantic differences correspond to changes in the program functionality. Semantic differences are difficult to find because of the noise from syntactic differences caused by, e.g., different register allocation and basic block re-ordering. BinHunt bases its analysis on the control flow of the programs using a new graph isomorphism technique, symbolic execution, and theorem proving. We implement a system based on BinHunt and demonstrate the application of the system with three case studies in which BinHunt manages to identify the semantic differences between an executable and its patched version, revealing the vulnerability that the patch eliminates.", 
    "editor": [
      {
        "familyName": "Chen", 
        "givenName": "Liqun", 
        "type": "Person"
      }, 
      {
        "familyName": "Ryan", 
        "givenName": "Mark D.", 
        "type": "Person"
      }, 
      {
        "familyName": "Wang", 
        "givenName": "Guilin", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-540-88625-9_16", 
    "inLanguage": "en", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-540-88624-2", 
        "978-3-540-88625-9"
      ], 
      "name": "Information and Communications Security", 
      "type": "Book"
    }, 
    "keywords": [
      "differences", 
      "program", 
      "novel technique", 
      "study", 
      "contrast", 
      "changes", 
      "vulnerability", 
      "technique", 
      "analysis", 
      "patches", 
      "block", 
      "system", 
      "version", 
      "flow", 
      "program functionality", 
      "functionality", 
      "allocation", 
      "applications", 
      "execution", 
      "case study", 
      "semantic differences", 
      "noise", 
      "syntactic differences", 
      "proving", 
      "patched version", 
      "binary programs", 
      "control flow", 
      "basic blocks", 
      "symbolic execution", 
      "register allocation", 
      "theorem proving"
    ], 
    "name": "BinHunt: Automatically Finding Semantic Differences in Binary Programs", 
    "pagination": "238-255", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1049968375"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-540-88625-9_16"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-540-88625-9_16", 
      "https://app.dimensions.ai/details/publication/pub.1049968375"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-05-20T07:42", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220519/entities/gbq_results/chapter/chapter_139.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-540-88625-9_16"
  }
]

Download the RDF metadata as:  json-ld nt turtle xml License info

This table displays all metadata directly associated to this object as RDF triples.

121 TRIPLES      23 PREDICATES      57 URIs      50 LITERALS      7 BLANK NODES