|
|
Venues (Conferences, Journals, ...)
|
|
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 |
86 | Deepak Kapur, Paliath Narendran, Hantao Zhang 0001 |
Complexity of Sufficient-Completeness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, Sixth Conference, New Delhi, India, December 18-20, 1986, Proceedings, pp. 426-442, 1986, Springer, 3-540-17179-7. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
normal forms, term rewriting systems, PSPACE, Sufficient-completeness |
65 | Adel Bouhoula |
Sufficient Completeness and Parameterized Proofs by Induction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALP ![In: Algebraic and Logic Programming, 4th International Conference, ALP'94, Madid, Spain, September 14-16, 1994, Proceedings, pp. 23-40, 1994, Springer, 3-540-58431-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Term Rewriting and Applications, 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005, Proceedings, pp. 165-174, 2005, Springer, 3-540-25596-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
40 | Joe Hendrix, José Meseguer 0001, Hitoshi Ohsaki |
A Sufficient Completeness Checker for Linear Order-Sorted Specifications Modulo Axioms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAR ![In: Automated Reasoning, Third International Joint Conference, IJCAR 2006, Seattle, WA, USA, August 17-20, 2006, Proceedings, pp. 151-155, 2006, Springer, 3-540-37187-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
39 | Joe Hendrix, José Meseguer 0001 |
On the Completeness of Context-Sensitive Order-Sorted Specifications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Term Rewriting and Applications, 18th International Conference, RTA 2007, Paris, France, June 26-28, 2007, Proceedings, pp. 229-245, 2007, Springer, 978-3-540-73447-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
37 | Sergio Antoy, John D. Gannon |
Using Term Rewriting to Verify Software. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 20(4), pp. 259-274, 1994. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1991, 16th International Symposium, MFCS'91, Kazimierz Dolny, Poland, September 9-13, 1991, Proceedings, pp. 287-297, 1991, Springer, 3-540-54345-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: 8th International Conference on Automated Deduction, Oxford, England, July 27 - August 1, 1986, Proceedings, pp. 99-117, 1986, Springer, 3-540-16780-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: Automated Deduction - CADE-12, 12th International Conference on Automated Deduction, Nancy, France, June 26 - July 1, 1994, Proceedings, pp. 836-840, 1994, Springer, 3-540-58156-1. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
29 | Isabelle Gnaedig, Hélène Kirchner |
Computing constructor forms with non terminating rewrite programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPDP ![In: Proceedings of the 8th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, July 10-12, 2006, Venice, Italy, pp. 121-132, 2006, ACM, 1-59593-388-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
constructor, abstraction, termination, narrowing, ordering constraint, sufficient completeness |
22 | José Meseguer 0001 |
Checking Sufficient Completeness by Inductive Theorem Proving. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WRLA@ETAPS ![In: Rewriting Logic and Its Applications - 14th International Workshop, WRLA@ETAPS 2022, Munich, Germany, April 2-3, 2022, Revised Selected Papers, pp. 171-190, 2022, Springer, 978-3-031-12440-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
22 | Tomoki Shiraishi, Kentaro Kikuchi, Takahito Aoto 0001 |
A Proof Method for Local Sufficient Completeness of Term Rewriting Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAC ![In: Theoretical Aspects of Computing - ICTAC 2021 - 18th International Colloquium, Virtual Event, Nur-Sultan, Kazakhstan, September 8-10, 2021, Proceedings, pp. 386-404, 2021, Springer, 978-3-030-85314-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
22 | Kentaro Kikuchi, Takahito Aoto 0001 |
Simple Derivation Systems for Proving Sufficient Completeness of Non-Terminating Term Rewriting Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021, December 15-17, 2021, Virtual Conference., pp. 49:1-49:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-215-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 848, pp. 82-105, 2020. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSA/CUTE ![In: Advances in Computer Science and Ubiquitous Computing - CSA & CUTE 2015, Cebu, Philippines, December 15-17, 2015, pp. 15-21, 2015, Springer, 978-981-10-0280-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Specification, Algebra, and Software ![In: Specification, Algebra, and Software - Essays Dedicated to Kokichi Futatsugi, pp. 92-109, 2014, Springer, 978-3-642-54623-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
22 | Adel Bouhoula, Florent Jacquemard |
Sufficient completeness verification for conditional and constrained TRS. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Appl. Log. ![In: J. Appl. Log. 10(1), pp. 127-143, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
22 | Camilo Rocha, José Meseguer 0001 |
Constructors, Sufficient Completeness, and Deadlock Freedom of Rewrite Theories. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR (Yogyakarta) ![In: Logic for Programming, Artificial Intelligence, and Reasoning - 17th International Conference, LPAR-17, Yogyakarta, Indonesia, October 10-15, 2010. Proceedings, pp. 594-609, 2010, Springer, 978-3-642-16241-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
22 | Deepak Kapur, Paliath Narendran, Daniel J. Rosenkrantz, Hantao Zhang 0001 |
Sufficient-Completeness, Ground-Reducibility and their Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Acta Informatica ![In: Acta Informatica 28(4), pp. 311-350, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
22 | Wadoud Bousdira, Jean-Luc Rémy |
On Sufficient Completeness of Conditional Specifications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CTRS ![In: Conditional and Typed Rewriting Systems, 2nd International CTRS Workshop, Montreal, Canada, June 11-14, 1990, Proceedings, pp. 272-286, 1990, Springer, 3-540-54317-1. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
22 | Deepak Kapur, Paliath Narendran, Hantao Zhang 0001 |
On Sufficient-Completeness and Related Properties of Term Rewriting Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Acta Informatica ![In: Acta Informatica 24(4), pp. 395-415, 1987. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
22 | Tobias Nipkow, Gerhard Weikum |
A decidability result about sufficient-completeness of axiomatically specified abstract data types. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theoretical Computer Science ![In: Theoretical Computer Science, 6th GI-Conference, Dortmund, Germany, January 5-7, 1983, Proceedings, pp. 257-268, 1983, Springer, 3-540-11973-6. The full citation details ...](Pics/full.jpeg) |
1983 |
DBLP DOI BibTeX RDF |
|
17 | Takahito Aoto 0001, Toshiyuki Yamada, Yoshihito Toyama |
Inductive Theorems for Higher-Order Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 15th International Conference, RTA 2004, Aachen, Germany, June 3-5, 2004, Proceedings, pp. 269-284, 2004, Springer, 3-540-22153-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
9 | Ernst Althaus, Evgeny Kruglov, Christoph Weidenbach |
Superposition Modulo Linear Arithmetic SUP(LA). ![Search on Bibsonomy](Pics/bibsonomy.png) |
FroCoS ![In: Frontiers of Combining Systems, 7th International Symposium, FroCoS 2009, Trento, Italy, September 16-18, 2009. Proceedings, pp. 84-99, 2009, Springer, 978-3-642-04221-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
9 | Joe Hendrix, Hitoshi Ohsaki, Mahesh Viswanathan 0001 |
Propositional Tree Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Term Rewriting and Applications, 17th International Conference, RTA 2006, Seattle, WA, USA, August 12-14, 2006, Proceedings, pp. 50-65, 2006, Springer, 3-540-36834-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
9 | Thomas Genet |
Decidable Approximations of Sets of Descendants and Sets of Normal Forms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 9th International Conference, RTA-98, Tsukuba, Japan, March 30 - April 1, 1998, Proceedings, pp. 151-165, 1998, Springer, 3-540-64301-X. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
9 | Sébastien Limet, Pierre Réty |
Solving Disequations Modulo Some Class of Rewrite Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 9th International Conference, RTA-98, Tsukuba, Japan, March 30 - April 1, 1998, Proceedings, pp. 121-135, 1998, Springer, 3-540-64301-X. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
9 | C.-H. Luke Ong, Eike Ritter |
A Generic Strong Normalization Argument: Application to the Calculus of Constructions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 7th Workshop, CSL '93, Swansea, United Kingdom, September 13-17, 1993, Selected Papers, pp. 261-279, 1993, Springer, 3-540-58277-0. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
9 | Nachum Dershowitz, Stéphane Kaplan, David A. Plaisted |
Infinite Normal Forms (Preliminary Version). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 16th International Colloquium, ICALP89, Stresa, Italy, July 11-15, 1989, Proceedings, pp. 249-262, 1989, Springer, 3-540-51371-X. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
9 | Gilles Bernot, Michel Bidoit, Christine Choppy |
Algebraic Semantics of Exception Handling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESOP ![In: ESOP 86, European Symposium on Programming, Saarbrücken, Federal Republic of Germany, March 17-19, 1986, Proceedings, pp. 173-186, 1986, Springer, 3-540-16442-1. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
9 | Hubert Comon |
Sufficient Completness, Term Rewriting Systems and "Anti-Unification". ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: 8th International Conference on Automated Deduction, Oxford, England, July 27 - August 1, 1986, Proceedings, pp. 128-140, 1986, Springer, 3-540-16780-3. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
9 | Gilles Bernot, Michel Bidoit, Christine Choppy |
Abstract Implementations and Correctness Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 86, 3rd Annual Symposium on Theoretical Aspects of Computer Science, Orsay, France, January 16-18, 1986, Proceedings, pp. 236-251, 1986, Springer, 3-540-16078-7. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #32 of 32 (100 per page; Change: )
|
|