• Home
  • Search
  • Interprocedural Reachability for Flat Integer Programs
  • Open Access IconOpen Access
  • Cite Icon3
  • https://doi.org/10.1007/978-3-319-22177-9_11Copy DOI Icon

Interprocedural Reachability for Flat Integer Programs

  • Jan 1, 2015
  • Pierre Ganty +1 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

We study programs with integer data, procedure calls and arbitrary call graphs. We show that, whenever the guards and updates are given by octagonal relations, the reachability problem along control flow paths within some language \(w_1^* \ldots w_d^*\) over program statements is decidable in Nexptime. To achieve this upper bound, we combine a program transformation into the same class of programs but without procedures, with an Np-completeness result for the reachability problem of procedure-less programs. Besides the program, the expression \(w_1^* \ldots w_d^*\) is also mapped onto an expression of a similar form but this time over the transformed program statements. Several arguments involving context-free grammars and their generative process enable us to give tight bounds on the size of the resulting expression. The currently existing gap between Np-hard and Nexptime can be closed to Np-complete when a certain parameter of the analysis is assumed to be constant.

Similar Papers
  • Conference Article
  • Citations11

An efficient control-oriented coverage metric

  • Jan 01, 2005
  • Shireesh Verma +2
  • Research Article
  • Citations1175

Some NP-complete problems in quadratic and nonlinear programming

  • Jun 01, 1987
  • Mathematical Programming
  • Katta G Murty +1
  • Conference Article
  • Citations263

C-FLAT

  • Oct 24, 2016
  • Tigist Abera +7
  • Dissertation
  • Citations1

Parallelizing unit test execution on GPU

  • Jun 26, 2020
  • Taghreed Bagies
  • Research Article
  • Citations26

Chunks: A basis for complexity measurement

  • Jan 01, 1984
  • Information Processing & Management
  • John S Davis
  • Conference Article
  • Citations7

SUSHI and TARDIS at the SBST2019 Tool Competition

  • May 01, 2019
  • Pietro Braione +1
  • Conference Article
  • Citations2

Automatic precondition verification for high-level design transformations

  • May 01, 1990
  • A Sridhar +1
  • Book Chapter

Parallel Processing Implications for Software Engineering

  • Jan 15, 2002
  • Encyclopedia of Software Engineering
  • Carl G Murphy
  • Conference Article
  • Citations38

S-CAVE: effective SSD caching to improve virtual machine storage performance

  • Oct 01, 2013
  • Rajkishore Barik +2
  • Book Chapter
  • Citations3

A Case Study in Branch Testing Automation

  • Jan 01, 1996
  • A Bertolino +2
  • Research Article
  • Citations15

Delineation of a Saline Ground‐Water Boundary from Borehole Geophysical Data

  • Nov 01, 1995
  • Groundwater
  • Douglas J Schnoebelen +2
  • Research Article
  • Citations9

A reverse engineering model for C programs

  • Feb 01, 1993
  • Information Sciences
  • K Heisler +2
  • Book Chapter
  • Citations5

Proving Properties of Co-logic Programs with Negation by Program Transformations

  • Jan 01, 2013
  • Hirohisa Seki
  • Book Chapter
  • Citations28

Verifying safety properties of a class of infinite-state distributed algorithms

  • Jan 01, 1995
  • Bengt Jonsson +1
  • Conference Article
  • Citations21

Robot on!

  • May 14, 2016
  • Michael A Miljanovic +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.