Loop Leaping with Closures

Biallas, Sebastian and Brauer, Jorg and King, Andy and Kowalewski, Stefan (2012) Loop Leaping with Closures. In: Min'e, Antoine and Schmidt, David A., eds. Static Analysis Symposium. Lecture Notes in Computer Science, 7460 . Springer, pp. 214-230. ISBN 978-3-642-33124-4. (Full text available)

PDF (Loop Leaping with Closures. SAS 2012: 214-230 Lecture Notes in Computer Science ISBN 978-3-642-33124-4)
Download (241kB) Preview
[img]
Preview
Official URL
http://www.cs.kent.ac.uk/pubs/2012/3230

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.

Item Type: Book section
Additional information: ARCoSS subline
Uncontrolled keywords: abstract interpretation, predicate abstraction, bottom-up, compositional analysis
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Science Technology and Medical Studies > School of Computing > Programming Languages and Systems Group
Depositing User: Andy King
Date Deposited: 21 Sep 2012 09:49
Last Modified: 12 Dec 2013 12:15
Resource URI: http://kar.kent.ac.uk/id/eprint/30791 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year