All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Completeness of Abstract Domains for String Analysis of JavaScript Programs

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F19%3A00116391" target="_blank" >RIV/00216224:14330/19:00116391 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1007/978-3-030-32505-3_15" target="_blank" >http://dx.doi.org/10.1007/978-3-030-32505-3_15</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-030-32505-3_15" target="_blank" >10.1007/978-3-030-32505-3_15</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Completeness of Abstract Domains for String Analysis of JavaScript Programs

  • Original language description

    Completeness in abstract interpretation is a well-known property, which ensures that the abstract framework does not lose information during the abstraction process, with respect to the property of interest. Completeness has been never taken into account for existing string abstract domains, due to the fact that it is difficult to prove it formally. However, the effort is fully justified when dealing with string analysis, which is a key issue to guarantee security properties in many software systems, in particular for JavaScript programs where poorly managed string manipulating code often leads to significant security flaws. In this paper, we address completeness for the main JavaScript-specific string abstract domains, we provide suitable refinements of them, and we discuss the benefits of guaranteeing completeness in the context of abstract-interpretation based string analysis of dynamic languages.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2019

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Theoretical Aspects of Computing – ICTAC 2019

  • ISBN

    9783030325046

  • ISSN

    0302-9743

  • e-ISSN

    1611-3349

  • Number of pages

    18

  • Pages from-to

    255-272

  • Publisher name

    Springer

  • Place of publication

    Hammamet, Tunisia

  • Event location

    Hammamet, Tunisia

  • Event date

    Jan 1, 2019

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000582443200015