Integrating static analysis and general-purpose theorem proving for termination analysis

Authors:
Panagiotis Manolios;Daron Vroon
Affiliations:
Georgia Institute of Technology;Georgia Institute of Technology
Venue:
Proceedings of the 28th international conference on Software engineering
Year:
2006

Citing 11
Cited 2

SSA is functional programming

ACM SIGPLAN Notices
Termination of term rewriting using dependency pairs

Theoretical Computer Science - Trees in algebra and programming
The size-change principle for program termination

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Automatically validating temporal safety properties of interfaces

SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
Extended static checking for Java

PLDI '02 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation
Computer-Aided Reasoning: An Approach

Computer-Aided Reasoning: An Approach
Automated Termination Proofs with Measure Functions

KI '95 Proceedings of the 19th Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
Ordinal Arithmetic: Algorithms and Mechanization

Journal of Automated Reasoning
Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation

VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Proving program invariance and termination by parametric abstraction, lagrangian relaxation and semidefinite programming

VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Termination of polynomial programs

VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation

A termination analyzer for Java bytecode based on path-length

ACM Transactions on Programming Languages and Systems (TOPLAS)
Termination analysis with calling context graphs

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present emerging results from our work on termination analysis of software systems. We have designed a static analysis algorithm which attains increased precision and flexibility by issuing queries to a theorem prover. We have implemented our algorithm and initial results show that we obtain a significant improvement over the current state-of-the-art in termination analyses. We also outline how our approach, by integrating theorem proving queries into static analyses, can significantly impact the design of general-purpose static analyses.