Search results for "Sufficient-Completeness"

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