Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Article
|
Control-Flow Refinement by Partial Evaluation, and its Application to Termination and Cost AnalysisTheory and practice of logic programming, 2019-09, Vol.19 (5-6), p.990-1005 [Peer Reviewed Journal]Cambridge University Press 2019 ;ISSN: 1471-0684 ;EISSN: 1475-3081 ;DOI: 10.1017/S1471068419000310Full text available |
|
2 |
Material Type: Article
|
Restricted Chase Termination for Existential Rules: A Hierarchical Approach and ExperimentationTheory and practice of logic programming, 2021-01, Vol.21 (1), p.4-50 [Peer Reviewed Journal]Copyright © The Author(s), 2020. Published by Cambridge University Press ;ISSN: 1471-0684 ;EISSN: 1475-3081 ;DOI: 10.1017/S1471068420000101Full text available |
|
3 |
Material Type: Article
|
Resource Analysis driven by (Conditional) Termination ProofsTheory and practice of logic programming, 2019-09, Vol.19 (5-6), p.722-739 [Peer Reviewed Journal]Cambridge University Press 2019 ;ISSN: 1471-0684 ;EISSN: 1475-3081 ;DOI: 10.1017/S1471068419000152Full text available |
|
4 |
Material Type: Article
|
Detecting multiphase linear ranking functions for single-path linear-constraint loopsInternational journal on software tools for technology transfer, 2021-02, Vol.23 (1), p.55-67 [Peer Reviewed Journal]Springer-Verlag GmbH Germany, part of Springer Nature 2019 ;International Journal on Software Tools for Technology Transfer is a copyright of Springer, (2019). All Rights Reserved. ;Springer-Verlag GmbH Germany, part of Springer Nature 2019. ;ISSN: 1433-2779 ;EISSN: 1433-2787 ;DOI: 10.1007/s10009-019-00527-1Full text available |
|
5 |
Material Type: Article
|
Analyzing Innermost Runtime Complexity of Term Rewriting by Dependency PairsJournal of automated reasoning, 2013-06, Vol.51 (1), p.27-56 [Peer Reviewed Journal]Springer Science+Business Media Dordrecht 2013 ;ISSN: 0168-7433 ;EISSN: 1573-0670 ;DOI: 10.1007/s10817-013-9277-6Full text available |
|
6 |
Material Type: Article
|
Ranking Function Detection via SVM: A More General MethodIEEE access, 2019, Vol.7, p.9971-9979 [Peer Reviewed Journal]Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2019 ;ISSN: 2169-3536 ;EISSN: 2169-3536 ;DOI: 10.1109/ACCESS.2018.2890692 ;CODEN: IAECCGFull text available |
|
7 |
Material Type: Article
|
A practical analysis of non-termination in large logic programsTheory and practice of logic programming, 2013-07, Vol.13 (4-5), p.705-719 [Peer Reviewed Journal]Copyright © 2013 [SENLIN LIANG and MICHAEL KIFER] ;ISSN: 1471-0684 ;EISSN: 1475-3081 ;DOI: 10.1017/S1471068413000446Full text available |
|
8 |
Material Type: Conference Proceeding
|
On the Linear Ranking Problem for Simple Floating-Point LoopsLecture Notes in Computer Science, Proceedings of the 23rd International Symposium on Static Analysis (SAS), 2016, Vol.9837, p.300-316 [Peer Reviewed Journal]Distributed under a Creative Commons Attribution 4.0 International License ;DOI: 10.1007/978-3-662-53413-7_15Digital Resources/Online E-Resources |
|
9 |
Material Type: Article
|
Automated termination analysis for logic programs with cutTheory and practice of logic programming, 2010-07, Vol.10 (4-6), p.365-381 [Peer Reviewed Journal]Copyright © Cambridge University Press 2010 ;ISSN: 1471-0684 ;EISSN: 1475-3081 ;DOI: 10.1017/S1471068410000165Full text available |
|
10 |
Material Type: Article
|
DISCOVERING NON-TERMINATING INPUTS FOR MULTI-PATH POLYNOMIAL PROGRAMSJournal of systems science and complexity, 2014-12, Vol.27 (6), p.1286-1304 [Peer Reviewed Journal]Institute of Systems Science, Academy of Mathematics and Systems Science, CAS and Springer-Verlag Berlin Heidelberg 2014 ;ISSN: 1009-6124 ;EISSN: 1559-7067 ;DOI: 10.1007/s11424-014-2145-6Full text available |
|
11 |
Material Type: Book Chapter
|
Terminyzer: An Automatic Non-termination Analyzer for Large Logic ProgramsPractical Aspects of Declarative Languages, p.173-189 [Peer Reviewed Journal]Springer-Verlag Berlin Heidelberg 2013 ;ISSN: 0302-9743 ;ISBN: 9783642452833 ;ISBN: 3642452833 ;EISSN: 1611-3349 ;EISBN: 9783642452840 ;EISBN: 3642452841 ;DOI: 10.1007/978-3-642-45284-0_12Full text available |
|
12 |
Material Type: Article
|
Polytool: Polynomial interpretations as a basis for termination analysis of logic programsTheory and practice of logic programming, 2011-01, Vol.11 (1), p.33-63 [Peer Reviewed Journal]Copyright © Cambridge University Press 2010 ;ISSN: 1471-0684 ;EISSN: 1475-3081 ;DOI: 10.1017/S1471068410000025Full text available |
|
13 |
Material Type: Article
|
Non-termination analysis of logic programs with integer arithmeticsTheory and practice of logic programming, 2011-07, Vol.11 (4-5), p.521-536 [Peer Reviewed Journal]Copyright © Cambridge University Press 2011 ;ISSN: 1471-0684 ;EISSN: 1475-3081 ;DOI: 10.1017/S1471068411000159Full text available |
|
14 |
Material Type: Article
|
SAT-based termination analysis using monotonicity constraints over the integersTheory and practice of logic programming, 2011-07, Vol.11 (4-5), p.503-520 [Peer Reviewed Journal]Copyright © Cambridge University Press 2011 ;ISSN: 1471-0684 ;EISSN: 1475-3081 ;DOI: 10.1017/S1471068411000147Full text available |
|
15 |
Material Type: Article
|
Call-by-value Termination in the Untyped lambda-calculusLogical methods in computer science, 2008-03, Vol.4, Issue 1 [Peer Reviewed Journal]ISSN: 1860-5974 ;EISSN: 1860-5974 ;DOI: 10.2168/LMCS-4(1:3)2008Full text available |
|
16 |
Material Type: Article
|
On termination of meta-programsTheory and practice of logic programming, 2005-05, Vol.5 (3), p.355-390 [Peer Reviewed Journal]2005 Cambridge University Press ;ISSN: 1471-0684 ;EISSN: 1475-3081 ;DOI: 10.1017/S1471068404002248Full text available |
|
17 |
Material Type: Book Chapter
|
Acceptability with General OrderingsComputational Logic: Logic Programming and Beyond, p.187-210 [Peer Reviewed Journal]Springer-Verlag Berlin Heidelberg 2002 ;ISSN: 0302-9743 ;ISBN: 9783540439592 ;ISBN: 3540439595 ;EISSN: 1611-3349 ;EISBN: 9783540456285 ;EISBN: 3540456287 ;DOI: 10.1007/3-540-45628-7_9Full text available |
|
18 |
Material Type: Article
|
Inference of termination conditions for numerical loops in PrologTheory and practice of logic programming, 2004-09, Vol.4 (5-6), p.719-751 [Peer Reviewed Journal]2004 Cambridge University Press ;ISSN: 1471-0684 ;EISSN: 1475-3081 ;DOI: 10.1017/S1471068404002042Full text available |
|
19 |
Material Type: Article
|
Inferring termination conditions for logic programs using backwards analysisTheory and practice of logic programming, 2005-01, Vol.5 (1-2), p.75-91 [Peer Reviewed Journal]2005 Cambridge University Press ;ISSN: 1471-0684 ;EISSN: 1475-3081 ;DOI: 10.1017/S1471068404002236Full text available |
|
20 |
Material Type: Thesises (postgraduate)
|
Analyses de terminaison des calculs flottantsDigital Resources/Online E-Resources |