Search results for "Termination"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
24	Salvatore Ruggieri	Termination of Constraint Logic Programs.	ICALP	1997	DBLP DOI BibTeX RDF
24	Deepak Kapur, G. Sivakumar	A Total, Ground path Ordering for Proving Termination of AC-Rewrite Systems.	RTA	1997	DBLP DOI BibTeX RDF
24	Michael Leuschel, Bern Martens, Konstantinos Sagonas	Preserving Termination of Tabled Logic Programs While Unfolding.	LOPSTR	1997	DBLP DOI BibTeX RDF
24	M. R. K. Krishna Rao	Modularity of Termination in Term Graph Rewriting.	RTA	1996	DBLP DOI BibTeX RDF
24	Thomas Arts, Jürgen Giesl	Termination of Constructor Systems.	RTA	1996	DBLP DOI BibTeX RDF
24	Ten-Hwang Lai, Li-Fen Wu	An (N-1)-Resilient Algorithm for Distributed Termination Detection.	IEEE Trans. Parallel Distributed Syst.	1995	DBLP DOI BibTeX RDF
24	Olav Lysne, Javier Piris	A Termination Ordering for Higher Order Rewrite System.	RTA	1995	DBLP DOI BibTeX RDF
24	Stefan Kahrs	Towards a Domain Theory for Termination Proofs.	RTA	1995	DBLP DOI BibTeX RDF
24	Robert Gold	A Fully Abstract Semantics for Termination in Petri Nets.	MFCS	1994	DBLP DOI BibTeX RDF
24	Aart Middeldorp, Hans Zantema	Simple Termination Revisited.	CADE	1994	DBLP DOI BibTeX RDF
24	Pierre Lescanne	Termination of Rewrite Systems by Elementary Interpretations.	ALP	1992	DBLP DOI BibTeX RDF
24	Torben Amtoft	Unfold/fold Transformations Preserving Termination Properties.	PLILP	1992	DBLP DOI BibTeX RDF
24	Gerard Tel, Friedemann Mattern	The Derivation of Distributed Termination Detection Algorithms from Garbage Collection Schemes.	PARLE (1)	1991	DBLP DOI BibTeX RDF
24	Dieter Hofbauer	Time Bounded Rewrite Systems and Termination Proofs by Generalized Embedding.	RTA	1991	DBLP DOI BibTeX RDF
24	Zbigniew M. Wójcik, Barbara E. Wójcik	Termination condition for a parallel shape coding and a parallel shape coding algorithm.	SPDP	1990	DBLP DOI BibTeX RDF
24	Deepak Kapur, G. Sivakumar, Hantao Zhang 0001	A New Method for Proving Termination of AC-Rewrite Systems.	FSTTCS	1990	DBLP DOI BibTeX RDF
24	Sophie Tison	Fair Termination is Decidable for Ground Systems.	RTA	1989	DBLP DOI BibTeX RDF
24	Jeffrey D. Ullman, Allen Van Gelder	Efficient tests for top-down termination of logical rules.	J. ACM	1988	DBLP DOI BibTeX RDF	Prolog
24	Lutz Plümer	Predicate Inequalities as a Basis for Automated Termination Proofs for Prolog Programs.	CSL	1988	DBLP DOI BibTeX RDF
24	Gerard Tel, Richard B. Tan, Jan van Leeuwen	The Derivation of on-the-fly Garbage Collection Algorithms from Distributed Termination Detection Protocols.	STACS	1987	DBLP DOI BibTeX RDF
24	Brigitte Rozoy	Model and Complexity of Termination for Distributed Computations.	MFCS	1986	DBLP DOI BibTeX RDF
24	David A. Plaisted	A Simple Non-Termination Test for the Knuth-Bendix Method.	CADE	1986	DBLP DOI BibTeX RDF
24	Isabelle Gnaedig, Pierre Lescanne	Proving Termination of Associative Commutative Rewriting Systems by Rewriting.	CADE	1986	DBLP DOI BibTeX RDF
24	Nachum Dershowitz	Termination.	RTA	1985	DBLP DOI BibTeX RDF
24	Daniel Lehmann 0001, Amir Pnueli, Jonathan Stavi	Impartiality, Justice and Fairness: The Ethics of Concurrent Termination.	ICALP	1981	DBLP DOI BibTeX RDF
24	Alberto Pettorossi	Comparing and Putting Together Recursive Path Ordering, Simplification Orderings and Non-Ascending Property for Termination Proofs of Term Rewriting Systems.	ICALP	1981	DBLP DOI BibTeX RDF
24	Eberhard Bergmann	On the Termination of Simple Computer Programs.	MFCS	1976	DBLP DOI BibTeX RDF
23	Xinfang Liao, Yi Liu 0060, Changqing Xu, Chen Wang, Yintang Yang	Comparison in radiation tolerance between FLR planar junction termination and positive bevel edge termination for power diodes.	Microelectron. J.	2022	DBLP DOI BibTeX RDF
23	Christopher Hampson	On the termination and structural termination problems for counter machines with incrementing errors.	J. Comput. Syst. Sci.	2021	DBLP DOI BibTeX RDF
23	Tsubasa Shoshi, Takuma Ishikawa, Naoki Kobayashi 0001, Ken Sakayori, Ryosuke Sato 0001, Takeshi Tsukada	Termination Analysis for the π-Calculus by Reduction to Sequential Program Termination.	CoRR	2021	DBLP BibTeX RDF
23	Tobias Reinhard, Bart Jacobs 0002	Ghost Signals: Verifying Termination of Busy Waiting - Verifying Termination of Busy Waiting.	CAV (2)	2021	DBLP DOI BibTeX RDF
23	Tsubasa Shoshi, Takuma Ishikawa, Naoki Kobayashi 0001, Ken Sakayori, Ryosuke Sato 0001, Takeshi Tsukada	Termination Analysis for the $$\pi $$-Calculus by Reduction to Sequential Program Termination.	APLAS	2021	DBLP DOI BibTeX RDF
23	Ton Chanh Le, Timos Antonopoulos, Parisa Fathololumi, Eric Koskinen, ThanhVu Nguyen	DynamiTe: dynamic termination and non-termination proofs.	Proc. ACM Program. Lang.	2020	DBLP DOI BibTeX RDF
23	Ton Chanh Le, Timos Antonopoulos, Parisa Fathololumi, Eric Koskinen, ThanhVu Nguyen	DynamiTe: Dynamic Termination and Non-termination Proofs.	CoRR	2020	DBLP BibTeX RDF
23	Phuc C. Nguyen, Thomas Gilray, Sam Tobin-Hochstadt, David Van Horn	Size-change termination as a contract: dynamically and statically enforcing termination for higher-order programs.	PLDI	2019	DBLP DOI BibTeX RDF
23	Cristina Borralleras, Marc Brockschmidt, Daniel Larraz, Albert Oliveras, Enric Rodríguez-Carbonell, Albert Rubio	Proving Termination Through Conditional Termination.	TACAS (1)	2017	DBLP DOI BibTeX RDF
23	Ton Chanh Le, Quang-Trung Ta, Wei-Ngan Chin	HipTNT+: A Termination and Non-termination Analyzer by Second-Order Abduction - (Competition Contribution).	TACAS (2)	2017	DBLP DOI BibTeX RDF
23	Cristina David, Daniel Kroening, Matt Lewis	Unrestricted Termination and Non-termination Arguments for Bit-Vector Programs.	ESOP	2015	DBLP DOI BibTeX RDF
23	Ton Chanh Le, Shengchao Qin, Wei-Ngan Chin	Termination and non-termination specification inference.	PLDI	2015	DBLP DOI BibTeX RDF
23	Cristina David, Daniel Kroening, Matt Lewis	Unrestricted Termination and Non-Termination Arguments for Bit-Vector Programs.	CoRR	2014	DBLP BibTeX RDF
23	Ton Chanh Le, Cristian Gherghina, Aquinas Hobor, Wei-Ngan Chin	A Resource-Based Logic for Termination and Non-termination Proofs.	ICFEM	2014	DBLP DOI BibTeX RDF
23	Ton Chanh Le	Preliminary Notes on Termination and Non-Termination Reasoning.	CoRR	2013	DBLP BibTeX RDF
23	Dean Voets	Termination and Non-Termination in Logic Programming (Terminatie en Non-terminatie van Logische Programmeertalen). (PDF / PS)		2013	RDF
23	Alexander Krauss 0001, Christian Sternagel, René Thiemann, Carsten Fuhs, Jürgen Giesl	Termination of Isabelle Functions via Termination of Rewriting.	ITP	2011	DBLP DOI BibTeX RDF
23	Naoki Nishida 0001, Germán Vidal	Termination of narrowing via termination of rewriting.	Appl. Algebra Eng. Commun. Comput.	2010	DBLP DOI BibTeX RDF
23	Keita Uchiyama, Masahiko Sakai, Toshiki Sakabe	Decidability of Termination and Innermost Termination for Term Rewriting Systems with Right-Shallow Dependency Pairs.	IEICE Trans. Inf. Syst.	2010	DBLP DOI BibTeX RDF
23	Aaron Stump, Vilhelm Sjöberg, Stephanie Weirich	Termination Casts: A Flexible Approach to Termination with General Recursion	PAR	2010	DBLP DOI BibTeX RDF
23	Nobuhiro Kuga, Kohei Nemoto	Low-PIM termination design using a resistive termination.	IEICE Electron. Express	2010	DBLP DOI BibTeX RDF
23	Aaron Stump, Vilhelm Sjöberg, Stephanie Weirich	Termination Casts: A Flexible Approach to Termination with General Recursion.	PAR@ITP	2010	DBLP DOI BibTeX RDF
23	Panagiotis Manolios, Daron Vroon 0001	Interactive Termination Proofs Using Termination Cores.	ITP	2010	DBLP DOI BibTeX RDF
23	Keita Uchiyama, Masahiko Sakai, Toshiki Sakabe	Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems.	WRS@RDP	2007	DBLP DOI BibTeX RDF
23	Mirtha-Lina Fernández	On proving CE-termination of rewriting by size-change termination.	Inf. Process. Lett.	2005	DBLP DOI BibTeX RDF
23	Frédéric Mesnard, Étienne Payet, Ulrich Neumerkel	Non-Termination Inference for Optimal Termination Conditions of Logic Programs.	JFPLC	2002	DBLP BibTeX RDF
23	Salvador Lucas	Termination of On-Demand Rewriting and Termination of OBJ Programs.	PPDP	2001	DBLP DOI BibTeX RDF
23	Kees Doets	Left Termination Turned into Termination.	Theor. Comput. Sci.	1994	DBLP DOI BibTeX RDF
23	Michael L. Tiomkin	Probabilistic Termination Versus Fair Termination.	Theor. Comput. Sci.	1989	DBLP DOI BibTeX RDF
23	John V. Guttag, Deepak Kapur, David R. Musser	On Proving Uniform Termination and Restricted Termination of Rewriting Systems.	SIAM J. Comput.	1983	DBLP DOI BibTeX RDF
19	Harald Zankl, Nao Hirokawa, Aart Middeldorp	KBO Orientability.	J. Autom. Reason.	2009	DBLP DOI BibTeX RDF	Knuth-Bendix order, Termination, Term rewriting
19	Sumit Gulwani, Tal Lev-Ami, Mooly Sagiv	A combination framework for tracking partition sizes.	POPL	2009	DBLP DOI BibTeX RDF	combining analyses, set analysis, termination, shape analysis, numerical analysis, memory safety, space bounds
19	Sumit Gulwani, Krishna K. Mehra, Trishul M. Chilimbi	SPEED: precise and efficient static estimation of program computational complexity.	POPL	2009	DBLP DOI BibTeX RDF	counter instrumentation, quantitative functions, symbolic complexity bounds, termination analysis
19	Roberto M. Amadio	On Stratified Regions.	APLAS	2009	DBLP DOI BibTeX RDF	Types and effects, Reducibility candidates, Termination
19	Sumit Gulwani, Sagar Jain, Eric Koskinen	Control-flow refinement and progress invariants for bound analysis.	PLDI	2009	DBLP DOI BibTeX RDF	control-flow refinement, progress invariants, formal verification, program verification, termination, bound analysis
19	Yu-Ming Lee, Yong-Fu Wang, Jia-Ren Wang, Yinyi Lin	An Adaptive and Efficient Selective Multiple Reference Frames Motion Estimation for H.264 Video Coding.	PSIVT	2009	DBLP DOI BibTeX RDF	multiple reference frames, selective multiple reference frames motion estimation (SMRFME), AZB, H.264, region based, early termination
19	Sumit Gulwani, Saurabh Srivastava 0001, Ramarathnam Venkatesan	Program analysis as constraint solving.	PLDI	2008	DBLP DOI BibTeX RDF	most-general counterexamples, non-termination analysis, strongest postcondition, program verification, constraint solving, weakest precondition, bounds analysis
19	Jonathan Billington, Bing Han	Modelling and analysing the functional behaviour of TCP's connection management procedures.	Int. J. Softw. Tools Technol. Transf.	2007	DBLP DOI BibTeX RDF	TCP connection management, Termination property, Deadlocks, Coloured Petri Nets, State space analysis
19	Erich L. Kaltofen, Zhengfeng Yang	On exact and approximate interpolation of sparse rational functions.	ISSAC	2007	DBLP DOI BibTeX RDF	hybrid symbolic-numeric computation, rational vector recovery, sparse rational function interpolation, lattice basis reduction, early termination
19	Raymond T. Boute	Calculational semantics: Deriving programming theories from equations by functional predicate calculus.	ACM Trans. Program. Lang. Syst.	2006	DBLP DOI BibTeX RDF	calculational reasoning, functional predicate calculus, intuitive semantics, strongest postcondition, weakest antecondition, termination, formal semantics, programming theories, Assignment, generic functionals, loops, nondeterminacy, axiomatic semantics
19	Kaushik Chakrabarti, Venkatesh Ganti, Jiawei Han 0001, Dong Xin	Ranking objects based on relationships.	SIGMOD Conference	2006	DBLP DOI BibTeX RDF	ranking, aggregation, keyword search, relationships, named entities, top-k queries, early termination
19	Ke Chen 0001	Adaptive Smoothing via Contextual and Local Discontinuities.	IEEE Trans. Pattern Anal. Mach. Intell.	2005	DBLP DOI BibTeX RDF	inhomogeneity, spatial gradient, local scale control, multiple scales, the termination problem, extraction of hydrographic objects, anisotropic diffusion, noise removal, feature preservation, Adaptive smoothing
19	Tatsuo Arai	Epsilon substitution method for [Pi01, Pi01]-FIX.	Arch. Math. Log.	2005	DBLP DOI BibTeX RDF	Epsilon substitution, Ordinal interpretation, Termination proof
19	Lu Yang, Naijun Zhan, Bican Xia, Chaochen Zhou	Program Verification by Using DISCOVERER.	VSTTE	2005	DBLP DOI BibTeX RDF	semi-algebraic systems, DISCOVERER, reachability computation, program verification, termination, invariant generation
19	J. Guadalupe Ramos, Josep Silva, Germán Vidal	Fast narrowing-driven partial evaluation for inductively sequential programs.	ICFP	2005	DBLP DOI BibTeX RDF	offline partial evaluation, quasi-termination, narrowing
19	Ling Cheung	Randomized Wait-Free Consensus Using an Atomicity Assumption.	OPODIS	2005	DBLP DOI BibTeX RDF	Asynchronous Consensus, Wait-Free Termination, Weak Adversary, Randomized Algorithms, Probabilistic Model Checking
19	David Garrett, Chris Nicol, Andrew J. Blanksby, Chris J. Howland	A low power normalized-LMS decision feedback equalizer for a wireless packet modem.	ISLPED	2002	DBLP DOI BibTeX RDF	NLMS, low power, equalization, early termination
19	Chengxian Xu, Jianzhong Zhang 0001	A Survey of Quasi-Newton Equations and Quasi-Newton Methods for Optimization.	Ann. Oper. Res.	2001	DBLP DOI BibTeX RDF	quasi-Newton equations, finite termination, quasi-Newton methods, convergence properties, positive definiteness
19	Jean Goubault-Larrecq	Well-Founded Recursive Relations.	CSL	2001	DBLP DOI BibTeX RDF	well-foundedness, path orderings, Knuth-Bendix orderings, higher-order path orderings, graphs, automata, Termination, calculus
19	Peter A. Buhr, W. Y. Russell Mok	Advanced Exception Handling Mechanisms.	IEEE Trans. Software Eng.	2000	DBLP DOI BibTeX RDF	resumption, concurrent, object-oriented, robustness, Exception handling, interrupts, termination
19	Jon Whittle 0001, Alan Bundy, Richard J. Boulton, Helen Lowe	An ML Editor Based on Proofs-As-Programs.	ASE	1999	DBLP DOI BibTeX RDF	proofs-as-programs, termination proof, Functional programming
19	Helena Rodrigues, Richard E. Jones	Cyclic Distributed Garbage Collection with Group Merger.	ECOOP	1998	DBLP DOI BibTeX RDF	distributed systems, garbage collection, termination detection
19	Otmane Aït Mohamed, Eduard Cerny, Xiaoyu Song	MDG-based Verification by Retiming and Combinational Transformations.	Great Lakes Symposium on VLSI	1998	DBLP DOI BibTeX RDF	Circuit Transformations, Non-termination, Formal Verification, Retiming, Multiway Decision Graphs
19	Kam Hong Shum	Fault tolerant cluster computing through replication.	ICPADS	1997	DBLP DOI BibTeX RDF	fault tolerant cluster computing, runtime overhead, fault tolerance schemes, checkpoint states, fault tolerant model, Fujitsu AP3000 multi-processor machine, performance evaluation, replication, workstation clusters, workstation cluster, fault recovery, resource consumption, program termination
19	Kim Guldstrand Larsen, Fredrik Larsson, Paul Pettersson, Wang Yi 0001	Efficient verification of real-time systems: compact data structure and state-space reduction.	RTSS	1997	DBLP DOI BibTeX RDF	real-time systems verification, clock values, clock constraints, real-valued variables, static analysis, timed automata, termination, reachability analysis, reachability analysis, state-space reduction, compact data structure
19	Andrea Clematis, Vittoria Gianuzzi	CPVM - Extending PVM for Consistent Checkpointing.	PDP	1996	DBLP DOI BibTeX RDF	CPVM, consistent checkpointing, global checkpoint-restart algorithms, job-swapping, parallel programming, software tools, concurrency control, migration, deadlocks, termination, software fault tolerance, software fault-tolerance, software libraries, software library, PVM, Parallel Virtual Machine, software portability, nonblocking
19	Pietro Camarda, G. Schiraldi, Fabrizio Talucci	Mobility Modeling in Cellular Communication Networks.	LCN	1996	DBLP DOI BibTeX RDF	cellular communication networks, finite population, fixed channel allocation, users distribution, new call blocking probability, hand-off blocking probability, forced termination probability, unsuccessful probability, performance evaluation, analytical model, mobility modeling, system performance, numerical simulation, cellular radio, load conditions
19	Soong Hee Lee	A Reactive Access Control Scheme at UNI for Congestion Control in ATM-Based B-ISDN.	LCN	1996	DBLP DOI BibTeX RDF	reactive access control scheme, UNI, ATM-based B-ISDN, active traffic sources, feedback traffic, GFC field, B-NT system, network congestion state, probability of overflow, node output buffer, generic flow control, broadband network termination, user network interface, performance evaluation, asynchronous transfer mode, congestion control, computer simulation
19	Kazuaki Rokusawa, Akihiko Nakase, Takashi Chikayama	Quiescence Detection in a Distributed KLIC Implementation.	Euro-Par	1995	DBLP DOI BibTeX RDF	quiescence detection, distributed implementation, weighted reference counting, termination detection, concurrent logic programming
19	J. Roger Mitchell, Vijay K. Garg	Deriving distributed algorithms from a general predicate detector.	COMPSAC	1995	DBLP DOI BibTeX RDF	generalized conjunctive predicate detector, distributed system debugging, condition detection, application status monitoring, periodic global virtual time calculation, optimized base algorithm, software engineering, computational complexity, distributed algorithms, distributed algorithms, program debugging, system monitoring, termination detection, virtual time, distributed system design, detection algorithms
19	Jay J. Lee, Kwi-Yung Jung	An algorithm for determining the feasibility of SONET/ATM rings in broadband networks.	ICCCN	1995	DBLP DOI BibTeX RDF	SONET/ATM rings, synchronous optical network, self-healing ring architecture, economical broadband networks, survivable broadband networks, nonhierarchical path multiplexing, diverse protection architecture, ATM/add-drop multiplexer, VP-based ATM rings, SONET ADM, ATM STS-3c line cards, STS-3 termination cards, reference network databases, demand routing, algorithm, asynchronous transfer mode, simulation results, traffic, network connectivity, broadband networks, network size, virtual path, SONET, cost savings
19	Vijay K. Garg, Craig M. Chase, J. Roger Mitchell, Richard B. Kilgore	Detecting conjunctive channel predicates in a distributed programming environment.	HICSS (2)	1995	DBLP DOI BibTeX RDF	conjunctive channel predicates detection, efficient global predicate detection, local predicates, global virtual time computation, distributed processing, message passing, Boolean functions, programming environments, communication complexity, programming theory, monotonicity, message complexity, Boolean formula, termination detection, telecommunication channels, distributed programming environment
19	Annalisa Bossi, Sandro Etalle	Transforming Acyclic Programs.	ACM Trans. Program. Lang. Syst.	1994	DBLP DOI BibTeX RDF	acyclic programs, terminating programs, termination
18	Fan Zhang 0092, Shuming Shi 0001, Hao Yan, Ji-Rong Wen	Revisiting globally sorted indexes for efficient document retrieval.	WSDM	2010	DBLP DOI BibTeX RDF	dynamic index pruning, globally-sorted index, top-k
18	Georg Moser	The Hydra battle and Cichon's principle.	Appl. Algebra Eng. Commun. Comput.	2009	DBLP DOI BibTeX RDF
18	Kousha Etessami, Mihalis Yannakakis	Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations.	J. ACM	2009	DBLP DOI BibTeX RDF	Recursive Markov chains, monotone nonlinear systems, multi-type branching processes, Newton's method, stochastic context-free grammars
18	René Thiemann, Christian Sternagel	Loops under Strategies.	RTA	2009	DBLP DOI BibTeX RDF
18	Takahito Aoto 0001, Toshiyuki Yamada	Argument Filterings and Usable Rules for Simply Typed Dependency Pairs.	FroCoS	2009	DBLP DOI BibTeX RDF
18	Amir Pnueli	Using Abstraction to Verify Arbitrary Temporal Properties.	APSEC	2008	DBLP DOI BibTeX RDF
18	Stephan Falke 0001, Deepak Kapur	Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures.	RTA	2008	DBLP DOI BibTeX RDF
18	Ralph Matthes	Recursion on Nested Datatypes in Dependent Type Theory.	CiE	2008	DBLP DOI BibTeX RDF
18	Harald Zankl, Aart Middeldorp	Increasing Interpretations.	AISC/MKM/Calculemus	2008	DBLP DOI BibTeX RDF	Related Topics implementations of symbolic computation systems, logic and symbolic computing
18	Stephen D. Patek	Partially Observed Stochastic Shortest Path Problems With Approximate Solution by Neurodynamic Programming.	IEEE Trans. Syst. Man Cybern. Part A	2007	DBLP DOI BibTeX RDF