radico's library 213 articles Export

	On sufficient-completeness and related properties of term rewriting systems [My Copy] Acta Informatica, Vol. 24, No. 4. (1 August 1987), pp. 395-415. by Deepak Kapur, Paliath Narendran, Hantao Zhang posted to sufficient-completeness quasi-reducibility by radico on 2009-09-01 09:00:54 as
	Tyrolean Termination Tool 2 [My Copy] Rewriting Techniques and Applications (2009), pp. 295-304. by Martin Korp, Christian Sternagel, Harald Zankl, Aart Middeldorp posted to implementation termination by radico on 2009-07-07 10:56:44 as
	KBO Orientability [My Copy] Journal of Automated Reasoning by Harald Zankl, Nao Hirokawa, Aart Middeldorp posted to kbo sat termination by radico on 2009-06-04 03:58:07 as
	A parallel completion procedure for term rewriting systems [My Copy] Automated Deduction—CADE-11 (1992), pp. 109-123. by Katherine Yelick, Stephen Garland posted to completion multi-completion by radico on 2009-03-14 13:18:00 as
	A divergence critic [My Copy] Automated Deduction — CADE-12 (1994), pp. 14-28. by Toby Walsh posted to divergence lemma-generation rippling by radico on 2009-03-14 11:11:18 as
	Dummy elimination in equational rewriting [My Copy] Rewriting Techniques and Applications (1996), pp. 78-92. by M. Ferreira posted to dummy-elimination termination-modulo-theory by radico on 2009-02-12 15:26:02 as
	Using an induction prover for verifying arithmetic circuits [My Copy] International Journal on Software Tools for Technology Transfer (STTT), Vol. 3, No. 1. (2000), pp. 32-65. by Deepak Kapur, Mahadevan Subramaniam posted to application inductive-theorem by radico on 2009-01-22 01:09:48 as
	Automated Induction with Constrained Tree Automata [My Copy] Automated Reasoning (2008), pp. 539-554. by Adel Bouhoula, Florent Jacquemard posted to inductive-theorem tree-automata by radico on 2009-01-13 02:38:37 as
	Extending Decision Procedures with Induction Schemes [My Copy] Automated Deduction - CADE-17 (2000), pp. 324-345. by Deepak Kapur, Mahadavan Subramaniam posted to inductive-theorem by radico on 2009-01-13 02:24:50 as
	Deciding Inductive Validity of Equations [My Copy] Automated Deduction – CADE-19 (2003), pp. 17-31. by Jürgen Giesl, Deepak Kapur posted to inductive-theorem by radico on 2009-01-07 02:22:28 as
	An AC-Compatible Knuth-Bendix Order [My Copy] Automated Deduction – CADE-19 (2003), pp. 47-59. by Konstantin Korovin, Andrei Voronkov posted to ac-termination by radico on 2009-01-07 02:19:36 as
	Keyword programming in Java [My Copy] Automated Software Engineering by Greg Little, Robert Miller posted to keyword-programming by radico on 2009-01-01 18:10:58 as
	On nontermination of Knuth-Bendix algorithm [My Copy] Automata, Languages and Programming (1986), pp. 146-156. by Mikuláš Hermann, Igor Prívara posted to completion divergence by radico on 2008-11-29 14:53:02 as
	A Fully Syntactic AC-RPO [My Copy] Information and Computation, Vol. 178, No. 2. (01 November 2002), pp. 515-533. by A. Rubio posted to ac-termination recursive-path-order by radico on 2008-11-17 01:24:06 as
	Towards Modular Algebraic Specifications for Pointer Programs: A Case Study [My Copy] Rewriting, Computation and Proof (2007), pp. 235-258. by Claude Marché posted to algebraic-specification examples by radico on 2008-11-17 00:50:52 as
	Completion modulo associativity, commutativity and identity (AC1) [My Copy] Design and Implementation of Symbolic Computation Systems (1990), pp. 111-120. by Jean-Pierre Jouannaud, Claude Marché posted to ac-completion by radico on 2008-11-14 09:12:52 as
	Normalized Rewriting: an unified view of Knuth-Bendix completion and Grobner bases computation [My Copy] posted to ac-completion by radico on 2008-11-14 09:00:13 as
	Elimination Transformations for AssociativeCommutative Rewriting Systems [My Copy] Journal of Automated Reasoning, Vol. 37, No. 3. (October 2006), pp. 205-229. by Keiichirou, Kusakari, Masaki, Nakamura, Yoshihito, Toyama posted to ac-termination by radico on 2008-11-14 03:24:50 as
	Termination and completion modulo associativity, commutativity and identity [My Copy] Theoretical Computer Science, Vol. 104, No. 1. (5 October 1992), pp. 29-51. by J. Jouannaud posted to ac-completion ac-termination by radico on 2008-11-13 03:36:14 as
	Completion for rewriting modulo a congruence [My Copy] Theoretical Computer Science, Vol. 67, No. 2-3. (3 October 1989), pp. 173-201. by L. Bachmair posted to ac-completion by radico on 2008-11-13 01:45:08 as
	Reduction techniques for first-order reasoning [My Copy] Conditional Term Rewriting Systems (1993), pp. 242-256. by Francois Bronsard, Uday Reddy posted to contextual-deduction rewriting-induction by radico on 2008-10-29 08:49:22 as
	Conditional rewriting in focus [My Copy] Conditional and Typed Rewriting Systems (1991), pp. 1-13. by Francois Bronsard, Uday Reddy posted to contextual-deduction rewriting-induction by radico on 2008-10-29 08:47:17 as
	On ground-confluence of term rewriting systems [My Copy] Inf. Comput., Vol. 86, No. 1. (1990), pp. 14-31. by Deepak Kapur, Paliath Narendran, Friedrich Otto posted to ground-confluence by radico on 2008-10-24 10:10:24 as
	Implicit induction in conditional theories [My Copy] Journal of Automated Reasoning, Vol. 14, No. 2. (1 June 1995), pp. 189-235. by Adel Bouhoula, Michaël Rusinowitch posted to conditional-rewriting implicit-induction by radico on 2008-10-17 09:33:13 as
	Only prime superpositions need be considered in the Knuth-Bendix completion procedure [My Copy] Journal of Symbolic Computation, Vol. 6, No. 1. (August 1988), pp. 19-36. by D. Kapur, D. Musser, P. Narendran posted to completion critical-pair-criteria by radico on 2008-10-17 09:03:27 as
	Critical pair criteria for completion [My Copy] Journal of Symbolic Computation, Vol. 6, No. 1. (August 1988), pp. 1-18. by L. Bachmair, N. Dershowitz posted to completion critical-pair-criteria by radico on 2008-10-17 09:02:03 as
	Completion of a set of rules modulo a set of equations [My Copy] In POPL '84: Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages (1984), pp. 83-92. by Jean P. Jouannaud, Helene Kirchner posted to ac-completion completion by radico on 2008-10-17 08:36:09 as
	A critical pair criterion for completion modulo a congruence [My Copy] Eurocal '87 (1989), pp. 452-453. by Leo Bachmair, Nachum Dershowitz posted to completion critical-pair-criteria by radico on 2008-10-17 08:16:17 as
	On solving the equality problem in theories defined by Horn clauses [My Copy] Theoretical Computer Science, Vol. 44 (1986), pp. 127-153. by E. Paul posted to completion by radico on 2008-10-17 08:03:31 as
	Canonical forms in finitely presented algebras [My Copy] 7th International Conference on Automated Deduction (1984), pp. 142-165. by Philippe Le Chenadec posted to completion examples by radico on 2008-10-17 07:46:29 as
	An algebraic development technique for information systems [My Copy] Algebraic Methodology and Software Technology (1995), pp. 446-460. by Martin Gogolla, Rudolf Herzig posted to algebraic-specification application by radico on 2008-10-17 02:51:13 as
	Validation of the JavaCard Platform with Implicit Induction Techniques [My Copy] RewritingTechniques and Applications (2003), pp. 150-150. by Gilles Barthe, Sorin Stratulat posted to application implicit-induction inductive-theorem by radico on 2008-10-17 02:47:26 as
	Combining Rewriting with Noetherian Induction to Reason on Non-orientable Equalities [My Copy] Rewriting Techniques and Applications (2008), pp. 351-365. by Sorin Stratulat posted to inductive-theorem rewriting-induction by radico on 2008-10-17 02:39:46 as
	Difference matching [My Copy] Automated Deduction—CADE-11 (1992), pp. 295-309. by David Basin, Toby Walsh posted to divergence rippling by radico on 2008-10-17 02:13:22 as
	Fast Knuth-Bendix completion: Summary [My Copy] Rewriting Techniques and Applications (1989), pp. 551-555. by Jim Christian posted to completion implementation by radico on 2008-10-10 05:39:03 as
	SPIKE-AC: A system for proofs by induction in Associative-Commutative theories [My Copy] Rewriting Techniques and Applications (1996), pp. 428-431. by Narjes Berregeb, Adel Bouhoula, Michaël Rusinowitch posted to ac-unification rewriting-induction by radico on 2008-10-02 07:47:47 as along with 1 person robertjohnsimmons
	Lectures on Semantics: The initial algebra and final coalgebra perspectives [My Copy] by Peter Aczel posted to no-tag by radico on 2008-09-19 06:18:55 as along with 1 person msakai
	The Design of the CADE-16 Inductive Theorem Prover Contest [My Copy] Automated Deduction — CADE-16 (1999), pp. 676-676. by Dieter Hutter, Alan Bundy posted to inductive-theorem by radico on 2008-09-19 05:48:23 as
	Solving Partial Order Constraints for LPO Termination [My Copy] Term Rewriting and Applications (2006), pp. 4-18. by Michael Codish, Vitaly Lagoon, Peter Stuckey posted to termination by radico on 2008-09-05 10:47:44 as
	Multi-completion with Termination Tools (System Description) [My Copy] Automated Reasoning (2008), pp. 306-312. by Haruhiko Sato, Sarah Winkler, Masahito Kurihara, Aart Middeldorp posted to completion multi-completion by radico on 2008-09-02 07:16:07 as
	Rippling: A Heuristic for Guiding Inductive Proofs [My Copy] by Alan Bundy, Andrew Stevens, Frank Van Harmelen, Andrew Ireland, Alan Smaill posted to inductive-theorem rippling by radico on 2008-09-01 20:39:04 as
	Stop losing sleep over incomplete data type specifications [My Copy] In POPL '84: Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages (1984), pp. 76-82. by Jean J. Thiel posted to ground-reducibility quasi-reducibility sufficient-completeness by radico on 2008-08-14 23:27:03 as
	Termination of associative-commutative rewriting by dependency pairs [My Copy] In 9th International Conference on Rewriting Techniques and Applications, volume 1379 of Lecture, pp. 241-255. by Claude March, Xavier Urbain posted to ac-termination dependency-pair by radico on 2008-08-13 20:12:02 as
	Deductive and Inductive Synthesis of Equational Programs [My Copy] Journal of Symbolic Computation, Vol. 15 (1993), pp. 234-239. by Nachum Dershowitz, Uday S. Reddy posted to inductive-theorem program-fusion program-synthesis by radico on 2008-08-13 11:47:34 as
	Automated theorem proving by test set induction [My Copy] Journal of Symbolic Computation, Vol. 23 (1997) by Adel Bouhoula, Inria Lorraine posted to inductive-theorem test-set-induction by radico on 2008-08-13 11:43:48 as
	Using term ordering to control clausal deduction [My Copy] (1995) by Francois Bronsard posted to contextual-deduction inductive-theorem rewriting-induction by radico on 2008-08-08 08:27:02 as
	Induction using term orderings [My Copy] Automated Deduction — CADE-12 (1994), pp. 102-117. by Francois Bronsard, Uday Reddy, Robert Hasker posted to inductive-theorem rewriting-induction by radico on 2008-08-08 08:09:43 as
	How to prove equivalence of term rewriting systems without induction [My Copy] 8th International Conference on Automated Deduction (1986), pp. 118-127. by Yoshihito Toyama posted to inductive-theorem by radico on 2008-07-23 20:57:47 as
	Inductionless induction and rewriting induction [My Copy] Computer Software, Vol. 17, No. 6. (2000), pp. 1-12. by H. Koike, Y. Toyama posted to inductive-theorem rewriting-induction by radico on 2008-07-23 20:54:48 as
	Automatic proofs by induction in theories without constructors1 [My Copy] Information and Computation*, Vol. 82, No. 1. (July 1989), pp. 1-33. by J. Jouannaud posted to implicit-induction inductive-theorem by radico on 2008-07-23 20:49:16 as

