Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Lazy Abstraction for Size-Change Termination Michael Codish1
 

Summary: Lazy Abstraction for Size-Change Termination
Michael Codish1
, Carsten Fuhs2
, J¨urgen Giesl2
, and Peter Schneider-Kamp3
1
Department of Computer Science, Ben-Gurion University, Israel
2
LuFG Informatik 2, RWTH Aachen University, Germany
3
IMADA, University of Southern Denmark, Odense, Denmark
Abstract. Size-change termination is a widely used means of proving
termination where source programs are first abstracted to size-change
graphs which are then analyzed to determine if they satisfy the size-
change termination property. Here, the choice of the abstraction is crucial
to the success of the method, and it is an open problem how to choose
an abstraction such that no critical loss of precision occurs. This paper
shows how to couple the search for a suitable abstraction and the test for
size-change termination via an encoding to a single SAT instance. In this
way, the problem of choosing the right abstraction is solved en passant

  

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

 

Collections: Computer Technologies and Information Sciences