Summarization for termination: no return!

Authors:
Byron Cook;Andreas Podelski;Andrey Rybalchenko
Affiliations:
Microsoft Research, Cambridge, UK and Queen Mary, University of London, London, UK;University of Freiburg, Freiburg, Germany;Max Planck Institute for Software Systems (MPI-SWS), Saarbrücken, Germany
Venue:
Formal Methods in System Design
Year:
2009

Citing 29
Cited 9

Predicate calculus and program semantics

Predicate calculus and program semantics
Abstract debugging of higher-order imperative languages

PLDI '93 Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation
Precise interprocedural dataflow analysis via graph reachability

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Efficient algorithms for pre* and post* on interprocedural parallel flow graphs

Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The size-change principle for program termination

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Bebop: a path-sensitive interprocedural dataflow engine

PASTE '01 Proceedings of the 2001 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
Bebop: A Symbolic Model Checker for Boolean Programs

Proceedings of the 7th International SPIN Workshop on SPIN Model Checking and Software Verification
Reachability Analysis of Pushdown Automata: Application to Model-Checking

CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Efficient Algorithms for Model Checking Pushdown Systems

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Practical Methods for Proving Program Termination

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Summarizing procedures in concurrent programs

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The set constraint/CFL reachability connection in practice

Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation
Visibly pushdown languages

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Transition Invariants

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Transition predicate abstraction and fair termination

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Transition predicate abstraction and fair termination

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Analysis of recursive state machines

ACM Transactions on Programming Languages and Systems (TOPLAS)
A fixpoint calculus for local and global program flows

Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Weighted pushdown systems and their application to interprocedural dataflow analysis

Science of Computer Programming - Special issue: Static analysis symposium (SAS 2003)
Termination proofs for systems code

Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
Interprocedural analysis of asynchronous programs

Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proving non-termination

Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Program analysis using weighted pushdown systems

FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Interprocedural analysis of concurrent programs under a context bound

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Interprocedural shape analysis with separated heap abstractions

SAS'06 Proceedings of the 13th international conference on Static Analysis
Termination of polynomial programs

VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Improving pushdown system model checking

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Termination analysis with calling context graphs

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
ARMC: the logical choice for software model checking with abstraction refinement

PADL'07 Proceedings of the 9th international conference on Practical Aspects of Declarative Languages

Size-change termination and transition invariants

SAS'10 Proceedings of the 17th international conference on Static analysis
Metric spaces and termination analyses

APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
Loop summarization and termination analysis

TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
An abstract interpretation framework for termination

POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Temporal reasoning for procedural programs

VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
Synthesizing software verifiers from proof rules

Proceedings of the 33rd ACM SIGPLAN conference on Programming Language Design and Implementation
Precise enforcement of progress-sensitive security

Proceedings of the 2012 ACM conference on Computer and communications security
Underapproximation of procedure summaries for integer programs

TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Loop summarization using state and transition invariants

Formal Methods in System Design

Quantified Score

Hi-index	0.01

Visualization

Abstract

We propose a program analysis method for proving termination of recursive programs. The analysis is based on a reduction of termination to two separate problems: reachability of recursive programs, and termination of non-recursive programs. Our reduction works through a program transformation that modifies the call sites and removes return edges. In the new, non-recursive program, a procedure call may non-deterministically enter the procedure body (which means that it will never return) or apply a summary statement.