Skip to main content
Kent Academic Repository

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. (doi:10.1007/978-3-642-33125-1_16) (KAR id:30791)

PDF (Loop Leaping with Closures. SAS 2012: 214-230 Lecture Notes in Computer Science ISBN 978-3-642-33124-4)
Language: English
Download this file
(PDF/247kB)
[thumbnail of Loop Leaping with Closures. SAS 2012: 214-230 Lecture Notes in Computer Science ISBN 978-3-642-33124-4]
Preview
Request a format suitable for use with assistive technology e.g. a screenreader
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
DOI/Identification number: 10.1007/978-3-642-33125-1_16
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: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Andy King
Date Deposited: 21 Sep 2012 09:49 UTC
Last Modified: 09 Mar 2023 11:32 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/30791 (The current URI for this page, for reference purposes)

University of Kent Author Information

  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.