scholarly journals Modular Termination Analysis of Java Bytecode and Its Application to phoneME Core Libraries

Author(s):  
D. Ramírez-Deantes ◽  
J. Correas ◽  
G. Puebla
2011 ◽  
Vol 11 (4-5) ◽  
pp. 503-520 ◽  
Author(s):  
MICHAEL CODISH ◽  
IGOR GONOPOLSKIY ◽  
AMIR M. BEN-AMRAM ◽  
CARSTEN FUHS ◽  
JÜRGEN GIESL

AbstractWe describe an algorithm for proving termination of programs abstracted to systems of monotonicity constraints in the integer domain. Monotonicity constraints are a nontrivial extension of the well-known size-change termination method. While deciding termination for systems of monotonicity constraints is PSPACE complete, we focus on a well-defined and significant subset, which we call MCNP (for “monotonicity constraints in NP”), designed to be amenable to a SAT-based solution. Our technique is based on the search for a special type of ranking function defined in terms of bounded differences between multisets of integer values. We describe the application of our approach as the back end for the termination analysis of Java Bytecode. At the front end, systems of monotonicity constraints are obtained by abstracting information, using two different termination analyzers:AProVEandCOSTA. Preliminary results reveal that our approach provides a good trade-off between precision and cost of analysis.


Author(s):  
Elvira Albert ◽  
Puri Arenas ◽  
Michael Codish ◽  
Samir Genaim ◽  
Germán Puebla ◽  
...  

2009 ◽  
Vol 253 (5) ◽  
pp. 83-96 ◽  
Author(s):  
Étienne Payet ◽  
Fausto Spoto

2009 ◽  
Vol 253 (5) ◽  
pp. 129-144 ◽  
Author(s):  
Fausto Spoto ◽  
Lunjin Lu ◽  
Fred Mesnard

2012 ◽  
Vol 35 (1) ◽  
pp. 65-75 ◽  
Author(s):  
Wei XIONG ◽  
Ye WU ◽  
Zhen ZHANG ◽  
Qiu-Yun WU

Author(s):  
Matthias Heizmann ◽  
Jochen Hoenicke ◽  
Andreas Podelski
Keyword(s):  

Author(s):  
Dániel Varró ◽  
Szilvia Varró–Gyapay ◽  
Hartmut Ehrig ◽  
Ulrike Prange ◽  
Gabriele Taentzer

Sign in / Sign up

Export Citation Format

Share Document