Note: You may cite this page as: http://www.citeulike.org/user/radico

Result page: 1 2 3 4 5 Next

completion	54
inductive-theorem	38
termination	25
ac-unification	13
divergence	13
dependency-pair	12
application	11
ac-completion	10
trs	10
rewriting-induction	9
verification	8
unfailing-completion	8
survey	8
examples	7
ground-reducibility	7
algebraic-specification	6
ac-termination	6
implementation	5
example	5
algebraic-proof-mining	5
implicit-induction	5
induction	5
dependent-types	4
multi-completion	4
automata	4
modularity	4
program-fusion	4
proof-mining	3
e-unification	3
transformation	3
functional-logic-programming	3
critical-pair-criteria	3
polynomial-ordering	3
contextual-deduction	3
sat	3
rippling	3
lemma-generation	3
rewriting	3
sufficient-completeness	3
conditional-rewriting	2
test-set-induction	2
strongly-connected-components	2
refinement-types	2
ground-confluence	2
graph	2
program-synthesis	2
kbo	2
congruence	2
abstract-data-types	2
protocol	2
confluence	2
narrowing	2
liveness	2
proof-by-consistency	2
quasi-reducibility	2
extended-rules	1
termination-modulo-theory	1
hoare-logic	1
haskell	1
hidden-algebra	1
observational-proof	1
semantic-path-ordering	1
functional-programming	1
software-visualization	1
strs	1
tree-automata	1
keyword-programming	1
rewriting-logic	1
monad	1
trs-compiler	1
linear-programming	1
ground-completion	1
dummy-elimination	1
cover-set-induction	1
recursive-path-order	1
multiple-termination	1
incremental-termination	1
object-oriented-programming	1
semantic-labelling	1
diophantine-constraint	1
model-checking	1

radico's library 213 articles Export

radico's tags