dx.doi.org/10.1007/s10817-016-9389-x

Preview meta tags from the dx.doi.org website.

Linked Hostnames

31

Thumbnail

Search Engine Appearance

Google

https://dx.doi.org/10.1007/s10817-016-9389-x

Automatically Proving Termination and Memory Safety for Programs with Pointer Arithmetic - Journal of Automated Reasoning

While automated verification of imperative programs has been studied intensively, proving termination of programs with explicit pointer arithmetic fully au



Bing

Automatically Proving Termination and Memory Safety for Programs with Pointer Arithmetic - Journal of Automated Reasoning

https://dx.doi.org/10.1007/s10817-016-9389-x

While automated verification of imperative programs has been studied intensively, proving termination of programs with explicit pointer arithmetic fully au



DuckDuckGo

https://dx.doi.org/10.1007/s10817-016-9389-x

Automatically Proving Termination and Memory Safety for Programs with Pointer Arithmetic - Journal of Automated Reasoning

While automated verification of imperative programs has been studied intensively, proving termination of programs with explicit pointer arithmetic fully au

  • General Meta Tags

    159
    • title
      Automatically Proving Termination and Memory Safety for Programs with Pointer Arithmetic | Journal of Automated Reasoning
    • charset
      UTF-8
    • X-UA-Compatible
      IE=edge
    • applicable-device
      pc,mobile
    • viewport
      width=device-width, initial-scale=1

  • Open Graph Meta Tags

    6
    • og:url
      https://link.springer.com/article/10.1007/s10817-016-9389-x
    • og:type
      article
    • og:site_name
      SpringerLink
    • og:title
      Automatically Proving Termination and Memory Safety for Programs with Pointer Arithmetic - Journal of Automated Reasoning
    • og:description
      While automated verification of imperative programs has been studied intensively, proving termination of programs with explicit pointer arithmetic fully automatically was still an open problem. To close this gap, we introduce a novel abstract domain that can track allocated memory in detail. We use it to automatically construct a symbolic execution graph that over-approximates all possible runs of a program and that can be used to prove memory safety. This graph is then transformed into an integer transition system, whose termination can be proved by standard techniques. We implemented this approach in the automated termination prover AProVE and demonstrate its capability of analyzing C programs with pointer arithmetic that existing tools cannot handle.

  • Twitter Meta Tags

    6
    • twitter:site
      @SpringerLink
    • twitter:card
      summary_large_image
    • twitter:image:alt
      Content cover image
    • twitter:title
      Automatically Proving Termination and Memory Safety for Programs with Pointer Arithmetic
    • twitter:description
      Journal of Automated Reasoning - While automated verification of imperative programs has been studied intensively, proving termination of programs with explicit pointer arithmetic fully...

  • Item Prop Meta Tags

    3
    • position
      1
    • position
      2
    • position
      3

  • Link Tags

    9
    • apple-touch-icon
      /oscar-static/img/favicons/darwin/apple-touch-icon-6ef0829b9c.png
    • canonical
      https://link.springer.com/article/10.1007/s10817-016-9389-x
    • icon
      /oscar-static/img/favicons/darwin/android-chrome-192x192.png
    • icon
      /oscar-static/img/favicons/darwin/favicon-32x32.png
    • icon
      /oscar-static/img/favicons/darwin/favicon-16x16.png

Emails

1

Links

117