Loop leaping with closures

  • Authors:

  • Sebastian Biallas;Jörg Brauer;Andy King;Stefan Kowalewski

  • Affiliations:

  • Embedded Software Laboratory, RWTH Aachen University, Germany;Embedded Software Laboratory, RWTH Aachen University, Germany,Verified Systems International GmbH, Bremen, Germany;Portcullis Computer Security, Pinner, UK,School of Computing, University of Kent, UK;Embedded Software Laboratory, RWTH Aachen University, Germany

  • Venue:
  • SAS'12 Proceedings of the 19th international conference on Static Analysis
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Loop leaping is the colloquial name given to a form of program analysis in which summaries are derived for nested loops starting from the innermost loop and proceeding in a bottom-up fashion considering one more loop at a time. Loop leaping contrasts with classical approaches to finding loop invariants that are iterative; loop leaping is compositional requiring each stratum in the nest of loops to be considered exactly once. The approach is attractive in predicate abstraction where disjunctive domains are increasingly used that present long ascending chains. This paper proposes a simple and an efficient approach for loop leaping for these domains based on viewing loops as closure operators.