Search results for "Termination"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
92	Bernhard Gramlich, Salvador Lucas	Simple termination of context-sensitive rewriting.	ACM SIGPLAN Workshop on Rule-Based Programming	2002	DBLP DOI BibTeX RDF	automatic proofs of termination, context-sensitive rewriting, modular program analysis and verification, declarative programming, evaluation strategies
86	Sofie Verbaeten, Danny De Schreye	Termination of Simply-Moded Well-Typed Logic Programs under a Tabled Execution Mechanism.	Appl. Algebra Eng. Commun. Comput.	2001	DBLP DOI BibTeX RDF	Logic Programming, Termination, Tabling
84	René Thiemann, Jürgen Giesl, Peter Schneider-Kamp	Improved Modular Termination Proofs Using Dependency Pairs.	IJCAR	2004	DBLP DOI BibTeX RDF
84	Tzilla Elrad, N. Krishna Kumar, James R. Kenevan	Modeling distributed termination with pre-defined partial termination ordering.	SPDP	1990	DBLP DOI BibTeX RDF
80	Salvador Lucas, José Meseguer 0001	Termination of Fair Computations in Term Rewriting.	LPAR	2005	DBLP DOI BibTeX RDF	fairness, program analysis, Concurrent programming, termination, term rewriting
75	Amir M. Ben-Amram	Size-change termination with difference constraints.	ACM Trans. Program. Lang. Syst.	2008	DBLP DOI BibTeX RDF	size-change graph, size-change termination, Abstraction, program analysis, termination analysis
75	Laura K. Dillon	Task Dependence and Termination in Ada.	ACM Trans. Softw. Eng. Methodol.	1997	DBLP DOI BibTeX RDF	distributed termination, master/dependent relation, task termination, tasking execution model, Ada, Ada tasking
73	Peter Csaba Ölveczky, Olav Lysne	Order-Sorted Termination: The Unsorted Way.	ALP	1996	DBLP DOI BibTeX RDF	Order-sortedness, Termination
72	Jürgen Giesl, Aart Middeldorp	Innermost Termination of Context-Sensitive Rewriting.	Developments in Language Theory	2002	DBLP DOI BibTeX RDF
69	Alfons Geser	Loops of Superexponential Lengths in One-Rule String Rewriting.	RTA	2002	DBLP DOI BibTeX RDF	uniform termination, one-rule, single-rule Submission category: Regular research paper, termination, loop, string rewriting, semi-Thue system
69	Amir M. Ben-Amram, Chin Soon Lee	Program termination analysis in polynomial time.	ACM Trans. Program. Lang. Syst.	2007	DBLP DOI BibTeX RDF	size-change graph, size-change termination, Abstraction, program analysis, termination analysis
69	Hans Zantema	Termination of String Rewriting Proved Automatically.	J. Autom. Reason.	2005	DBLP DOI BibTeX RDF	semantic labelling, relative termination, match-bounds, termination, string rewriting
69	Alfons Geser	Termination of String Rewriting Rules That Have One Pair of Overlaps.	RTA	2003	DBLP DOI BibTeX RDF	one-rule, single-rule, uniform termination, termination, overlap, string rewriting, semi-Thue system
69	Algis Rudys, Dan S. Wallach	Termination in language-based systems.	ACM Trans. Inf. Syst. Secur.	2002	DBLP DOI BibTeX RDF	soft termination, Java, Internet, termination, Applets, resource control
67	Dean Voets, Danny De Schreye	A New Approach to Non-termination Analysis of Logic Programs.	ICLP	2009	DBLP DOI BibTeX RDF	non-termination analysis, program analysis
67	Germán Vidal	Quasi-terminating logic programs for ensuring the termination of partial evaluation.	PEPM	2007	DBLP DOI BibTeX RDF	quasi-termination, partial deduction
67	Enno Ohlebusch	Termination of Logic Programs: Transformational Methods Revisited.	Appl. Algebra Eng. Commun. Comput.	2001	DBLP DOI BibTeX RDF	Logic programs, Transformations, Termination, Term rewriting systems
67	Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik	A General Framework for Automatic Termination Analysis of Logic Programs.	Appl. Algebra Eng. Commun. Comput.	2001	DBLP DOI BibTeX RDF	Termination of logic programs, Constraints, Abstract interpretation
67	E. L. Lohse	Data communications control procedures for the USA standard code for information interchange.	Commun. ACM	1969	DBLP DOI BibTeX RDF	communication control procedures, communication error control procedures, communication establishment/termination procedures, communication message transfer procedures, communication polling/selection procedures, data communication control procedures, data communication error control procedures, data communication establishment/termination procedures, data communication message transfer procedures, data communication polling/selection procedures, data link control procedures, data link error control procedures, data link establishment, data link establishment/termination procedures, data link message transfer procedures, data link polling, data link polling/selection procedures, link control procedures, link error control procedures, link establishment/termination procedures, link message transfer procedures, link polling/selection procedures, selection procedures, termination procedures, communication, link, data communication, data link
66	Panagiotis Manolios, Aaron Turon	All-Termination(T).	TACAS	2009	DBLP DOI BibTeX RDF
63	Wojciech Moczydlowski, Alfons Geser	Termination of Single-Threaded One-Rule Semi-Thue Systems.	RTA	2005	DBLP DOI BibTeX RDF	uniform termination, one-rule, single-rule, single-threaded, well-behaved, termination, string rewriting, semi-Thue system
61	Martin C. Rinard	Using early phase termination to eliminate load imbalances at barrier synchronization points.	OOPSLA	2007	DBLP DOI BibTeX RDF	early phase termination, probabilistic cistortion models, parallel computing, barrier synchronization
61	Manh Thang Nguyen, Danny De Schreye	Polynomial Interpretations as a Basis for Termination Analysis of Logic Programs.	ICLP	2005	DBLP DOI BibTeX RDF	polynomial interpretations, acceptability, Termination analysis
61	Bernhard Gramlich, Salvador Lucas	Modular termination of context-sensitive rewriting.	PPDP	2002	DBLP DOI BibTeX RDF	context-sensitive rewriting, modular analysis and construction of programs, modular proofs of termination, program verification, declarative programming, evaluation strategies
61	Salvador Lucas	Termination of Rewriting With Strategy Annotations.	LPAR	2001	DBLP DOI BibTeX RDF	Rewriting strategies, termination
60	Jörg Endrullis, Roel C. de Vrijer, Johannes Waldmann	Local Termination.	RTA	2009	DBLP DOI BibTeX RDF
60	Toshihiko Komine, Satoshi Konishi, Hiroyuki Shinbo	A study on optimal termination target of synchronous H-ARQ for the next generation cellular system.	ISCC	2008	DBLP DOI BibTeX RDF
60	Beatriz Alarcón, Salvador Lucas	Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs.	FroCoS	2007	DBLP DOI BibTeX RDF
60	Sofie Verbaeten, Danny De Schreye, Konstantinos Sagonas	Termination proofs for logic programs with tabling.	ACM Trans. Comput. Log.	2001	DBLP DOI BibTeX RDF	prolog, tabling, SLG-resolution
60	Maria C. F. Ferreira, Hans Zantema	Syntactical Analysis of Total Termination.	ALP	1994	DBLP DOI BibTeX RDF
60	Bernhard Gramlich	Relating Innermost, Weak, Uniform and Modular Termination of Term Rewriting Systems.	LPAR	1992	DBLP DOI BibTeX RDF
60	Jean-Pierre Jouannaud, Miguel Munoz	Termination of a Set of Rules Modulo a Set of Equations.	CADE	1984	DBLP DOI BibTeX RDF
60	Nachum Dershowitz, Zohar Manna	Proving termination with Multiset Orderings.	ICALP	1979	DBLP DOI BibTeX RDF
60	Maria C. F. Ferreira, Delia Kesner, Laurence Puel	Reducing AC-Termination to Termination.	MFCS	1998	DBLP DOI BibTeX RDF
58	Frédéric Mesnard, Salvatore Ruggieri	On proving left termination of constraint logic programs.	ACM Trans. Comput. Log.	2003	DBLP DOI BibTeX RDF	Automatic termination analysis, left termination, termination inference, constraint logic programming
58	Marc Brockschmidt, Carsten Otto, Christian von Essen, Jürgen Giesl	Termination Graphs for Java Bytecode.	Verification, Induction, Termination Analysis	2010	DBLP DOI BibTeX RDF
56	Hugh Anderson, Siau-Cheng Khoo	Regular approximation and bounded domains for size-change termination.	PEPM	2010	DBLP DOI BibTeX RDF	affine size-change termination, termination analysis
56	Chin Soon Lee	Ranking functions for size-change termination.	ACM Trans. Program. Lang. Syst.	2009	DBLP DOI BibTeX RDF	?-Automaton, multiple recursion, size-change termination, determinization, ranking function, termination analysis
56	Pierre Ganty, Rupak Majumdar, Andrey Rybalchenko	Verifying liveness for asynchronous programs.	POPL	2009	DBLP DOI BibTeX RDF	asynchronous (event-driven) programming, fair termination, petri nets, liveness
56	Beatriz Alarcón, Raúl Gutiérrez, Salvador Lucas	Context-Sensitive Dependency Pairs.	FSTTCS	2006	DBLP DOI BibTeX RDF	program analysis, termination, term rewriting, Dependency pairs
55	Evelyne Contejean, Andrey Paskevich, Xavier Urbain, Pierre Courtieu, Olivier Pons, Julien Forest	A3PAT, an approach for certified automated termination proofs.	PEPM	2010	DBLP DOI BibTeX RDF	termination, term rewriting, automated reasoning, formal proof
55	Francisco Durán 0001, Salvador Lucas, Claude Marché, José Meseguer 0001, Xavier Urbain	Proving operational termination of membership equational programs.	High. Order Symb. Comput.	2008	DBLP DOI BibTeX RDF	Conditional term rewriting, Operational termination, Declarative rule-based languages, Program transformation, Membership equational logic
55	Paolo Pilozzi, Danny De Schreye	Termination Analysis of CHR Revisited.	ICLP	2008	DBLP DOI BibTeX RDF	Termination Analysis, Constraint Handling Rules
55	Damien Sereni	Termination analysis and call graph construction for higher-order functional programs.	ICFP	2007	DBLP DOI BibTeX RDF	semantics, program analysis, functional programs, termination
55	Salvador Lucas	Practical use of polynomials over the reals in proofs of termination.	PPDP	2007	DBLP DOI BibTeX RDF	polynomial orderings, program analysis, termination, term rewriting
55	René Thiemann, Jürgen Giesl	The size-change principle and dependency pairs for termination of term rewriting.	Appl. Algebra Eng. Commun. Comput.	2005	DBLP DOI BibTeX RDF	Size-change principle, Termination, Term rewriting, Dependency pairs
55	Alexander Serebrenik, Danny De Schreye	Termination of Floating-Point Computations.	J. Autom. Reason.	2005	DBLP DOI BibTeX RDF	floating point, numerical computation, termination analysis
55	Neeraj Mittal, Subbarayan Venkatesan, Sathya Peri	Message-Optimal and Latency-Optimal Termination Detection Algorithms for Arbitrary Topologies.	DISC	2004	DBLP DOI BibTeX RDF	quiescence detection, optimal message complexity, optimal detection latency, termination detection
55	Chin Soon Lee, Neil D. Jones, Amir M. Ben-Amram	The size-change principle for program termination.	POPL	2001	DBLP DOI BibTeX RDF	omega automaton, program analysis, termination, partial evaluation, PSPACE-completeness
55	Andy J. Wellings, Alan Burns 0001, Offer Pazy	Task Termination in Ada 95.	Ada-Europe	1997	DBLP DOI BibTeX RDF	termination, asynchronous communication, Ada 95
54	Francisco Durán 0001, Salvador Lucas, José Meseguer 0001	Termination Modulo Combinations of Equational Theories.	FroCoS	2009	DBLP DOI BibTeX RDF
54	Elvira Albert, Puri Arenas, Michael Codish, Samir Genaim, Germán Puebla, Damiano Zanardini	Termination Analysis of Java Bytecode.	FMOODS	2008	DBLP DOI BibTeX RDF
54	Jürgen Giesl, René Thiemann, Peter Schneider-Kamp	Proving and Disproving Termination of Higher-Order Functions.	FroCoS	2005	DBLP DOI BibTeX RDF
54	Alexander Serebrenik, Frédéric Mesnard	On Termination of Binary CLP Programs.	LOPSTR	2004	DBLP DOI BibTeX RDF
54	Frédéric Mesnard, Étienne Payet, Ulrich Neumerkel	Detecting Optimal Termination Conditions of Logic Programs.	SAS	2002	DBLP DOI BibTeX RDF
54	Yili Tseng, Ronald F. DeMara	Communication Pattern Based Methodology for Performance Analysis of Termination Detection Schemes.	ICPADS	2002	DBLP DOI BibTeX RDF
54	Samir Genaim, Michael Codish	Inferring Termination Conditions for Logic Programs Using Backwards Analysis.	LPAR	2001	DBLP DOI BibTeX RDF
54	Maria C. F. Ferreira, Hans Zantema	Total Termination of Term Rewriting.	RTA	1993	DBLP DOI BibTeX RDF
54	Bernhard Gramlich	On Proving Termination by Innermost Termination.	RTA	1996	DBLP DOI BibTeX RDF
50	Hans Zantema, Alfons Geser	A Complete Characterization of Termination of 0p 1q-> 1r 0s.	Appl. Algebra Eng. Commun. Comput.	2000	DBLP DOI BibTeX RDF	Simple termination, Transformation ordering, Dummy elimination, Derivation length, Termination, Term rewriting, String rewriting
49	Martin Korp, Christian Sternagel, Harald Zankl, Aart Middeldorp	Tyrolean Termination Tool 2.	RTA	2009	DBLP DOI BibTeX RDF	automation, termination, term rewriting
49	James Brotherston, Richard Bornat, Cristiano Calcagno	Cyclic proofs of program termination in separation logic.	POPL	2008	DBLP DOI BibTeX RDF	cyclic proof, program verification, termination, hoare logic, separation logic, inductive definitions
49	Maurice Bruynooghe, Michael Codish, John P. Gallagher, Samir Genaim, Wim Vanhoof	Termination analysis of logic programs through combination of type-based norms.	ACM Trans. Program. Lang. Syst.	2007	DBLP DOI BibTeX RDF	program analysis, Abstract interpretation, dataflow analysis, termination analysis, global analysis, groundness analysis
49	Felix C. Freiling, Matthias Majuntke, Neeraj Mittal	On Detecting Termination in the Crash-Recovery Model.	Euro-Par	2007	DBLP DOI BibTeX RDF	crash-recovery failure model, eventual safety, stabilizing algorithm, asynchronous distributed system, termination detection
49	Anish Arora, Mikhail Nesterenko	Unifying stabilization and termination in message-passing systems.	Distributed Comput.	2005	DBLP DOI BibTeX RDF	fault-tolerance, Self-stabilization, termination
49	Alfons Geser, Dieter Hofbauer, Johannes Waldmann	Termination Proofs for String Rewriting Systems via Inverse Match-Bounds.	J. Autom. Reason.	2005	DBLP DOI BibTeX RDF	match-bounded, inhibitor, termination, normalization, reachability, regular languages, context-free languages, semi-Thue systems, string rewriting systems
49	Brigitte Pientka	Verifying Termination and Reduction Properties about Higher-Order Logic Programs.	J. Autom. Reason.	2005	DBLP DOI BibTeX RDF	termination, Logical frameworks
49	Francisco Durán 0001, Salvador Lucas, José Meseguer 0001, Claude Marché, Xavier Urbain	Proving termination of membership equational programs.	PEPM	2004	DBLP DOI BibTeX RDF	program transformation, termination, term rewriting, membership equational logic
49	Salvador Lucas	Polynomials for Proving Termination of Context-Sensitive Rewriting.	FoSSaCS	2004	DBLP DOI BibTeX RDF	Programming languages, termination, rewriting
49	Salvador Lucas	Termination of (Canonical) Context-Sensitive Rewriting.	RTA	2002	DBLP DOI BibTeX RDF	(infinitary) normalization, termination, term rewriting
49	Paolo Torroni	A study on the termination of negotiation dialogues.	AAMAS	2002	DBLP DOI BibTeX RDF	multi-agent systems, negotiation, termination, dialogue, abduction, computational logic
49	Alexander Serebrenik, Danny De Schreye	Non-transformational Termination Analysis of Logic Programs, Based on General Term-Orderings.	LOPSTR (LNCS 2042: Selected Papers)	2000	DBLP DOI BibTeX RDF	acceptability, termination analysis, term-orderings
49	Stefaan Decorte, Danny De Schreye, Henk Vandecasteele	Constraint-based termination analysis of logic programs.	ACM Trans. Program. Lang. Syst.	1999	DBLP DOI BibTeX RDF	logic programming, constraint solving, termination analysis
49	Pradipta K. Dash, R. C. Hansdah	A Fault-Tolerant Distributed Algorithm for Termination Detection Using Roughly Synchronized Clocks.	ICPADS	1997	DBLP DOI BibTeX RDF	global termination, asynchronous & synchronous networks, roughly synchronized clocks, Distributed computation, resilience
49	Cheng-Zhong Xu 0001, Francis C. M. Lau 0001	Efficient Termination Detection for Loosely Synchronous Applications in Multicomputers.	IEEE Trans. Parallel Distributed Syst.	1996	DBLP DOI BibTeX RDF	synchronous computations, distributed algorithms, interconnection networks, multicomputers, Data parallelism, termination detection, parallel and distributed systems
49	Salvador Lucas	Termination of Context-Sensitive Rewriting by Rewriting.	ICALP	1996	DBLP DOI BibTeX RDF	functional programming, termination, term rewriting
49	Géraud Sénizergues	On the Termination Problem for One-Rule Semi-Thue System.	RTA	1996	DBLP DOI BibTeX RDF	rational monoid, automatic structure, termination, finite automata, semi-Thue systems
49	Gerard Tel, Friedemann Mattern	The Derivation of Distributed Termination Detection Algorithms from Garbage Collection Schemes.	ACM Trans. Program. Lang. Syst.	1993	DBLP DOI BibTeX RDF	distributed termination detection, distributed algorithms, program transformations, garbage collection
48	Adam Koprowski, Johannes Waldmann	Arctic Termination ...Below Zero.	RTA	2008	DBLP DOI BibTeX RDF
48	Frédéric Blanqui, Colin Riba	Combining Typing and Size Constraints for Checking the Termination of Higher-Order Conditional Rewrite Systems.	LPAR	2006	DBLP DOI BibTeX RDF
48	Peter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, René Thiemann	Automated Termination Analysis for Logic Programs by Term Rewriting.	LOPSTR	2006	DBLP DOI BibTeX RDF
48	Jürgen Giesl, René Thiemann, Peter Schneider-Kamp	The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs.	LPAR	2004	DBLP DOI BibTeX RDF
48	Salvador Lucas	mu-term: A Tool for Proving Termination of Context-Sensitive Rewriting.	RTA	2004	DBLP DOI BibTeX RDF
48	Hugh Anderson, Siau-Cheng Khoo	Affine-Based Size-Change Termination.	APLAS	2003	DBLP DOI BibTeX RDF
48	Frédéric Mesnard, Ulrich Neumerkel	Applying Static Analysis Techniques for Inferring Termination Conditions of Logic Programs.	SAS	2001	DBLP DOI BibTeX RDF
48	Enno Ohlebusch, Claus Claves, Claude Marché	TALP: A Tool for the Termination Analysis of Logic Programs.	RTA	2000	DBLP DOI BibTeX RDF
48	Marieke Huisman, Bart Jacobs 0001	Java Program Verification via a Hoare Logic with Abrupt Termination.	FASE	2000	DBLP DOI BibTeX RDF
48	Thomas Arts, Jürgen Giesl	Modularity of Termination Using Dependency pairs.	RTA	1998	DBLP DOI BibTeX RDF
48	Sara Porat, Nissim Francez	Full-Commutation and Fair-Termination in Equational (and Combined) Term-Rewriting Systems.	CADE	1986	DBLP DOI BibTeX RDF
48	Devendra Kumar	A Class of Termination Detection Algorithms For Distributed Computation.	FSTTCS	1985	DBLP DOI BibTeX RDF
48	René Thiemann	From Outermost Termination to Innermost Termination.	SOFSEM	2009	DBLP DOI BibTeX RDF
46	Simon Siegler, Nathan Wasser (eds.)	Verification, Induction, Termination Analysis - Festschrift for Christoph Walther on the Occasion of His 60th Birthday	Verification, Induction, Termination Analysis	2010	DBLP DOI BibTeX RDF
46	Christoph Benzmüller	Verifying the Modal Logic Cube Is an Easy Task (For Higher-Order Automated Reasoners).	Verification, Induction, Termination Analysis	2010	DBLP DOI BibTeX RDF
46	Brigitte Pientka	Programming Inductive Proofs - A New Approach Based on Contextual Types.	Verification, Induction, Termination Analysis	2010	DBLP DOI BibTeX RDF
46	Moa Johansson, Lucas Dixon, Alan Bundy	Dynamic Rippling, Middle-Out Reasoning and Lemma Discovery.	Verification, Induction, Termination Analysis	2010	DBLP DOI BibTeX RDF
46	Sabine Glesner, Björn Bartels, Thomas Göthel, Moritz Kleine	The VATES-Diamond as a Verifier's Best Friend.	Verification, Induction, Termination Analysis	2010	DBLP DOI BibTeX RDF
46	Markus Aderhold	Second-Order Programs with Preconditions.	Verification, Induction, Termination Analysis	2010	DBLP DOI BibTeX RDF
46	Serge Autexier, Dieter Hutter, Till Mossakowski	Change Management for Heterogeneous Development Graphs.	Verification, Induction, Termination Analysis	2010	DBLP DOI BibTeX RDF
46	Christoph Brandt, Jens Otten, Christoph Kreitz, Wolfgang Bibel	Specifying and Verifying Organizational Security Properties in First-Order Logic.	Verification, Induction, Termination Analysis	2010	DBLP DOI BibTeX RDF
45	Jean-Yves Moyen	Resource control graphs.	ACM Trans. Comput. Log.	2009	DBLP DOI BibTeX RDF	non-size increasing computation, size change termination, program analysis, Implicit computational complexity, program termination