Fast binding-time analysis for multi-level specialization View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

1996

AUTHORS

Robert Glück , Jesper Jørgensen

ABSTRACT

Program specialization can divide a computation into several computation stages. We present the key ingredient of our approach to multi-level specialization: an accurate and fast multi-level binding-time analysis. Three efficient program analyses for higher-order, functional languages are presented which are based on constraint systems and run almost-linear in the size of the analyzed programs. The three constraint normalizations have been proven correct (soundness, completeness, termination, existence of best solution). The analyses have all been implemented for a substantial, higher-order subset of Scheme. Experiments with widely-available example programs confirm the excellent run-time behavior of the normalization algorithms. More... »

PAGES

261-272

Book

TITLE

Perspectives of System Informatics

ISBN

978-3-540-62064-8
978-3-540-49637-3

Author Affiliations

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/3-540-62064-8_22

DOI

http://dx.doi.org/10.1007/3-540-62064-8_22

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1008856040


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

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/0802", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Computation Theory and Mathematics", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "University of Copenhagen", 
          "id": "https://www.grid.ac/institutes/grid.5254.6", 
          "name": [
            "Dept. of Computer Science, University of Copenhagen, Universitetsparken 1, DK-2100\u00a0Copenhagen, Denmark"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Gl\u00fcck", 
        "givenName": "Robert", 
        "id": "sg:person.010754010217.31", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010754010217.31"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "KU Leuven", 
          "id": "https://www.grid.ac/institutes/grid.5596.f", 
          "name": [
            "Dept. of Computer Science, Katholieke Universiteit Leuven, Celestijnenlaan 200a, B-3001\u00a0Heverlee, Belgium"
          ], 
          "type": "Organization"
        }, 
        "familyName": "J\u00f8rgensen", 
        "givenName": "Jesper", 
        "id": "sg:person.014706352727.82", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014706352727.82"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "1996", 
    "datePublishedReg": "1996-01-01", 
    "description": "Program specialization can divide a computation into several computation stages. We present the key ingredient of our approach to multi-level specialization: an accurate and fast multi-level binding-time analysis. Three efficient program analyses for higher-order, functional languages are presented which are based on constraint systems and run almost-linear in the size of the analyzed programs. The three constraint normalizations have been proven correct (soundness, completeness, termination, existence of best solution). The analyses have all been implemented for a substantial, higher-order subset of Scheme. Experiments with widely-available example programs confirm the excellent run-time behavior of the normalization algorithms.", 
    "editor": [
      {
        "familyName": "Bj\u00f8rner", 
        "givenName": "Dines", 
        "type": "Person"
      }, 
      {
        "familyName": "Broy", 
        "givenName": "Manfred", 
        "type": "Person"
      }, 
      {
        "familyName": "Pottosin", 
        "givenName": "Igor V.", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/3-540-62064-8_22", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-540-62064-8", 
        "978-3-540-49637-3"
      ], 
      "name": "Perspectives of System Informatics", 
      "type": "Book"
    }, 
    "name": "Fast binding-time analysis for multi-level specialization", 
    "pagination": "261-272", 
    "productId": [
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/3-540-62064-8_22"
        ]
      }, 
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "2a316987d787434a563445979fb66468ed07eab8817b5809f0292c2cc44b2d42"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1008856040"
        ]
      }
    ], 
    "publisher": {
      "location": "Berlin, Heidelberg", 
      "name": "Springer Berlin Heidelberg", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/3-540-62064-8_22", 
      "https://app.dimensions.ai/details/publication/pub.1008856040"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2019-04-15T11:16", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000001_0000000264/records_8660_00000015.jsonl", 
    "type": "Chapter", 
    "url": "http://link.springer.com/10.1007/3-540-62064-8_22"
  }
]
 

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

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/3-540-62064-8_22'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/3-540-62064-8_22'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/3-540-62064-8_22'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/3-540-62064-8_22'


 

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

