The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for termination with no syntactic query expansion in all metadata.

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