Analyzing Innermost Runtime Complexity of Term Rewriting by Dependency PairsNOSCHINSKI, Lars; EMMES, Fabian; GIESL, Jürgen et al.Journal of automated reasoning. 2013, Vol 51, Num 1, pp 27-56, issn 0168-7433, 30 p.Article

Testing for termination with monotonicity constraintsCODISH, Michael; LAGOON, Vitaly; STUCKEY, Peter J et al.Lecture notes in computer science. 2005, pp 326-340, issn 0302-9743, isbn 3-540-29208-X, 1Vol, 15 p.Conference Paper

Termination analysis of logic programs: Extended abstractSEREBRENIK, Alexander.Lecture notes in computer science. 2003, pp 507-508, issn 0302-9743, isbn 3-540-20642-6, 2 p.Conference Paper

Detecting optimal termination conditions of logic programsMESNARD, Fred; PAYET, Etienne; NEUMERKEL, Ulrich et al.Lecture notes in computer science. 2002, pp 509-525, issn 0302-9743, isbn 3-540-44235-9, 17 p.Conference Paper

Binding-time annotations without binding-time analysisVANHOOF, Wim; BRUYNOOGHE, Maurice.Lecture notes in computer science. 2001, pp 707-722, issn 0302-9743, isbn 3-540-42957-3Conference Paper

Automated soundness proofs for dataflow analyses and transformations via local rulesLERNER, Sorin; MILLSTEIN, Todd; RICE, Erika et al.ACM SIGPLAN notices. 2005, Vol 40, Num 1, pp 364-377, issn 1523-2867, 14 p.Conference Paper

Polynomial interpretations as a basis for termination analysis of logic programsMANH THANG NGUYEN; DE SCHREYE, Danny.Lecture notes in computer science. 2005, pp 311-325, issn 0302-9743, isbn 3-540-29208-X, 1Vol, 15 p.Conference Paper

A novel approach to retrosynthetic analysis utilizing knowledge bases derived from reaction databasesFUNATSU, Kimito.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-28894-5, vol1, 169-175Conference Paper

Termination analysis of integer linear loopsBRADLEY, Aaron R; MANNA, Zohar; SIPMA, Henny B et al.Lecture notes in computer science. 2005, pp 488-502, issn 0302-9743, isbn 3-540-28309-9, 15 p.Conference Paper

Termination analysis with types is more accurateLAGOON, Vitaly; MESNARD, Fred; STUCKEY, Peter J et al.Lecture notes in computer science. 2003, pp 254-268, issn 0302-9743, isbn 3-540-20642-6, 15 p.Conference Paper

Program generation, termination, and binding-time analysis (abstract and conclusions of pli invited paper)JONES, Neil D; GLENSTRUP, Arne J.ACM SIGPLAN notices. 2002, Vol 37, Num 9, issn 1523-2867, p. 283Conference Paper

Reuse of results in termination analysis of typed logic programsBRUYNOOGHE, Maurice; CODISH, Michael; GENAIM, Samir et al.Lecture notes in computer science. 2002, pp 477-492, issn 0302-9743, isbn 3-540-44235-9, 16 p.Conference Paper

Size-change termination for term rewritingTHIEMANN, René; GIESL, Jürgen.Lecture notes in computer science. 2003, pp 264-278, issn 0302-9743, isbn 3-540-40254-3, 15 p.Conference Paper

On termination of binary CLP programsSEREBRENIK, Alexander; MESNARD, Fred.Lecture notes in computer science. 2005, pp 231-244, issn 0302-9743, isbn 3-540-26655-0, 14 p.Conference Paper

Deriving linear size relations for logic programs by abstract interpretationDE SCHREYE, D; VERSCHAETSE, K.New generation computing. 1995, Vol 13, Num 2, pp 117-154, issn 0288-3635Article

Dependent Types and Program EquivalenceLIMIN JIA; JIANZHOU ZHAO; SJÖBERG, Vilhelm et al.ACM SIGPLAN notices. 2010, Vol 45, Num 1, pp 275-286, issn 1523-2867, 12 p.Conference Paper

Termination analysis and call graph construction for higher-order functional programsSERENI, Damien.ACM SIGPLAN notices. 2007, Vol 42, Num 9, pp 71-83, issn 1523-2867, 13 p.Conference Paper

Constructing rewrite-based decision procedures for embeddings and terminationSTRUTH, Georg.Lecture notes in computer science. 2006, pp 416-432, issn 0302-9743, isbn 3-540-35631-2, 1Vol, 17 p.Conference Paper

Termination analysis and specialization-point insertion in offline partial evaluationGLENSTRUP, Arne John; JONES, Neil D.ACM transactions on programming languages and systems. 2005, Vol 27, Num 6, pp 1147-1215, issn 0164-0925, 69 p.Article

Inference of well-typings for logic programs with application to termination analysisBRUYNOOGHE, Maurice; GALLAGHER, John; VAN HUMBEECK, Wouter et al.Lecture notes in computer science. 2005, pp 35-51, issn 0302-9743, isbn 3-540-28584-9, 17 p.Conference Paper

Affine-based size-change terminationANDERSON, Hugh; KHOO, Siau-Cheng.Lecture notes in computer science. 2003, pp 122-140, issn 0302-9743, isbn 3-540-20536-5, 19 p.Conference Paper

Active rules termination analysis based on activation path and enhanced formulaZHONGMIN XIONG; MENGLU ZHAO; DONGMEI HUANG et al.International journal of intelligent information and database systems (Print). 2013, Vol 7, Num 1, pp 53-78, issn 1751-5858, 26 p.Article

Reachability Analysis of Program VariablesNIKOLIC, Durica; SPOTO, Fausto.ACM transactions on programming languages and systems. 2013, Vol 35, Num 4, issn 0164-0925, 14.1-14.68Article

A Termination Analyzer for Java Bytecode Based on Path-LengthSPOTO, Fausto; MESNARD, Fred; PAYET, Etienne et al.ACM transactions on programming languages and systems. 2010, Vol 32, Num 3, issn 0164-0925, 8.1-8.70Article

SPEED: Precise and Efficient Static Estimation of Program Computational ComplexityGULWANI, Sumit; MEHRA, Krishna K; CHILIMBI, Trishul et al.ACM SIGPLAN notices. 2009, Vol 44, Num 1, pp 127-139, issn 1523-2867, 13 p.Conference Paper