Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
SAT-based Termination Analysis for Java Bytecode with AProVE
 

Summary: SAT-based Termination Analysis for
Java Bytecode with AProVE
Carsten Fuhs
LuFG Informatik 2, RWTH Aachen University, Germany
fuhs@informatik.rwth-aachen.de
Abstract. SAT solvers are nowadays the standard solving engines for
the search problems in automated termination analysis. Consequently,
the performance of current termination tools heavily relies on the speed
of modern SAT solvers on the corresponding SAT encodings. If a model
for the SAT instance at hand is found, it can be used to instantiate the
parameters for the current proof step to advance the termination proof.
This SAT benchmark submission has been created using the automated
termination prover AProVE [6]. All instances originate from termination
analysis of Java Bytecode programs. This whole benchmark suite only
consists of satisfiable instances, and any speed-up for SAT solvers on
these instances will directly lead to performance improvements also for
automated termination provers.
1 Introduction
Termination is one of the most important properties of programs. Therefore,
there is a need for suitable methods and tools to analyze the termination be-

  

Source: Ábrahám, Erika - Fachgruppe Informatik, Rheinisch Westfälische Technische Hochschule Aachen (RWTH)

 

Collections: Computer Technologies and Information Sciences