|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 1898 occurrences of 1118 keywords
|
|
|
Results
Found 4055 publication records. Showing 4055 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
44 | Junya Kudoh, Toshiro Takahashi, Yukio Umada, Masaharu Kimura, Shigeru Yamamoto, Youichi Ito |
A CMOS gate array with dynamic-termination GTL I/O circuits. |
ICCD |
1995 |
DBLP DOI BibTeX RDF |
CMOS gate array, dynamic-termination GTL I/O circuits, triple-metal-layer process technology, push-pull output driver, dynamic termination receiver, 250 Mb/s data, stub line, terminated bus line, IDDQ testability, differential receiver, delay time overheads, 0.5 micron, 250 Mbit/s, logic testing, delays, CMOS logic circuits, logic arrays |
44 | Hans Zantema, Alfons Geser |
A Complete Characterization of Termination of Op 1q -> 1r Os. |
RTA |
1995 |
DBLP DOI BibTeX RDF |
simple termination, transformation ordering, dummy elimination, derivation length, termination, term rewriting, string rewriting |
44 | Antti Ylä-Jääski, Nahum Kiryati |
Adaptive Termination of Voting in the Probabilistic Circular Hough Transform. |
IEEE Trans. Pattern Anal. Mach. Intell. |
1994 |
DBLP DOI BibTeX RDF |
adaptive termination, probabilistic circular Hough transform, small random poll, computational savings, risk of errors, peaks, voting termination, adaptive stopping, probability, edge detection, objects detection, Hough transforms, noisy image, decisions, parameter space, edge points |
44 | Mengjun Li, Ti Zhou, Zhoujun Li 0001 |
SPVT-II: An Efficient Security Protocol Verifier Based on Logic Programming. |
Inscrypt |
2008 |
DBLP DOI BibTeX RDF |
non-termination characterization and prediction, abstract and refinement, security protocol |
44 | Makoto Hamana |
Higher-order semantic labelling for inductive datatype systems. |
PPDP |
2007 |
DBLP DOI BibTeX RDF |
categorical semantics, higher-order rewriting, modularity, termination, higher-order abstract syntax, initial algebra semantics |
44 | Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke 0001 |
Mechanizing and Improving Dependency Pairs. |
J. Autom. Reason. |
2006 |
DBLP DOI BibTeX RDF |
termination, term rewriting, dependency pairs |
44 | Jonathan I. Leivent, Ronald J. Watro |
Mathematical Foundations of Time Warp Systems. |
ACM Trans. Program. Lang. Syst. |
1993 |
DBLP DOI BibTeX RDF |
concurrency control, checkpoint, Time Warp, rollback, termination detection |
44 | Pierre Lescanne |
Computer Experiments with the Reve Term Rewriting System Generator. |
POPL |
1983 |
DBLP DOI BibTeX RDF |
program verifier, termination, abstract data types, induction, term rewriting systems, theorem prover, equational theories, word problem |
43 | Jörg Endrullis, Johannes Waldmann, Hans Zantema |
Matrix Interpretations for Proving Termination of Term Rewriting. |
J. Autom. Reason. |
2008 |
DBLP DOI BibTeX RDF |
Matrix interpretations, Satisfiability, Termination, Term rewriting |
43 | Neeraj Mittal, Subbarayan Venkatesan, Sathya Peri |
A family of optimal termination detection algorithms. |
Distributed Comput. |
2007 |
DBLP DOI BibTeX RDF |
Monitoring distributed system, Arbitrary communication topology, Diffusing and non-diffusing computations, Simultaneous and delayed initiations, Single-hop and multi-hop application messages, Optimal algorithm, Termination detection |
43 | Byron Cook, Andreas Podelski, Andrey Rybalchenko |
Proving thread termination. |
PLDI |
2007 |
DBLP DOI BibTeX RDF |
model checking, concurrency, formal verification, program verification, threads, termination |
43 | Jingyu Zhou, Tao Yang 0009 |
Selective early request termination for busy internet services. |
WWW |
2006 |
DBLP DOI BibTeX RDF |
request termination, internet services, load shedding |
43 | Byron Cook, Andreas Podelski, Andrey Rybalchenko |
Termination proofs for systems code. |
PLDI |
2006 |
DBLP DOI BibTeX RDF |
model checking, formal verification, program verification, program termination |
43 | Dániel Varró, Szilvia Varró-Gyapay, Hartmut Ehrig, Ulrike Prange, Gabriele Taentzer |
Termination Analysis of Model Transformations by Petri Nets. |
ICGT |
2006 |
DBLP DOI BibTeX RDF |
Petri nets, model transformation, termination, graph transformation |
43 | Evelyne Contejean, Claude Marché, Ana Paula Tomás, Xavier Urbain |
Mechanically Proving Termination Using Polynomial Interpretations. |
J. Autom. Reason. |
2005 |
DBLP DOI BibTeX RDF |
polynomial interpretations, termination, term rewriting |
43 | Jeremy E. Dawson, Rajeev Goré |
A General Theorem on Termination of Rewriting. |
CSL |
2004 |
DBLP DOI BibTeX RDF |
well-founded ordering, recursive path ordering, termination, rewriting |
43 | Roberta Gori |
An Abstract Interpretation Approach to Termination of Logic Programs. |
LPAR |
2000 |
DBLP DOI BibTeX RDF |
Infinite derivations, Universal termination, Logic programming, Abstract interpretation |
43 | Can Türker, Kerstin Schwarz, Gunter Saake |
Global Transaction Termination Rules in Composite Database Systems. |
BNCOD |
2000 |
DBLP DOI BibTeX RDF |
global transactions, composite database systems, extensional assertions, termination dependencies |
43 | Danilo Montesi, Maria Bagnato, Cristina Dallera |
Termination Analysis in Active Databases. |
IDEAS |
1999 |
DBLP DOI BibTeX RDF |
rules termination, static analysis, active databases |
43 | Annalisa Bossi, Nicoletta Cocco |
Preserving Universal Termination through Unfold/Fold. |
ALP |
1994 |
DBLP DOI BibTeX RDF |
universal termination, program transformations |
42 | René Thiemann, Christian Sternagel |
Certification of Termination Proofs Using CeTA. |
TPHOLs |
2009 |
DBLP DOI BibTeX RDF |
|
42 | Felix Schernhammer, Bernhard Gramlich |
VMTL-A Modular Termination Laboratory. |
RTA |
2009 |
DBLP DOI BibTeX RDF |
|
42 | Guillem Godoy, Eduard Huntingford, Ashish Tiwari 0001 |
Termination of Rewriting with Right-Flat Rules. |
RTA |
2007 |
DBLP DOI BibTeX RDF |
|
42 | Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio |
Higher-Order Termination: From Kruskal to Computability. |
LPAR |
2006 |
DBLP DOI BibTeX RDF |
|
42 | Josh Berdine, Byron Cook, Dino Distefano, Peter W. O'Hearn |
Automatic Termination Proofs for Programs with Shape-Shifting Heaps. |
CAV |
2006 |
DBLP DOI BibTeX RDF |
|
42 | Michael Codish, Vitaly Lagoon, Peter Schachte, Peter J. Stuckey |
Size-Change Termination Analysis in k-Bits. |
ESOP |
2006 |
DBLP DOI BibTeX RDF |
|
42 | Jörg Endrullis, Johannes Waldmann, Hans Zantema |
Matrix Interpretations for Proving Termination of Term Rewriting. |
IJCAR |
2006 |
DBLP DOI BibTeX RDF |
|
42 | Maurice Bruynooghe, John P. Gallagher, Wouter Van Humbeeck |
Inference of Well-Typings for Logic Programs with Application to Termination Analysis. |
SAS |
2005 |
DBLP DOI BibTeX RDF |
|
42 | Jan-Georg Smaus |
Termination of Logic Programs Using Various Dynamic Selection Rules. |
ICLP |
2004 |
DBLP DOI BibTeX RDF |
|
42 | Étienne Payet, Frédéric Mesnard |
Non-termination Inference for Constraint Logic Programs. |
SAS |
2004 |
DBLP DOI BibTeX RDF |
|
42 | Vitaly Lagoon, Frédéric Mesnard, Peter J. Stuckey |
Termination Analysis with Types Is More Accurate. |
ICLP |
2003 |
DBLP DOI BibTeX RDF |
|
42 | René Thiemann, Jürgen Giesl |
Size-Change Termination for Term Rewriting. |
RTA |
2003 |
DBLP DOI BibTeX RDF |
|
42 | Alexander Serebrenik, Danny De Schreye |
Proving Termination with Adornments. |
LOPSTR |
2003 |
DBLP DOI BibTeX RDF |
|
42 | Alexander Serebrenik, Danny De Schreye |
On Termination of Logic Programs with Floating Point Computations. |
SAS |
2002 |
DBLP DOI BibTeX RDF |
|
42 | Alain Couchot |
Improving Termination Analysis of Active Rules with Composite Events. |
DEXA |
2001 |
DBLP DOI BibTeX RDF |
|
42 | Brigitte Pientka |
Termination and Reduction Checking for Higher-Order Logic Programs. |
IJCAR |
2001 |
DBLP DOI BibTeX RDF |
|
42 | Indrakshi Ray, Indrajit Ray |
Detecting Termination of Active Database Rules Using Symbolic Model Checking. |
ADBIS |
2001 |
DBLP DOI BibTeX RDF |
|
42 | Thom W. Frühwirth |
Proving Termination of Constraint Solver Programs. |
New Trends in Constraints |
1999 |
DBLP DOI BibTeX RDF |
|
42 | Fairouz Kamareddine, François Monin |
On Automating Inductive and Non-inductive Termination Methods. |
ASIAN |
1999 |
DBLP DOI BibTeX RDF |
|
42 | Claus Sengler |
Termination of Algorithms over Non-freely Generated Data Types. |
CADE |
1996 |
DBLP DOI BibTeX RDF |
|
42 | Bernhard Gramlich |
On Modularity of Termination and Confluence Properties of Conditional Rewrite Systems. |
ALP |
1994 |
DBLP DOI BibTeX RDF |
|
42 | Aart Middeldorp, Bernhard Gramlich |
Simple Termination is Difficult. |
RTA |
1993 |
DBLP DOI BibTeX RDF |
|
42 | M. R. K. Krishna Rao, Deepak Kapur, R. K. Shyamasundar |
A Transformational Methodology for Proving Termination of Logic Programs. |
CSL |
1991 |
DBLP DOI BibTeX RDF |
|
42 | Leo Bachmair, Nachum Dershowitz |
Commutation, Transformation, and Termination. |
CADE |
1986 |
DBLP DOI BibTeX RDF |
|
42 | Francis Y. L. Chin, K. V. S. Ramarao |
Optimal Termination Prococols for Network Partitioning. |
PODS |
1983 |
DBLP DOI BibTeX RDF |
|
39 | Jean-Pierre Jouannaud, Albert Rubio |
Polymorphic higher-order recursive path orderings. |
J. ACM |
2007 |
DBLP DOI BibTeX RDF |
Automated termination prover tool, Gödel's polymorphic recursor, higher-order rewriting, termination orderings, typed lambda calculus |
39 | Dino Pedreschi, Salvatore Ruggieri |
Bounded Nondeterminism of Logic Programs. |
Ann. Math. Artif. Intell. |
2004 |
DBLP DOI BibTeX RDF |
universal termination, bounded nondeterminism, strong termination, logic programming |
38 | Salvador Lucas, José Meseguer 0001 |
Order-sorted dependency pairs. |
PPDP |
2008 |
DBLP DOI BibTeX RDF |
program analysis, termination, term rewriting |
38 | Raúl Gutiérrez, Salvador Lucas, Xavier Urbain |
Usable Rules for Context-Sensitive Rewrite Systems. |
RTA |
2008 |
DBLP DOI BibTeX RDF |
termination, term rewriting, Dependency pairs |
38 | Danny De Schreye, Alexander Serebrenik |
Acceptability with General Orderings. |
Computational Logic: Logic Programming and Beyond |
2002 |
DBLP DOI BibTeX RDF |
orderings, acceptability, termination analysis |
38 | Jürgen Giesl, Thomas Arts |
Verification of Erlang Processes by Dependency Pairs. |
Appl. Algebra Eng. Commun. Comput. |
2001 |
DBLP DOI BibTeX RDF |
Verification, Distributed processes, Termination, Rewriting |
37 | Ashutosh Gupta 0001, Thomas A. Henzinger, Rupak Majumdar, Andrey Rybalchenko, Ru-Gang Xu |
Proving non-termination. |
POPL |
2008 |
DBLP DOI BibTeX RDF |
non-termination, recurrent sets, model checking, testing, program verification |
37 | Isabelle Gnaedig |
Induction for positive almost sure termination. |
PPDP |
2007 |
DBLP DOI BibTeX RDF |
constraint, probability, abstraction, termination, narrowing |
37 | Panagiotis Manolios, Daron Vroon 0001 |
Integrating static analysis and general-purpose theorem proving for termination analysis. |
ICSE |
2006 |
DBLP DOI BibTeX RDF |
static analysis, theorem proving, termination, liveness, ACL2 |
37 | Annalisa Bossi, Sandro Etalle, Sabina Rossi, Jan-Georg Smaus |
Termination of simply moded logic programs with dynamic scheduling. |
ACM Trans. Comput. Log. |
2004 |
DBLP DOI BibTeX RDF |
simply moded, Logic programs, termination, dynamic scheduling |
37 | Yi-Dong Shen, Jia-Huai You, Li-Yan Yuan, Samuel S. P. Shen, Qiang Yang 0001 |
A dynamic approach to characterizing termination of general logic programs. |
ACM Trans. Comput. Log. |
2003 |
DBLP DOI BibTeX RDF |
dynamic characterization, Prolog, Termination analysis |
37 | Sara Comai, Letizia Tanca |
Termination and Confluence by Rule Prioritization. |
IEEE Trans. Knowl. Data Eng. |
2003 |
DBLP DOI BibTeX RDF |
database dynamics, deductive databases, termination, determinism, Active databases |
37 | Wayne Eberly |
Early termination over small fields. |
ISSAC |
2003 |
DBLP DOI BibTeX RDF |
Lanczos algorithm, linear system solution, randomized algorithm, finite field, Berlekamp-Massey algorithm, early termination, black box matrix |
37 | Michael Leuschel |
Homeomorphic Embedding for Online Termination of Symbolic Methods. |
The Essence of Computation |
2002 |
DBLP DOI BibTeX RDF |
Specialisation and Transformation, Functional & Logic Programming, Infinite Model Checking, Logic Programming, Program Analysis, Termination, Metaprogramming, Well-quasi orders |
37 | Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner |
System Presentation -- CARIBOO: An induction based proof tool for termination with strategies. |
PPDP |
2002 |
DBLP DOI BibTeX RDF |
ELAN, innermost, local strategy, rule based language induction, constraint, termination, rewriting, ordering, narrowing |
37 | Dieter Hofbauer |
Termination Proofs for Ground Rewrite Systems - Interpretations and Derivational Complexity. |
Appl. Algebra Eng. Commun. Comput. |
2001 |
DBLP DOI BibTeX RDF |
Ground rewriting, Termination proofs, Derivational complexity, Term rewriting systems |
37 | Michael Leuschel |
Improving Homeomorphic Embedding for Online Termination. |
LOPSTR |
1998 |
DBLP DOI BibTeX RDF |
Specialisation and Transformation, Functional & Logic Programming, Logic Programming, Program Analysis, Termination, Well-quasi orders |
37 | Ho-fung Leung, Hing-Fung Ting |
An Optimal Algorithm for Global Termination Detection in Shared-Memory Asynchronous Multiprocessor Systems. |
IEEE Trans. Parallel Distributed Syst. |
1997 |
DBLP DOI BibTeX RDF |
optimality, Termination detect, shared-memory multiprocessor systems |
36 | Jörg Endrullis, Dimitri Hendriks |
From Outermost to Context-Sensitive Rewriting. |
RTA |
2009 |
DBLP DOI BibTeX RDF |
|
36 | Christian Sternagel, Aart Middeldorp |
Root-Labeling. |
RTA |
2008 |
DBLP DOI BibTeX RDF |
|
36 | Cristina Borralleras, Salvador Lucas, Albert Rubio |
Recursive Path Orderings Can Be Context-Sensitive. |
CADE |
2002 |
DBLP DOI BibTeX RDF |
|
36 | Morten Heine Sørensen |
Convergence of Program Transformers in the Metric Space of Trees. |
MPC |
1998 |
DBLP DOI BibTeX RDF |
|
36 | Paolo Pilozzi, Danny De Schreye |
Automating Termination Proofs for CHR. |
ICLP |
2009 |
DBLP DOI BibTeX RDF |
|
36 | Stephan Swiderski, Michael Parting, Jürgen Giesl, Carsten Fuhs, Peter Schneider-Kamp |
Termination Analysis by Dependency Pairs and Inductive Theorem Proving. |
CADE |
2009 |
DBLP DOI BibTeX RDF |
|
36 | Stephan Falke 0001, Deepak Kapur |
A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs. |
CADE |
2009 |
DBLP DOI BibTeX RDF |
|
36 | Tsz-Yeung Wong, Man Hon Wong 0001, John C. S. Lui |
A Precise Termination Condition of the Probabilistic Packet Marking Algorithm. |
IEEE Trans. Dependable Secur. Comput. |
2008 |
DBLP DOI BibTeX RDF |
Network-level security and protection, Probabilistic computation |
36 | María Alpuente, Santiago Escobar 0001, José Iborra |
Termination of Narrowing Using Dependency Pairs. |
ICLP |
2008 |
DBLP DOI BibTeX RDF |
|
36 | Gilles Barthe, Benjamin Grégoire, Colin Riba |
A Tutorial on Type-Based Termination. |
LerNet ALFA Summer School |
2008 |
DBLP DOI BibTeX RDF |
|
36 | Helga Velroyen, Philipp Rümmer |
Non-termination Checking for Imperative Programs. |
TAP |
2008 |
DBLP DOI BibTeX RDF |
|
36 | Yen-Sung Michael Lee, Shahriar Mirabbasi |
Design of an active-inductor-based termination circuit for high-speed I/O. |
ISCAS |
2008 |
DBLP DOI BibTeX RDF |
|
36 | María Alpuente, Santiago Escobar 0001, José Iborra |
Modular Termination of Basic Narrowing. |
RTA |
2008 |
DBLP DOI BibTeX RDF |
|
36 | Aslan Askarov, Sebastian Hunt, Andrei Sabelfeld, David Sands 0001 |
Termination-Insensitive Noninterference Leaks More Than Just a Bit. |
ESORICS |
2008 |
DBLP DOI BibTeX RDF |
|
36 | Gilles Barthe, Benjamin Grégoire, Colin Riba |
Type-Based Termination with Sized Products. |
CSL |
2008 |
DBLP DOI BibTeX RDF |
|
36 | Ronald F. DeMara, Yili Tseng, Abdel Ejnioui |
Tiered Algorithm for Distributed Process Quiescence and Termination Detection. |
IEEE Trans. Parallel Distributed Syst. |
2007 |
DBLP DOI BibTeX RDF |
Parallel Processing, Synchronization, Distributed Programming, Multitasking, Distributed Architectures |
36 | Ngai Ming Kwok, Quang Phuc Ha, Dikai Liu, Gu Fang, Kay Chen Tan |
Efficient particle swarm optimization: a termination condition based on the decision-making approach. |
IEEE Congress on Evolutionary Computation |
2007 |
DBLP DOI BibTeX RDF |
|
36 | Mark Braverman |
Termination of Integer Linear Programs. |
CAV |
2006 |
DBLP DOI BibTeX RDF |
|
36 | James Avery |
Size-Change Termination and Bound Analysis. |
FLOPS |
2006 |
DBLP DOI BibTeX RDF |
|
36 | Feng Chen 0006, Grigore Rosu |
Parametric and Termination-Sensitive Control Dependence. |
SAS |
2006 |
DBLP DOI BibTeX RDF |
|
36 | Stefan Leue, Wei Wei 0015 |
A Region Graph Based Approach to Termination Proofs. |
TACAS |
2006 |
DBLP DOI BibTeX RDF |
|
36 | Neeraj Mittal, Kuppahalli L. Phaneesh, Felix C. Freiling |
Safe Termination Detection in an Asynchronous Distributed System When Processes May Crash and Recover. |
OPODIS |
2006 |
DBLP DOI BibTeX RDF |
|
36 | Jürgen Giesl, Stephan Swiderski, Peter Schneider-Kamp, René Thiemann |
Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages. |
RTA |
2006 |
DBLP DOI BibTeX RDF |
|
36 | Damien Sereni, Neil D. Jones |
Termination Analysis of Higher-Order Functional Programs. |
APLAS |
2005 |
DBLP DOI BibTeX RDF |
|
36 | Zhongmin Xiong, Zhongxiao Hao |
Refined Rules Termination Analysis Through Activation Path. |
WAIM |
2005 |
DBLP DOI BibTeX RDF |
|
36 | Michael Codish, Vitaly Lagoon, Peter J. Stuckey |
Testing for Termination with Monotonicity Constraints. |
ICLP |
2005 |
DBLP DOI BibTeX RDF |
|
36 | Neeraj Mittal, Felix C. Freiling, Subbarayan Venkatesan, Lucia Draque Penso |
Efficient Reduction for Wait-Free Termination Detection in a Crash-Prone Distributed System. |
DISC |
2005 |
DBLP DOI BibTeX RDF |
|
36 | Nao Hirokawa, Aart Middeldorp |
Tyrolean Termination Tool. |
RTA |
2005 |
DBLP DOI BibTeX RDF |
|
36 | Ashish Tiwari 0001 |
Termination of Linear Programs. |
CAV |
2004 |
DBLP DOI BibTeX RDF |
|
36 | Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke 0001 |
Automated Termination Proofs with AProVE. |
RTA |
2004 |
DBLP DOI BibTeX RDF |
|
36 | Alain Couchot |
Termination Analysis of Active Rules with Priorities. |
DEXA |
2003 |
DBLP DOI BibTeX RDF |
|
36 | Floris Geerts, Bart Kuijpers |
Deciding Termination of Query Evaluation in Transitive-Closure Logics for Constraint Databases. |
ICDT |
2003 |
DBLP DOI BibTeX RDF |
|
36 | Elisa Bertino, Danilo Montesi, Maria Bagnato, Peter A. Dearnley |
Rules Termination Analysis investigating the interaction between transactions and triggers. |
IDEAS |
2002 |
DBLP DOI BibTeX RDF |
|
36 | Alexander Serebrenik, Danny De Schreye |
Inference of Termination Conditions for Numerical Loops in Prolog. |
LPAR |
2001 |
DBLP DOI BibTeX RDF |
|
36 | Jürgen Brauburger, Jürgen Giesl |
Termination Analysis by Inductive Evaluation. |
CADE |
1998 |
DBLP DOI BibTeX RDF |
|
36 | Kerstin Schwarz, Can Türker, Gunter Saake |
Extending Transaction Closures by N-ary Termination Dependencies. |
ADBIS |
1998 |
DBLP DOI BibTeX RDF |
|
36 | Sin Yeung Lee, Tok Wang Ling |
A Path Removing Technique for Detecting Trigger Termination. |
EDBT |
1998 |
DBLP DOI BibTeX RDF |
|
Displaying result #101 - #200 of 4055 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ >>] |
|