85 TRIPLES      22 PREDICATES      27 URIs      20 LITERALS      8 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/3-540-62064-8_22 schema:about anzsrc-for:08
2 anzsrc-for:0802
3 schema:author N723b052a810c4740be1546e6dc6f5f4a
4 schema:datePublished 1996
5 schema:datePublishedReg 1996-01-01
6 schema:description Program specialization can divide a computation into several computation stages. We present the key ingredient of our approach to multi-level specialization: an accurate and fast multi-level binding-time analysis. Three efficient program analyses for higher-order, functional languages are presented which are based on constraint systems and run almost-linear in the size of the analyzed programs. The three constraint normalizations have been proven correct (soundness, completeness, termination, existence of best solution). The analyses have all been implemented for a substantial, higher-order subset of Scheme. Experiments with widely-available example programs confirm the excellent run-time behavior of the normalization algorithms.
7 schema:editor N3c076e8fff8444c088625ef2c17b077e
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree false
11 schema:isPartOf Na539e6379da84d7882aae852a489eb51
12 schema:name Fast binding-time analysis for multi-level specialization
13 schema:pagination 261-272
14 schema:productId N183b82492b3640688c6ae5f3a98e1c56
15 N6584da73fbdf4998a8c91a1a44e3ea78
16 N970e31e8f94b49c0b7b40ba3207ea1c3
17 schema:publisher N2b5b2ecd86e24e4fbd6e0f3831453b63
18 schema:sameAs https://app.dimensions.ai/details/publication/pub.1008856040
19 https://doi.org/10.1007/3-540-62064-8_22
20 schema:sdDatePublished 2019-04-15T11:16
21 schema:sdLicense https://scigraph.springernature.com/explorer/license/
22 schema:sdPublisher N4088540a98ca40c6adcbcf0ee9e08481
23 schema:url http://link.springer.com/10.1007/3-540-62064-8_22
24 sgo:license sg:explorer/license/
25 sgo:sdDataset chapters
26 rdf:type schema:Chapter
27 N183b82492b3640688c6ae5f3a98e1c56 schema:name doi
28 schema:value 10.1007/3-540-62064-8_22
29 rdf:type schema:PropertyValue
30 N2b5b2ecd86e24e4fbd6e0f3831453b63 schema:location Berlin, Heidelberg
31 schema:name Springer Berlin Heidelberg
32 rdf:type schema:Organisation
33 N3c076e8fff8444c088625ef2c17b077e rdf:first Nc73aeb74edbf4da19a3c4e45e7e2adad
34 rdf:rest Na035b628016247eb90535371806e7fcb
35 N4088540a98ca40c6adcbcf0ee9e08481 schema:name Springer Nature - SN SciGraph project
36 rdf:type schema:Organization
37 N6584da73fbdf4998a8c91a1a44e3ea78 schema:name readcube_id
38 schema:value 2a316987d787434a563445979fb66468ed07eab8817b5809f0292c2cc44b2d42
39 rdf:type schema:PropertyValue
40 N723b052a810c4740be1546e6dc6f5f4a rdf:first sg:person.010754010217.31
41 rdf:rest N8e9d6ca97e5541e388fc9a7463441b1d
42 N8e9d6ca97e5541e388fc9a7463441b1d rdf:first sg:person.014706352727.82
43 rdf:rest rdf:nil
44 N970e31e8f94b49c0b7b40ba3207ea1c3 schema:name dimensions_id
45 schema:value pub.1008856040
46 rdf:type schema:PropertyValue
47 Na035b628016247eb90535371806e7fcb rdf:first Necca17ab7ac1425ea4ccf167019c5c8b
48 rdf:rest Na74d88a4d72f4275902d2a5f1488fa71
49 Na539e6379da84d7882aae852a489eb51 schema:isbn 978-3-540-49637-3
50 978-3-540-62064-8
51 schema:name Perspectives of System Informatics
52 rdf:type schema:Book
53 Na74d88a4d72f4275902d2a5f1488fa71 rdf:first Nb934b4542bf24b1796ae0b28720e9669
54 rdf:rest rdf:nil
55 Nb934b4542bf24b1796ae0b28720e9669 schema:familyName Pottosin
56 schema:givenName Igor V.
57 rdf:type schema:Person
58 Nc73aeb74edbf4da19a3c4e45e7e2adad schema:familyName Bjørner
59 schema:givenName Dines
60 rdf:type schema:Person
61 Necca17ab7ac1425ea4ccf167019c5c8b schema:familyName Broy
62 schema:givenName Manfred
63 rdf:type schema:Person
64 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
65 schema:name Information and Computing Sciences
66 rdf:type schema:DefinedTerm
67 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
68 schema:name Computation Theory and Mathematics
69 rdf:type schema:DefinedTerm
70 sg:person.010754010217.31 schema:affiliation https://www.grid.ac/institutes/grid.5254.6
71 schema:familyName Glück
72 schema:givenName Robert
73 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010754010217.31
74 rdf:type schema:Person
75 sg:person.014706352727.82 schema:affiliation https://www.grid.ac/institutes/grid.5596.f
76 schema:familyName Jørgensen
77 schema:givenName Jesper
78 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014706352727.82
79 rdf:type schema:Person
80 https://www.grid.ac/institutes/grid.5254.6 schema:alternateName University of Copenhagen
81 schema:name Dept. of Computer Science, University of Copenhagen, Universitetsparken 1, DK-2100 Copenhagen, Denmark
82 rdf:type schema:Organization
83 https://www.grid.ac/institutes/grid.5596.f schema:alternateName KU Leuven
84 schema:name Dept. of Computer Science, Katholieke Universiteit Leuven, Celestijnenlaan 200a, B-3001 Heverlee, Belgium
85 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...