The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase Sufficient-Completeness (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1983-1994 (15) 1998-2021 (16) 2022 (1)
Publication types (Num. hits)
article(5) inproceedings(27)
Venues (Conferences, Journals, ...)
RTA(6) CADE(3) Acta Informatica(2) FSTTCS(2) ALP(1) CSA/CUTE(1) CSL(1) CTRS(1) ESOP(1) FroCoS(1) ICALP(1) ICTAC(1) IEEE Trans. Software Eng.(1) IJCAR(1) J. Appl. Log.(1) LPAR (Yogyakarta)(1) More (+10 of total 23)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 29 occurrences of 22 keywords

Results
Found 32 publication records. Showing 32 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
86Deepak Kapur, Paliath Narendran, Hantao Zhang 0001 Complexity of Sufficient-Completeness. Search on Bibsonomy FSTTCS The full citation details ... 1986 DBLP  DOI  BibTeX  RDF normal forms, term rewriting systems, PSPACE, Sufficient-completeness
65Adel Bouhoula Sufficient Completeness and Parameterized Proofs by Induction. Search on Bibsonomy ALP The full citation details ... 1994 DBLP  DOI  BibTeX  RDF Implicit induction, Parameterized Conditional Specifications, Theorem Proving, Term rewriting systems, Sufficient completeness
57Joe Hendrix, Manuel Clavel, José Meseguer 0001 A Sufficient Completeness Reasoning Tool for Partial Specifications. Search on Bibsonomy RTA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
40Joe Hendrix, José Meseguer 0001, Hitoshi Ohsaki A Sufficient Completeness Checker for Linear Order-Sorted Specifications Modulo Axioms. Search on Bibsonomy IJCAR The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
39Joe Hendrix, José Meseguer 0001 On the Completeness of Context-Sensitive Order-Sorted Specifications. Search on Bibsonomy RTA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
37Sergio Antoy, John D. Gannon Using Term Rewriting to Verify Software. Search on Bibsonomy IEEE Trans. Software Eng. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF verification tasks, while statements, representation functions, generic program units, abstract base classes, algebraic axioms, Boyer-Moore prover, mechanical assistance, software tools, theorem proving, convergence, program verification, abstract data types, abstract data types, term rewriting, rewriting systems, sufficient completeness, structural induction
37Emmanuel Kounalis, Denis Lugiez, Loic Pottier A Solution of the Complement Problem in Associative-Commutative Theories. Search on Bibsonomy MFCS The full citation details ... 1991 DBLP  DOI  BibTeX  RDF The Subsumption Lattice of First-Order terms, Associative and Commutative Reasoning, AC-Disunification, Pattern-Matching, Inductive Learning, Sufficient-Completeness
37Deepak Kapur, Paliath Narendran, Hantao Zhang 0001 Proof by Induction Using Test Sets. Search on Bibsonomy CADE The full citation details ... 1986 DBLP  DOI  BibTeX  RDF Inductionless Induction, Knuth-Bendix Completion Procedure, Consistency, Induction, Equational Theory, Sufficient-Completeness, Proof by Induction
31Adel Bouhoula SPIKE: a System for Sufficient Completeness and Parameterized Inductive Proofs. Search on Bibsonomy CADE The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
29Isabelle Gnaedig, Hélène Kirchner Computing constructor forms with non terminating rewrite programs. Search on Bibsonomy PPDP The full citation details ... 2006 DBLP  DOI  BibTeX  RDF constructor, abstraction, termination, narrowing, ordering constraint, sufficient completeness
22José Meseguer 0001 Checking Sufficient Completeness by Inductive Theorem Proving. Search on Bibsonomy WRLA@ETAPS The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
22Tomoki Shiraishi, Kentaro Kikuchi, Takahito Aoto 0001 A Proof Method for Local Sufficient Completeness of Term Rewriting Systems. Search on Bibsonomy ICTAC The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
22Kentaro Kikuchi, Takahito Aoto 0001 Simple Derivation Systems for Proving Sufficient Completeness of Non-Terminating Term Rewriting Systems. Search on Bibsonomy FSTTCS The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
22Daniel Gaina, Masaki Nakamura 0001, Kazuhiro Ogata 0001, Kokichi Futatsugi Stability of termination and sufficient-completeness under pushouts via amalgamation. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
22Masaki Nakamura 0001, Daniel Gâinâ, Kazuhiro Ogata 0001, Kokichi Futatsugi Proving Sufficient Completeness of Constructor-Based Algebraic Specifications. Search on Bibsonomy CSA/CUTE The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
22Masaki Nakamura 0001, Kazuhiro Ogata 0001, Kokichi Futatsugi Incremental Proofs of Termination, Confluence and Sufficient Completeness of OBJ Specifications. Search on Bibsonomy Specification, Algebra, and Software The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
22Adel Bouhoula, Florent Jacquemard Sufficient completeness verification for conditional and constrained TRS. Search on Bibsonomy J. Appl. Log. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
22Camilo Rocha, José Meseguer 0001 Constructors, Sufficient Completeness, and Deadlock Freedom of Rewrite Theories. Search on Bibsonomy LPAR (Yogyakarta) The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
22Deepak Kapur, Paliath Narendran, Daniel J. Rosenkrantz, Hantao Zhang 0001 Sufficient-Completeness, Ground-Reducibility and their Complexity. Search on Bibsonomy Acta Informatica The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
22Wadoud Bousdira, Jean-Luc Rémy On Sufficient Completeness of Conditional Specifications. Search on Bibsonomy CTRS The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
22Deepak Kapur, Paliath Narendran, Hantao Zhang 0001 On Sufficient-Completeness and Related Properties of Term Rewriting Systems. Search on Bibsonomy Acta Informatica The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
22Tobias Nipkow, Gerhard Weikum A decidability result about sufficient-completeness of axiomatically specified abstract data types. Search on Bibsonomy Theoretical Computer Science The full citation details ... 1983 DBLP  DOI  BibTeX  RDF
17Takahito Aoto 0001, Toshiyuki Yamada, Yoshihito Toyama Inductive Theorems for Higher-Order Rewriting. Search on Bibsonomy RTA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
9Ernst Althaus, Evgeny Kruglov, Christoph Weidenbach Superposition Modulo Linear Arithmetic SUP(LA). Search on Bibsonomy FroCoS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
9Joe Hendrix, Hitoshi Ohsaki, Mahesh Viswanathan 0001 Propositional Tree Automata. Search on Bibsonomy RTA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
9Thomas Genet Decidable Approximations of Sets of Descendants and Sets of Normal Forms. Search on Bibsonomy RTA The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
9Sébastien Limet, Pierre Réty Solving Disequations Modulo Some Class of Rewrite Systems. Search on Bibsonomy RTA The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
9C.-H. Luke Ong, Eike Ritter A Generic Strong Normalization Argument: Application to the Calculus of Constructions. Search on Bibsonomy CSL The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
9Nachum Dershowitz, Stéphane Kaplan, David A. Plaisted Infinite Normal Forms (Preliminary Version). Search on Bibsonomy ICALP The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
9Gilles Bernot, Michel Bidoit, Christine Choppy Algebraic Semantics of Exception Handling. Search on Bibsonomy ESOP The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
9Hubert Comon Sufficient Completness, Term Rewriting Systems and "Anti-Unification". Search on Bibsonomy CADE The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
9Gilles Bernot, Michel Bidoit, Christine Choppy Abstract Implementations and Correctness Proofs. Search on Bibsonomy STACS The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #32 of 32 (100 per page; Change: )
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