Biallas, Sebastian and Brauer, J''org and King, Andy and Kowalewski, Stefan (2012) Proof Appendix for Loop Leaping with Closures. Technical report. , School of Computing
| The full text of this publication is not available from this repository. (Contact us about this Publication) | |
| Official URL http://www.cs.kent.ac.uk/pubs/2012/3231 |
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: | Monograph (Technical report) |
|---|---|
| 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: | 21 Sep 2012 09:49 |
| Resource URI: | http://kar.kent.ac.uk/id/eprint/30814 (The current URI for this page, for reference purposes) |
- Depositors only (login required):
