Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A Dependency Pair Framework for Innermost Complexity Analysis of
 

Summary: A Dependency Pair Framework for
Innermost Complexity Analysis of
Term Rewrite Systems
J¨urgen Giesl
LuFG Informatik 2, RWTH Aachen University, Germany
joint work with Lars Noschinski and Fabian Emmes
Termination Analysis of TRSs
useful for termination of programs (Java, Haskell, Prolog, . . . )
Termination Analysis of TRSs
useful for termination of programs (Java, Haskell, Prolog, . . . )
Dependency Pair Framework
modular combination of different techniques
automatable
Termination Analysis of TRSs
useful for termination of programs (Java, Haskell, Prolog, . . . )
Dependency Pair Framework
modular combination of different techniques
automatable
Complexity Analysis of TRSs
Termination Analysis of TRSs

  

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

 

Collections: Computer Technologies and Information Sciences