The University of Southampton
University of Southampton Institutional Repository

Looking at Computations from a Different Angle

Looking at Computations from a Different Angle
Looking at Computations from a Different Angle
We present a novel framework to reason about programs based on encodings of computations as graphs. The main insight here is to rearrange the programs such that given a bound k, each computation can be explored according to any tree decomposition of width k of the corresponding behaviour graph. This produces under-approximations parameterized on k, which result in a complete method when we restrict to classes of behaviour graphs of bounded tree-width. As an additional feature, the transformation of the input program can be targeted to existing tools for the analysis, and thus, off-the-shelf tools based on fixed-point, or capable of analyzing sequential programs with scalar variables and nondeterminism, can be used.
To illustrate our approach, we develop this framework for sequential programs and discuss how to extend it to handle concurrency. For the case of sequential programs, we develop a compositional approach to generate on-the-fly tree decompositions of nested words, which is based on graph-summaries. To illustrate our technique, we also implement our algorithms for C programs.
University of Southampton
Inverso, Omar
1a7b5398-791c-479b-88c9-2442212d0a28
La Torre, Salvatore
ec51ffc2-65d9-414e-9dd2-f5f342979c10
Tomasco, Ermenegildo
7b944585-0193-4dab-861b-8d5cdccf82cd
Parlato, Gennaro
c28428a0-d3f3-4551-a4b5-b79e410f4923
Inverso, Omar
1a7b5398-791c-479b-88c9-2442212d0a28
La Torre, Salvatore
ec51ffc2-65d9-414e-9dd2-f5f342979c10
Tomasco, Ermenegildo
7b944585-0193-4dab-861b-8d5cdccf82cd
Parlato, Gennaro
c28428a0-d3f3-4551-a4b5-b79e410f4923

Inverso, Omar, La Torre, Salvatore, Tomasco, Ermenegildo and Parlato, Gennaro (2013) Looking at Computations from a Different Angle University of Southampton (Submitted)

Record type: Monograph (Project Report)

Abstract

We present a novel framework to reason about programs based on encodings of computations as graphs. The main insight here is to rearrange the programs such that given a bound k, each computation can be explored according to any tree decomposition of width k of the corresponding behaviour graph. This produces under-approximations parameterized on k, which result in a complete method when we restrict to classes of behaviour graphs of bounded tree-width. As an additional feature, the transformation of the input program can be targeted to existing tools for the analysis, and thus, off-the-shelf tools based on fixed-point, or capable of analyzing sequential programs with scalar variables and nondeterminism, can be used.
To illustrate our approach, we develop this framework for sequential programs and discuss how to extend it to handle concurrency. For the case of sequential programs, we develop a compositional approach to generate on-the-fly tree decompositions of nested words, which is based on graph-summaries. To illustrate our technique, we also implement our algorithms for C programs.

Text
computations (1).pdf - Other
Download (381kB)

More information

Submitted date: January 2013
Organisations: Electronic & Software Systems

Identifiers

Local EPrints ID: 351913
URI: http://eprints.soton.ac.uk/id/eprint/351913
PURE UUID: e9d8c846-8773-4fdd-81bf-9ff5ebee86c5

Catalogue record

Date deposited: 25 Apr 2013 20:01
Last modified: 14 Mar 2024 13:45

Export record

Contributors

Author: Omar Inverso
Author: Salvatore La Torre
Author: Ermenegildo Tomasco
Author: Gennaro Parlato

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×