Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
36 | Michael Codish, Cohavit Taboch |
A Semantic Basis for Termination Analysis of Logic Programs and Its Realization Using Symbolic Norm Constraints. |
ALP/HOA |
1997 |
DBLP DOI BibTeX RDF |
|
36 | Thomas Arts, Jürgen Giesl |
Automatically Proving Termination Where Simplification Orderings Fail. |
TAPSOFT |
1997 |
DBLP DOI BibTeX RDF |
|
36 | Hans Zantema |
Termination of Context-Sensitive Rewriting. |
RTA |
1997 |
DBLP DOI BibTeX RDF |
|
36 | Gianni Aguzzi, U. Modigliani |
Proving Termination of Logic Programs by Transforming them into Equivalent Term Rewriting Systems. |
FSTTCS |
1993 |
DBLP DOI BibTeX RDF |
|
36 | Isabelle Gnaedig |
Termination of Order-sorted Rewriting. |
ALP |
1992 |
DBLP DOI BibTeX RDF |
|
36 | Martin Rudalics |
Distributed Termination Enforcement. |
PARLE |
1992 |
DBLP DOI BibTeX RDF |
|
36 | Domenico Talia |
Notes on termination of OCCAM processes. |
ACM SIGPLAN Notices |
1990 |
DBLP DOI BibTeX RDF |
OCCAM |
32 | Alessandro Armando, Maria Paola Bonacina, Silvio Ranise, Stephan Schulz 0001 |
New results on rewrite-based satisfiability procedures. |
ACM Trans. Comput. Log. |
2009 |
DBLP DOI BibTeX RDF |
combination of theories, satisfiability modulo a theory, scalability, inference, termination, Automated reasoning, decision procedures, rewriting, superposition |
32 | René Thiemann, Hans Zantema, Jürgen Giesl, Peter Schneider-Kamp |
Adding constants to string rewriting. |
Appl. Algebra Eng. Commun. Comput. |
2008 |
DBLP DOI BibTeX RDF |
Termination, Term rewriting, Confluence, String rewriting |
32 | Keiichirou Kusakari, Masahiko Sakai |
Enhancing dependency pair method using strong computability in simply-typed term rewriting. |
Appl. Algebra Eng. Commun. Comput. |
2007 |
DBLP DOI BibTeX RDF |
Simply-typed term rewriting system, Plain function- passing, Strong computability, Termination, Dependency pair |
32 | Josh Berdine, Aziem Chawdhary, Byron Cook, Dino Distefano, Peter W. O'Hearn |
Variance analyses from invariance analyses. |
POPL |
2007 |
DBLP DOI BibTeX RDF |
formal verification, program analysis, termination, liveness, software model checking |
32 | Keiichirou Kusakari, Masaki Nakamura 0001, Yoshihito Toyama |
Elimination Transformations for Associative-Commutative Rewriting Systems. |
J. Autom. Reason. |
2006 |
DBLP DOI BibTeX RDF |
(AC-)termination, (AC-)dependency pair, argument filtering, elimination transformation |
32 | Étienne Payet, Frédéric Mesnard |
Nontermination inference of logic programs. |
ACM Trans. Program. Lang. Syst. |
2006 |
DBLP DOI BibTeX RDF |
nontermination analysis, optimal termination condition, Logic programming, static analysis |
32 | Ingo Lepper |
Simply terminating rewrite systems with long derivations. |
Arch. Math. Log. |
2004 |
DBLP DOI BibTeX RDF |
Simple termination, Hardy hierarchy, Fundamental sequence, Hydra |
31 | Isabelle Gnaedig, Hélène Kirchner |
Termination of rewriting under strategies. |
ACM Trans. Comput. Log. |
2009 |
DBLP DOI BibTeX RDF |
innermost, local strategy, outermost, Abstraction, termination, induction, narrowing, ordering constraint |
31 | Andreas Blass, Yuri Gurevich |
Program termination and well partial orderings. |
ACM Trans. Comput. Log. |
2008 |
DBLP DOI BibTeX RDF |
covering observation, game criterion, well partial orderings, Program termination |
31 | Mike Livesey, Ronald Morrison, David S. Munro |
The Doomsday distributed termination detection protocol. |
Distributed Comput. |
2007 |
DBLP DOI BibTeX RDF |
Distributed termination detection, Protocols, Correctness |
31 | Andreas Podelski, Andrey Rybalchenko |
Transition predicate abstraction and fair termination. |
ACM Trans. Program. Lang. Syst. |
2007 |
DBLP DOI BibTeX RDF |
fair termination, transition predicate abstraction, liveness, Software model checking |
31 | Salvador Lucas |
On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting. |
Appl. Algebra Eng. Commun. Comput. |
2006 |
DBLP DOI BibTeX RDF |
Polynomial orderings, Program analysis, Termination, Term rewriting |
31 | Tien-Ying Kuo, Hsin-Ju Lu |
Efficient H.264 Encoding Based on Skip Mode Early Termination. |
PSIVT |
2006 |
DBLP DOI BibTeX RDF |
variable block size motion compensation, skip mode, H.264, early termination |
31 | Gruia-Catalin Roman, Jamie Payton |
A Termination Detection Protocol for Use in Mobile Ad Hoc Networks. |
Autom. Softw. Eng. |
2005 |
DBLP DOI BibTeX RDF |
algorithm, ad hoc network, mobile computing, termination detection, diffusing computation |
31 | Andreas Podelski, Andrey Rybalchenko |
Transition predicate abstraction and fair termination. |
POPL |
2005 |
DBLP DOI BibTeX RDF |
fair termination, transition predicate abstraction, liveness, software model checking |
31 | Xinli Wang, Jean Mayo |
A General Model for Detecting Distributed Termination in Dynamic Systems. |
IPDPS |
2004 |
DBLP DOI BibTeX RDF |
distributed termination detection, general model |
31 | Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner |
Simplification and termination of strategies in rule-based languages. |
PPDP |
2003 |
DBLP DOI BibTeX RDF |
termination, strategies, rewriting, rule based languages, program simplification |
31 | Hans Zantema |
The Termination Hierarchy for Term Rewriting. |
Appl. Algebra Eng. Commun. Comput. |
2001 |
DBLP DOI BibTeX RDF |
Monotone algebras, Termination, Term rewriting, String rewriting |
31 | Yu-Chee Tseng, Cheng-Chung Tan |
Termination Detection Protocols for Mobile Distributed Systems. |
IEEE Trans. Parallel Distributed Syst. |
2001 |
DBLP DOI BibTeX RDF |
mobile computing, wireless network, Distributed computing, operating system, distributed protocol, termination detection |
31 | E. A. Cichon, Hélène Touzet |
An Ordinal Calculus for Proving Termination in Term Rewriting. |
CAAP |
1996 |
DBLP DOI BibTeX RDF |
ordinal recursion, termination, rewrite systems, primitive recursion |
31 | W. Eric L. Grimson |
The Combinatorics of Heuristic Search Termination for Object Recognition in Cluttered Environments. |
IEEE Trans. Pattern Anal. Mach. Intell. |
1991 |
DBLP DOI BibTeX RDF |
constrained search model, heuristic search termination, scene clutter, pattern recognition, pattern recognition, picture processing, optimisation, search problems, combinatorics |
31 | Annalisa Bossi, Nicoletta Cocco, Massimo Fabris |
Proving Termination of Logic Programs by Exploiting Term Properties. |
TAPSOFT, Vol.2 |
1991 |
DBLP DOI BibTeX RDF |
Prolog programs, norm on terms, pre/post specifications, termination |
30 | Jonathan C. Martin, Andy King |
On the Inference of Natural Level Mappings. |
Program Development in Computational Logic |
2004 |
DBLP DOI BibTeX RDF |
|
30 | Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke 0001 |
Improving Dependency Pairs. |
LPAR |
2003 |
DBLP DOI BibTeX RDF |
|
30 | Yahia Rabih, Michel Schneider |
Analysis of Active Database Rules Behavior Using Rewriting Logic. |
DEXA |
1999 |
DBLP DOI BibTeX RDF |
|
30 | Albert R. Meyer, John C. Mitchell |
Axiomatic Definability and Completeness for Recursive Programs. |
POPL |
1982 |
DBLP DOI BibTeX RDF |
|
30 | Bruno Marnette, Floris Geerts |
Static analysis of schema-mappings ensuring oblivious termination. |
ICDT |
2010 |
DBLP DOI BibTeX RDF |
relative completeness, data integration, data exchange, schema mapping, determinacy |
30 | Amir M. Ben-Amram |
A complexity tradeoff in ranking-function termination proofs. |
Acta Informatica |
2009 |
DBLP DOI BibTeX RDF |
|
30 | Paolo Pilozzi, Danny De Schreye |
Proving Termination by Invariance Relations. |
ICLP |
2009 |
DBLP DOI BibTeX RDF |
|
30 | Haruhiko Sato, Sarah Winkler, Masahito Kurihara, Aart Middeldorp |
Multi-completion with Termination Tools (System Description). |
IJCAR |
2008 |
DBLP DOI BibTeX RDF |
|
30 | Germán Vidal |
Termination of Narrowing in Left-Linear Constructor Systems. |
FLOPS |
2008 |
DBLP DOI BibTeX RDF |
|
30 | Amir M. Ben-Amram, Michael Codish |
A SAT-Based Approach to Size Change Termination with Global Ranking Functions. |
TACAS |
2008 |
DBLP DOI BibTeX RDF |
|
30 | Gianluigi Zavattaro, Luca Cardelli |
Termination Problems in Chemical Kinetics. |
CONCUR |
2008 |
DBLP DOI BibTeX RDF |
|
30 | Adam Koprowski, Hans Zantema |
Certification of Proving Termination of Term Rewriting by Matrix Interpretations. |
SOFSEM |
2008 |
DBLP DOI BibTeX RDF |
|
30 | Jürgen Giesl, René Thiemann, Stephan Swiderski, Peter Schneider-Kamp |
Proving Termination by Bounded Increase. |
CADE |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Elvira Albert, Puri Arenas, Samir Genaim, German Puebla, Damiano Zanardini |
COSTA: Design and Implementation of a Cost and Termination Analyzer for Java Bytecode. |
FMCO |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Hans Zantema, Johannes Waldmann |
Termination by Quasi-periodic Interpretations. |
RTA |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Claude Marché, Hans Zantema |
The Termination Competition. |
RTA |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Manh Thang Nguyen, Jürgen Giesl, Peter Schneider-Kamp, Danny De Schreye |
Termination Analysis of Logic Programs Based on Dependency Graphs. |
LOPSTR |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Domagoj Babic, Alan J. Hu, Zvonimir Rakamaric, Byron Cook |
Proving Termination by Divergence. |
SEFM |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Thomas S. John, Arumugam Nallanathan, Marc André Armand |
A non-resampling sequential monte carlo detector for coded OFDM systems based on periodic termination of differential phase trellis. |
IEEE Trans. Wirel. Commun. |
2006 |
DBLP DOI BibTeX RDF |
|
30 | Georg Struth |
Constructing Rewrite-Based Decision Procedures for Embeddings and Termination. |
MPC |
2006 |
DBLP DOI BibTeX RDF |
|
30 | Jürgen Giesl, Peter Schneider-Kamp, René Thiemann |
Automatic Termination Proofs in the Dependency Pair Framework. |
IJCAR |
2006 |
DBLP DOI BibTeX RDF |
|
30 | Adam Koprowski |
TPA: Termination Proved Automatically. |
RTA |
2006 |
DBLP DOI BibTeX RDF |
|
30 | Yi Wang, Masahiko Sakai |
Decidability of Termination for Semi-constructor TRSs, Left-Linear Shallow TRSs and Related Systems. |
RTA |
2006 |
DBLP DOI BibTeX RDF |
|
30 | Ian Wehrman, Aaron Stump, Edwin M. Westbrook |
Slothrop: Knuth-Bendix Completion with a Modern Termination Checker. |
RTA |
2006 |
DBLP DOI BibTeX RDF |
|
30 | Iddo Hanniel, Gershon Elber |
Subdivision Termination Criteria in Subdivision Multivariate Solvers. |
GMP |
2006 |
DBLP DOI BibTeX RDF |
|
30 | Manh Thang Nguyen, Danny De Schreye |
Polytool: Proving Termination Automatically Based on Polynomial Interpretations. |
LOPSTR |
2006 |
DBLP DOI BibTeX RDF |
|
30 | Byron Cook, Andreas Podelski, Andrey Rybalchenko |
Abstraction Refinement for Termination. |
SAS |
2005 |
DBLP DOI BibTeX RDF |
|
30 | Aaron R. Bradley, Zohar Manna, Henny B. Sipma |
Termination of Polynomial Programs. |
VMCAI |
2005 |
DBLP DOI BibTeX RDF |
|
30 | Christoph Walther, Stephan Schweitzer |
Automated Termination Analysis for Incompletely Defined Programs. |
LPAR |
2004 |
DBLP DOI BibTeX RDF |
|
30 | Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema |
Finding Finite Automata That Certify Termination of String Rewriting. |
CIAA |
2004 |
DBLP DOI BibTeX RDF |
|
30 | Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik |
Proving Termination for Logic Programs by the Query-Mapping Pairs Approach. |
Program Development in Computational Logic |
2004 |
DBLP DOI BibTeX RDF |
|
30 | Alexander Serebrenik |
Termination Analysis of Logic Programs: Extended Abstract. |
ICLP |
2003 |
DBLP DOI BibTeX RDF |
|
30 | Takahito Aoto 0001, Toshiyuki Yamada |
Termination of Simply Typed Term Rewriting by Translation and Labelling. |
RTA |
2003 |
DBLP DOI BibTeX RDF |
|
30 | Tshiamo Motshegwa, Michael Schroeder 0001 |
Interaction Monitoring and Termination Detection for Agent Societies: Preliminary Results. |
ESAW |
2003 |
DBLP DOI BibTeX RDF |
|
30 | Paolo Mancarella, Dino Pedreschi, Salvatore Ruggieri |
Negation as Failure through Abduction: Reasoning about Termination. |
Computational Logic: Logic Programming and Beyond |
2002 |
DBLP DOI BibTeX RDF |
|
30 | Gideon Stupp |
Stateless Termination Detection. |
DISC |
2002 |
DBLP DOI BibTeX RDF |
|
30 | Maurice Bruynooghe, Michael Codish, Samir Genaim, Wim Vanhoof |
Reuse of Results in Termination Analysis of Typed Logic Programs. |
SAS |
2002 |
DBLP DOI BibTeX RDF |
|
30 | Alain Couchot |
Improving the Refined Triggering Graph Method for Active Rules Termination Analysis. |
BNCOD |
2002 |
DBLP DOI BibTeX RDF |
|
30 | Yehuda Lindell, Anna Lysyanskaya, Tal Rabin |
Sequential composition of protocols without simultaneous termination. |
PODC |
2002 |
DBLP DOI BibTeX RDF |
|
30 | Jos C. M. Baeten, Erik P. de Vink |
Axiomatizing GSOS with Termination. |
STACS |
2002 |
DBLP DOI BibTeX RDF |
|
30 | Samir Genaim, Michael Codish, John P. Gallagher, Vitaly Lagoon |
Combining Norms to Prove Termination. |
VMCAI |
2002 |
DBLP DOI BibTeX RDF |
|
30 | Eiji Uchibe, Masakazu Yanase, Minoru Asada |
Evolutionary Behavior Selection with Activation/Termination Constraints. |
RoboCup |
2001 |
DBLP DOI BibTeX RDF |
|
30 | Xavier Urbain |
Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems. |
IJCAR |
2001 |
DBLP DOI BibTeX RDF |
|
30 | Saumya K. Debray, Timothy J. Hickey |
Constraint-Based Termination Analysis for Cyclic Active Database Rules. |
Computational Logic |
2000 |
DBLP DOI BibTeX RDF |
|
30 | Timothy Sherwood, Brad Calder |
Loop Termination Prediction. |
ISHPC |
2000 |
DBLP DOI BibTeX RDF |
|
30 | Litong Song, Yoshihiko Futamura |
A New Termination Approach for Specialization. |
SAIG |
2000 |
DBLP DOI BibTeX RDF |
|
30 | James Bailey 0001, Alexandra Poulovassilis |
An Abstract Interpretation Framework for Termination Analysis of Active Rules. |
DBPL |
1999 |
DBLP DOI BibTeX RDF |
|
30 | Rohini Gupta, John Willis, Lawrence T. Pileggi |
Analytic termination metrics for pin-to-pin lossy transmission lines with nonlinear drivers. |
IEEE Trans. Very Large Scale Integr. Syst. |
1998 |
DBLP DOI BibTeX RDF |
|
30 | Sébastien Hoarau, Frédéric Mesnard |
Inferring and Compiling Termination for Constraint Logic Programs. |
LOPSTR |
1998 |
DBLP DOI BibTeX RDF |
|
30 | Sin Yeung Lee, Tok Wang Ling |
Refined Termination Decision in Active Databases. |
DEXA |
1997 |
DBLP DOI BibTeX RDF |
|
30 | James Bailey 0001, Lobel Crnogorac, Kotagiri Ramamohanarao, Harald Søndergaard |
Abstract Interpretation of Active Rules and its Use in Termination Analysis. |
ICDT |
1997 |
DBLP DOI BibTeX RDF |
|
30 | Stefaan Decorte, Danny De Schreye, Michael Leuschel, Bern Martens, Konstantinos Sagonas |
Termination Analysis for Tabled Logic Programming. |
LOPSTR |
1997 |
DBLP DOI BibTeX RDF |
|
30 | Aart Middeldorp, Hitoshi Ohsaki, Hans Zantema |
Transforming Termination by Self-Labelling. |
CADE |
1996 |
DBLP DOI BibTeX RDF |
|
30 | Thomas Kolbe, Christoph Walther |
Termination of Theorem Proving by Reuse. |
CADE |
1996 |
DBLP DOI BibTeX RDF |
|
30 | Thomas Arts |
Termination by Absence of Infinite Chains of Dependency Pairs. |
CAAP |
1996 |
DBLP DOI BibTeX RDF |
|
30 | Detlef Plump |
On Termination of Graph Rewriting. |
WG |
1995 |
DBLP DOI BibTeX RDF |
|
30 | Géraud Sénizergues |
Some Undecidable Termination Problems for Semi-Thue Systems (Abstract). |
RTA |
1993 |
DBLP DOI BibTeX RDF |
|
30 | Bernhard Gramlich |
Generalized Sufficient Conditions for Modular Termination of Rewriting. |
ALP |
1992 |
DBLP DOI BibTeX RDF |
|
30 | Bal Wang, R. K. Shyamasundar |
Methodology for Proving the Termination of Logic Programs. |
STACS |
1991 |
DBLP DOI BibTeX RDF |
|
30 | Frank Drewes, Clemens Lautemann |
Incremental Termination Proofs and the Length of Derivations. |
RTA |
1991 |
DBLP DOI BibTeX RDF |
|
30 | Pawel Paczkowski |
Proving Termination of Communicating Programs. |
CONCUR |
1990 |
DBLP DOI BibTeX RDF |
|
30 | Dieter Hofbauer, Clemens Lautemann |
Termination Proofs and the Length of Derivations (Preliminary Version). |
RTA |
1989 |
DBLP DOI BibTeX RDF |
|
30 | Christoph Walther |
Argument-Bounded Algorithms as a Basis for Automated Termination Proofs. |
CADE |
1988 |
DBLP DOI BibTeX RDF |
|
30 | Ahlem Ben Cherifa, Pierre Lescanne |
An Actual Implementation of a Procedure That Mechanically Proves Termination of Rewriting Systems Based on Inequalities Between Polynomial Interpretations. |
CADE |
1986 |
DBLP DOI BibTeX RDF |
|
25 | Stephen Magill, Ming-Hsien Tsai 0001, Peter Lee 0001, Yih-Kuen Tsay |
Automatic numeric abstractions for heap-manipulating programs. |
POPL |
2010 |
DBLP DOI BibTeX RDF |
abstraction, program verification, termination, shape analysis, separation logic |
25 | Rupesh Tulshyan, Ramnik Arora, Kalyanmoy Deb, Joydeep Dutta |
Investigating EA solutions for approximate KKT conditions in smooth problems. |
GECCO |
2010 |
DBLP DOI BibTeX RDF |
karush-kuhn-tucker conditions, termination condition, nonlinear programming, evolutionary optimization |
25 | Klaus-Dieter Schewe, Bernhard Thalheim, Qing Wang 0002 |
Customising Web Information Systems According to User Preferences. |
World Wide Web |
2009 |
DBLP DOI BibTeX RDF |
critical pair completion, media type, deontic constraint, preference rule, termination, term rewriting, personalisation, web information system, Church-Rosser property, Kleene algebra with tests |
25 | Cristina Borralleras, Salvador Lucas, Rafael Navarro-Marset, Enric Rodríguez-Carbonell, Albert Rubio |
Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic. |
CADE |
2009 |
DBLP DOI BibTeX RDF |
polynomial constraints, SAT modulo theories, program analysis, termination, Constraint solving |
25 | Ravi Kumar 0001, Kunal Punera, Torsten Suel, Sergei Vassilvitskii |
Top-k aggregation using intersections of ranked inputs. |
WSDM |
2009 |
DBLP DOI BibTeX RDF |
NRA, TA, intersections, early-termination |
25 | Chuanlin Zhang, Kam-yiu Lam, Weijia Jia 0001 |
Bandwidth Reservation Using Velocity and Handoff Statistics for Cellular Networks. |
J. Comput. Sci. Technol. |
2006 |
DBLP DOI BibTeX RDF |
forced termination rate, mobile communication, bandwidth reservation |
25 | Alfons Geser, Dieter Hofbauer, Johannes Waldmann |
Match-Bounded String Rewriting Systems. |
Appl. Algebra Eng. Commun. Comput. |
2004 |
DBLP DOI BibTeX RDF |
Match-bounded, Termination, Semi-Thue System, String Rewriting System |